An overview of autonomous mobile robot path planning algorithms

• الحاوية / القاعدة: SCOReD 2006 - Proceedings of 2006 4th Student Conference on Research and Development "Towards Enhancing Research Excellence in the Region"
• المؤلف الرئيسي: 2-s2.0-46849099615
• التنسيق: Conference paper
• اللغة: English
• منشور في: 2006
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?eid=2-s2.0-46849099615&doi=10.1109%2fSCORED.2006.4339335&partnerID=40&md5=c9a6951059b6de8dc0d4e21c1973b6b4

Determination of a collision free path for a robot between start and goal positions through obstacles cluttered in a workspace is central to the design of an autonomous robot path planning. This paper presents an overview of autonomous mobile robot path planning focusing on algorithms that produce an optimal path for a robot to navigate in an environment. To complete the navigation task, the algorithms will read the map of the environment or workspace and subsequently attempts to create free paths for the robot to traverse in the workspace without colliding with objects and obstacles. Appropriate or correct and suitable algorithms will fulfill its function fast enough, that is, to find an optimal path for the robot to traverse in, even if there are a large number of obstacles cluttered in a complex environment. To achieve this, various approaches in the design of algorithms used to develop an ideal path planning system for autonomous mobile robots have been proposed by many researchers. Simulation and experimental results from previous research shows that algorithms play an important role to produce an optimal path (short, smooth and robust) for autonomous robot navigation and simultaneously it prove that appropriate algorithms can run fast enough to be used practically without time-consuming problem. This paper presents an overview and discusses the strength and weakness of path planning algorithms developed and used by previous and current researchers. © 2006 IEEE.