Critical Comparative Study of Robot Path Planning in Grid-Based Environment

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-02, Vol.1804 (1), p.12193
Main Authors: Dhaniya, R D, Umamaheswari, K M
Format: Article
Language:English
Subjects:
Comparative studies
Cost analysis
Heuristic methods
Path planning
Physics
Potential fields
Robot dynamics
Robotics
Robots
Search algorithms
Shortest-path problems
Unmanned vehicles
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1804/1/012193