PATH PLANNING AND OBSTACLE AVOIDANCE METHODS FOR AUTONOMOUS MOBILE ROBOTS
Abstract
Navigation and path planning are among the central problems in the development of mobile and autonomous robots. Research in this field has been conducted for decades, and several methodologies have been proposed to solve these problems. In the field, these approaches are divided into classical or deterministic and non-deterministic or heuristic methods. The article provides a brief overview of typical representatives of both classes, as well as an extended review of methods based on artificial potential fields.
Important characteristics of obstacle detection and avoidance algorithms include convergence, computation time, and memory requirements in the system. The need for convergence arises from the requirement to achieve a stable or desired state of the system. This time varies depending on the chosen algorithm, the nature of the task, and the initial conditions. The main goal is to reduce convergence time, i.e., to reach the desired state as quickly as possible. Computation time and memory requirements are important because the robot must respond to the working environment and changes in it in real-time, and autonomous robots usually have quite limited hardware resources. Therefore, these are also important characteristics when selecting a method for a specific task and robot. The modification of the classical artificial potential field method using the Gaussian function to describe repulsive forces is an example of optimizing the method for systems with constrained resources. As of the writing of the article, unmanned aerial vehicles with limited resources are beginning to be widely used, making such optimizations practically valuable.
Among the considered methods, heuristic ones are relatively new and are increasingly finding practical application. Research at the time of writing focuses on optimizing existing algorithms and hybridization to improve efficiency. An example of such hybridization is the artificial potential field method using fuzzy logic. This combines the classical artificial potential field method with a heuristic approach—fuzzy logic. This leads to some complexity in the method but solves typical problems of the classical algorithm, such as local minima, and increases the optimality and smoothness of the path.
Most of obstacle detection and avoidance algorithms are working with only one type of sensor, such as ultrasonic distance sensors, LIDAR, or cameras. Each sensor technology and corresponding algorithms have their advantages and disadvantages. A promising approach is to use several types of sensors and algorithms, combining the results of different algorithms to achieve a more optimal final result, so called sensor fusion. However, it should be noted that this approach will require more sophisticated hardware.
As robots increasingly become part of everyday life, it is quite possible that they will start working in collaboratively and interacting to solve assigned tasks. The development of collaborative methods for obstacle avoidance and interaction between robots in a single working environment is also a promising research direction.
In summary, the gradual robotization of many processes in everyday life or production generates a high demand for research in the field of mobile robotics in general and methods for obstacle detection, avoidance and path planning in particular.
Key words: robotics, obstacle avoidance, path planning, artificial potential field, autonomous robots, mobile robots.
Full Text:
PDF (Українська)References
- V. Lumelsky, A. Stepanov: Path planning strategies for a point mobile automation moving admist unknown obstacles of arbitrary shape, Algorithmica 2, 403-430, 1987.
- Borenstein, J.; Koren, Y. The Vector Field Histogram-Fast Obstacle Avoidance For Mobile Robots. Robot. Autom. IEEE Trans. 1991, 7, 278 – 288. https://doi.org/10.1109/70.88137.
- D. Fox, W. Burgard, S. Thrun, The dynamic window approach to collision avoidance, IEEE Robotics Au-tom. Mag.4(1), 23–33, 1997.
- J. Mingue, The obstacle restriction method: Obstacle avoidance in difficult scenarios, IEEE/RSJ Int. Conf. Intell. Robot Syst. (IROS), 2005.
- O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '85), vol. 2, pp. 500–505, 1985.
- J. W. Park, H. J. Kwak, Y. C. Kang, and D. W. Kim. “Advanced Fuzzy Potential Field Method for Mobile Robot Obstacle Avoidance,” Computational Intelligence and Neuroscience, vol. 2016, Article ID 6047906, 13 pages, 2016. https://doi.org/10.1155/2016/6047906
- Cho, Jang-Ho, Pae, Dong-Sung, Lim, Myo-Taeg, Kang, Tae-Koo, A Real-Time Obstacle Avoidance Method for Autonomous Vehicles Using an Obstacle-Dependent Gaussian Potential Field, Journal of Advanced Transportation, 2018, 5041401, 15 pages, 2018. https://doi.org/10.1155/2018/5041401
- I. Berizka, R. Romanyshyn, O. Savitskyy, “Customizable IoT Solution Based on ESP32 MCU”, International Scientific and Practical Conference “Electronics and Information Technologies” (ELIT-2022), Issue 19. P. 75–85, 2022.
- Bruno Siciliano, Oussama Khatib, “Springer Handbook of Robotics”, 2nd Edition, 2016.
- Dijkstra, E.W. A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: His Life, Work, and Legacy; Association for Computing Machinery: New York, NY, USA, 2022; pp. 287–290.
- Sabo, C.; Cohen, K. Fuzzy logic unmanned air vehicle motion planning. Adv. Fuzzy Syst. 2012, 2012, 13–13.
- Gonzalez, R.; Kloetzer, M.; Mahulea, C. Comparative study of trajectories resulted from cell decomposition path planning approaches. In Proceedings of the 2017 21st International Conference on System Theory, Control and Computing (ICSTCC), Sinaia, Romania, 19–21 October 2017; pp. 49–54.
- Kirono, S.; Arifianto, M.I.; Putra, R.E.; Musoleh, A.; Setiadi, R. Graph-based modeling and dijkstra algorithm for searching vehicle routes on highways. Int. J. Mech. Eng. Technol. (IJMET) 2018, 9, 1273–1280.
- Wang, C.; Cheng, C.; Yang, D.; Pan, G.; Zhang, F. Path planning in localization uncertaining environment based on Dijkstra method. Front. Neurorobot. 2022, 16, 821991.
- Y.Singh S.Sharma, R.Sutton, D. Optimal path planning of an unmanned surface vehicle in a real-time marine environment using a dijkstra algorithm. Mar. Navig. 2017, 399–402.
- Chen, R.; Hu, J.; Xu, W. An RRT-Dijkstra-based path planning strategy for autonomous vehicles. Appl. Sci. 2022, 12, 11982.
- Broumi, S.; Bakal, A.; Talea, M.; Smarandache, F.; Vladareanu, L. Applying Dijkstra algorithm for solving neutrosophic shortest path problem. In Proceedings of the 2016 International Conference on Advanced Mechatronic Systems (ICAMechS), Melbourne, Australia, 30 November–3 December 2016; pp. 412–416.
- Dhulkefl, E.; Durdu, A.; Terzio˘glu, H. Dijkstra Algorithm Using Uav Path Planning. Konya J. Eng. Sci. 2020, 8, 92–105.
- Yufka, A.; Parlaktuna, O. Performance comparison of bug algorithms for mobile robots. In Proceedings of the 5th International Advanced Technologies Symposium, Karabuk, Turkey, 13–15 May 2009; pp. 13–15.
- Neloy, M.; Das, M.; Barua, P.; Pathak, A.; Rahat, S.U. An intelligent obstacle and edge recognition system using bug algorithm. Am. Sci. Res. J. Eng. Technol. Sci. 2020, 64, 133–143.
- Wang, X.; Yin, Y.; Jing, Q. Maritime Search Path Planning Method of an Unmanned Surface Vehicle Based on an Improved Bug Algorithm. J. Mar. Sci. Eng. 2023, 11, 2320.
- Dong, T.; Zhang, Y.; Xiao, Q.; Huang, Y. The Control Method of Autonomous Flight Avoidance Barriers of UAVs in Confined Environments. Sensors 2023, 23, 5896.
- LaValle, S. Rapidly-Exploring Random Trees: A New Tool for Path Planning; Research Report 9811; 1998. Available online: https://msl.cs.illinois.edu/~lavalle/papers/Lav98c.pdf
- Jang, D.u.; Kim, J.s. Development of Ship Route-Planning Algorithm Based on Rapidly-Exploring Random Tree (RRT*) Using Designated Space. J. Mar. Sci. Eng. 2022, 10, 1800.
- Pérez-Hurtado, I.; Martínez-del Amor, M.Á.; Zhang, G.; Neri, F.; Pérez-Jiménez, M.J. A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning. Integr. Comput.-Aided Eng. 2020, 27, 121–138.
- Shi, Y.; Li, Q.; Bu, S.; Yang, J.; Zhu, L. Research on intelligent vehicle path planning based on rapidly-exploring random tree. Math. Probl. Eng. 2020, 2020, 1–14.
- Kang, J.-G.; Lim, D.-W.; Choi, Y.-S.; Jang, W.-J.; Jung, J.-W. Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning. Sensors 2021, 21, 333. https://doi.org/10.3390/s21020333 .
- Wei, K.; Ren, B. A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm. Sensors 2018, 18, 571. https://doi.org/10.3390/s18020571
- Luo, S.; Zhang, M.; Zhuang, Y.; Ma, C.; Li, Q. A survey of path planning of industrial robots based on rapidly exploring random trees. Front. Neurorobot. 2023, 17, 1268447
- Jang, D.u.; Kim, J.s. Development of Ship Route-Planning Algorithm Based on Rapidly-Exploring Random Tree (RRT*) Using Designated Space. J. Mar. Sci. Eng. 2022, 10, 1800
- Löfgren, K. Rapidly-Exploring Random Trees for real-time combined Exploration and Path Planning. 2023
- CHANG Xin-xin, HU Wei, JI Shu-de, YUE Yu-mei. Obstacle Avoidance of Mobile Robot Based on Improved Dynamic Window Method[J]. Modular Machine Tool & Automatic Manufacturing Technique, 2021, 0(7): 33-36,39 https://doi.org/10.13462/j.cnki.mmtamt.2021.07.008
- Kim, J., Yang, GH. Improvement of Dynamic Window Approach Using Reinforcement Learning in Dynamic Environments. Int. J. Control Autom. Syst. 20, 2983–2992 (2022). https://doi.org/10.1007/s12555-021-0462-9
- Hart, P.E.; Nilsson, N.J.; Raphael, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 1968, 4, 100–107
- Yao, J.; Lin, C.; Xie, X.; Wang, A.J.; Hung, C.C. Path Planning for Virtual Human Motion Using Improved A* Star Algorithm. In Proceedings of the 2010 Seventh International Conference on Information Technology: New Generations, Las Vegas, NV, USA, 12–14 April 2010; pp. 1154–1158
- Guan, W.; Wang, K. Autonomous collision avoidance of unmanned surface vehicles based on improved A-star and dynamic window approach algorithms. IEEE Intell. Transp. Syst. Mag. 2023, 113, 102755
- Tang, G.; Tang, C.; Claramunt, C.; Hu, X.; Zhou, P. Geometric A-star algorithm: An improved A-star algorithm for AGV path planning in a port environment. IEEE Access 2021, 9, 59196–59210
- Gao, X.; Jia, Q.; Sun, H.; Chen, G. Research on path planning for 7-DOF space manipulator to avoid obstacle based on A* algorithm. Sens. Lett. 2011, 9, 1515–1519
- Bremermann, H.J. The Evolution of Intelligence: The Nervous System as a Model of Its Environment; University of Washington, Department of Mathematics: Washington, DC, USA, 1958
- Adzhar, N.; Salleh, S.; Yusof, Y.; Ahmad, M.A. Routing problem in rectangular mesh network using shortest path based Greedy method. In Proceedings of the Journal of Physics: Conference Series; IOP Publishing: Bristol, UK, 2019; Volume 1358, p. 012079.
- Kumar, A.; Kumar, P.B.; Parhi, D.R. Intelligent navigation of humanoids in cluttered environments using regression analysis and genetic algorithm. Arab. J. Sci. Eng. 2018, 43, 7655–7678
- Roberge, V.; Tarbouchi, M.; Labonté, G. Fast genetic algorithm path planner for fixed-wing military UAV using GPU. IEEE Trans. Aerosp. Electron. Syst. 2018, 54, 2105–2117
- Liu, X.; Jiang, D.; Tao, B.; Jiang, G.; Sun, Y.; Kong, J.; Tong, X.; Zhao, G.; Chen, B. Genetic algorithm-based trajectory optimization for digital twin robots. Front. Bioeng. Biotechnol. 2022, 9, 793782
- Li, D.; Wang, L.; Cai, J.; Wang, A.; Tan, T.; Gui, J. Research on mobile robot path planning based on improved genetic algorithm. Int. J. Model. Simul. Sci. Comput. 2023, 14, 2341030
- A. Sepehri and A. M. Moghaddam, "A Motion Planning Algorithm for Redundant Manipulators Using Rapidly Exploring Randomized Trees and Artificial Potential Fields," in IEEE Access, vol. 9, pp. 26059-26070, 2021, doi: 10.1109/ACCESS.2021.3056397
- Benzaouia, A., El Hajjaji, A. (2014). Introduction to Takagi–Sugeno Fuzzy Systems. In: Advanced Takagi‒Sugeno Fuzzy Systems. Studies in Systems, Decision and Control, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-05639-5_1
- Berizka I.A., Karbovnyk I.D, Mathematical Model of Modified Real-Time Obstacle Avoidance Method Based on Laplace Artificial Potential Field. Прикладні проблеми комп’ютерних наук, безпеки та математики, вип 3, 12–22, 2024. https://apcssm.vnu.edu.ua/index.php/Journalone/article/view/123
- Yu J, Su Y and Liao Y, The Path Planning of Mobile Robot by Neural Networks and Hierarchical Reinforcement Learning. Front. Neurorobot. 14:63. 2020. https://doi.org/10.3389/fnbot.2020.00063
DOI: http://dx.doi.org/10.30970/eli.28.11
Refbacks
- There are currently no refbacks.