Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ŠKORPIL, V.; ŠŤASTNÝ, J.; ČÍŽEK, L.
Originální název
Path Optimization by Graph Algorithms
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
Many different methods of optimizing the path exist in an environment with obstacles. Two methods for path planning by means of graph-based algorithms are compared in this article. These algorithms are Anytime Repairing A *, which is designed for quickly finding the path under time pressure and its potential improvement in the remaining time and the classical A*, which the previous algorithm is based on. These algorithms are tested on four different scenes with different levels of difficulty and the results are compared according to the time of optimization, number of newly searched states and the length of the path found. In our research we tested also the D* Lite algorithm. This algorithm will be described in some next paper.
Anglický abstrakt
Klíčová slova
Path Planning, Graph-based Algorithms, Algorithm A *, Algorithm ARA *, Path Optimizing, Pseudocode, Procedure
Klíčová slova v angličtině
Autoři
Rok RIV
2013
Vydáno
14.07.2012
Nakladatel
WSEAS
Místo
Greece, Iskand Kos
ISBN
978-1-61804-109-8
Kniha
Recent Researches in Communications and Computers
Edice
Strany od
73
Strany do
77
Strany počet
5
BibTex
@inproceedings{BUT94171, author="Vladislav {Škorpil} and Jiří {Šťastný} and Lubomír {Čížek}", title="Path Optimization by Graph Algorithms", booktitle="Recent Researches in Communications and Computers", year="2012", series="WSEAS", number="1", pages="73--77", publisher="WSEAS", address="Greece, Iskand Kos", isbn="978-1-61804-109-8" }