A review on autonomous mobile robot path planning algorithms

• Main Authors: Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad
• Format: Article
• Language: English
• Published: ASTES Publishers 2020
• Subjects: QA Mathematics
• Online Access: http://umpir.ump.edu.my/id/eprint/30340/7/A%20Review%20on%20Autonomous%20Mobile%20Robot.pdf; http://umpir.ump.edu.my/id/eprint/30340/; http://dx.doi.org/10.25046/aj050330; http://dx.doi.org/10.25046/aj050330
• Institution: Universiti Malaysia Pahang

The emerging trend of modern industry automation requires intelligence to be embedded into mobile robot for ensuring optimal or near-optimal solutions to execute certain task. This yield to a lot of improvement and suggestions in many areas related to mobile robot such as path planning. The purpose of this paper is to review the mobile robots path planning problem, optimization criteria and various methodologies reported in the literature for global and local mobile robot path planning. In this paper, commonly use classical approaches such as cell decomposition (CD), roadmap approach (RA), artificial potential field (AFP), and heuristics approaches such as genetic algorithm (GA), particle swarm optimization (PSO) approach and ant colony optimization (ACO) method are considered.It is observed that when it comes to dynamic environment where most of the information are unknown to the mobile robots before starting, heuristics approaches are more popular and widely used compared to classical approaches since it can handle uncertainty, interact with objects and making quick decision. Finally, few suggestions for future research work in this field are addressed at the end of this paper.