Path Planning with Modified a Star Algorithm for a Mobile Robot

This article deals with path planning of a mobile robot based on a grid map. Essential assumption for path planning is a mobile robot with functional and reliable reactive navigation and SLAM. Therefore, such issues are not addressed in this article. The main body of the article introduces several m...

Full description

Saved in:
Bibliographic Details
Published in:Procedia engineering 2014, Vol.96, p.59-69
Main Authors: Duchoň, František, Babinec, Andrej, Kajan, Martin, Beňo, Peter, Florek, Martin, Fico, Tomáš, Jurišica, Ladislav
Format: Article
Language:English
Subjects:
A algorithm
Basic Theta
Jump Point Search
Path planning
Phi
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article deals with path planning of a mobile robot based on a grid map. Essential assumption for path planning is a mobile robot with functional and reliable reactive navigation and SLAM. Therefore, such issues are not addressed in this article. The main body of the article introduces several modifications (Basic Theta*, Phi*) and improvements (RSR, JPS) of A star algorithm. These modifications are focused primarily on computational time and the path optimality. Individual modifications were evaluated in several scenarios, which varied in the complexity of environment. On the basis of these evaluations, it is possible to choose path planning method suitable for individual scenario.
ISSN:1877-7058
1877-7058
DOI:10.1016/j.proeng.2014.12.098