Path planning Methods for Mobile Robots: A systematic and Bibliometric Review

• Main Authors: Muhammad, Aisha, Ali, Mohammed A. H., Shanono, Ibrahim Haruna
• Format: Article
• Language: English
• Published: Universiti Teknologi Malaysia 2020
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://umpir.ump.edu.my/id/eprint/30373/1/ELEKTRIKA.pdf; http://umpir.ump.edu.my/id/eprint/30373/
• Institution: Universiti Malaysia Pahang

Robots are currently replacing humans in different tasks in various sectors. Among the vital features desirable in autonomous robots is the capability of navigating safely through a given environment. Robot navigation is a process designed with the ability of avoiding any hitches or obstacles while aiming at a specific predefined position. Many studies have been proposed to find solutions to robot path-planning problems. This paper presents a survey of the heuristic and classical path planning approaches. Focal strengths, together with the weaknesses of these approaches, were also identified to provide deep insight for future studies. As several literature studies have recommended, classical methods might not be effective in real time applications as a result of their failure to confront the unpredictable nature of the real-world. They require a considerable amount of computation and space, while heuristic-based methods can overcome real-world problems with some modifications. To summarize the research progress and also suggest future directions of path-planning research, this study performs a bibliometric analysis of the relevant publications published from 2000 to 2020. The results show that 5385 articles were published in 1128 journals, hence indicating publication diversity. There is a steady rise in the yearly publication output, reflecting an increase in global research interest in the topic. In general, this research provides useful insight into path-planning research so that researchers in this area can better recognize the relevant research study topics and search for the appropriate research partners.