Path Optimization by Graph Algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F12%3APU99944" target="_blank" >RIV/00216305:26220/12:PU99944 - isvavai.cz</a>
Alternative codes found
RIV/62156489:43110/12:00191402
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Path Optimization by Graph Algorithms
Original language description
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 quicklyfinding 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/ED2.1.00%2F03.0072" target="_blank" >ED2.1.00/03.0072: Centre of sensor, information and communication systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Recent Researches in Communications and Computers
ISBN
978-1-61804-109-8
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
73-77
Publisher name
WSEAS
Place of publication
Greece, Iskand Kos
Event location
Kos
Event date
Jul 14, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)