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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia engineering Ročník 96; s. 59 - 69
Hlavní autoři: Duchoň, František, Babinec, Andrej, Kajan, Martin, Beňo, Peter, Florek, Martin, Fico, Tomáš, Jurišica, Ladislav
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 2014
Témata:
A algorithm
Basic Theta
Jump Point Search
Path planning
Phi
A algorithm
Phi
Path planning
Basic Theta
Jump Point Search
ISSN:1877-7058, 1877-7058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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