Optimal path planning of mobile robots: A review
By P. Raja, S. Pugazhenthi. 2012
398 citations recorded by the source corpus.
Mobile robots are increasingly used in automated industrial environments. There are also other applications like planet exploration, surveillance, landmine detection, etc. In all these applications, in order that the mobile robots perform their tasks, collision-free path planning is a prerequisite. This article provides an overview of the research progress in path planning of a mobile robot for off-line as well as on-line environments. Commonly used classic and evolutionary approaches of path planning of mobile robots have been addressed. Review shows that evolutionary optimization algorithms are computationally efficient and hence are increasingly being used in tandem with classic approaches while handling Non-deterministic Polynomial time hard (NP-hard) problems. Also, challenges involved in developing a computationally efficient path planning algorithm are addressed. Key words: Path planning, mobile robot, off-line environment, on-line environment, classic, evolutionary algorithms.
Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/59c829d5daf015f9963a2f45b4e5ac49a8155b92
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Computer Vision and Pattern Recognition
In Control and Systems Engineering
Citations in the corpus
- Path Planning for Autonomous Mobile Robots: A Review (2021, methodology): “respectively [3]; and the size of the environment, whether Local or Global.”
- A review of mobile robots: Concepts, methods, theoretical framework, and applications (2019, background): “Several authors also distinguish between online and offline planners.(122) The divide between these two groups depends on the computer’s power or ability to solve the most demanding algorithm.”