Open AccessCritical Comparative Study of Robot Path Planning in Grid-Based Environment
Author(s) -
R. D. Dhaniya,
K. M. Umamaheswari
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1804/1/012193
Subject(s) - motion planning , robotics , computer science , grid , shortest path problem , baseline (sea) , robot , any angle path planning , artificial intelligence , heuristic , path (computing) , mobile robot , disadvantage , mathematical optimization , graph , theoretical computer science , mathematics , oceanography , geometry , programming language , geology
The path planning problem under two-dimensional maps is a fundamental issue in mobile robotics and other applications (unmanned vehicles, and so forth). The traditional algorithms (graph searching, artificial potential field and so forth) are used to find the shortest path that rely on grid-by-grid searching. The main disadvantage of the traditional methods is robot size is not considered and has much redundant in sharp curves which is difficult to guide a robot movement. In this paper, we compared the five baseline approaches of heuristic methods to find the optimal path which reduces the number of turns and time costs to attain a target. The experimental analysis shows that the second-order x derivative has an advantage over other baseline approaches that the search time and the number of turns are reduced.