Comparison of Path Planning between Improved Informed and Uninformed Algorithms for Mobile Robot

摘要

This work is concerned with the Path Planning Algorithms (PPA), which hold an important place in Robotics navigation. Navigation has become indispensable to most modern inventions. Mobile robots have to move to a relevant task point in order to achieve the tasks assigned to them. The actions, which are planned in a structure, may restrict the task duration and even in some situations, the mission tends to be accomplished. This paper aims to study and compare six commonly used informed and uninformed algorithms. Three different maps have been created with gradually increasing difficulty levels related to a number of obstacles in the tested maps. The paper provides a detailed comparison between the algorithms under investigation of several parameters such as: Total steps, straight steps, rotation steps, and search time. The promised results were obtained when the proposed algorithms were applied to a case study.