Pathfinding in a Dynamically Changing Environment

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F18%3AA1901TNJ" target="_blank" >RIV/61988987:17310/18:A1901TNJ - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-3-319-75420-8_25" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-75420-8_25</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-75420-8_25" target="_blank" >10.1007/978-3-319-75420-8_25</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Pathfinding in a Dynamically Changing Environment

Popis výsledku v původním jazyce

This paper is focused on a proposal of an algorithm for dynamic path planning which uses the input speed of the vehicle as a dynamic value based on which paths are searched in a graph. The proposed algorithm AV* stems from algorithm A*, works with proposed weight functions of evaluation function and, once again, uses information about nodes which have already been calculated in order to find out a faster update of a new path. This algorithm has been subjected to tests, whose results were compared with the results of algorithm A*. The proposed algorithm AV* complies with the condition of pathfinding between two points in a finite time based on the criterion of the fastest path using the maximum of the speed limit. From the point of view of dynamic optimization, all tests achieved a higher speed when the algorithm was run again at a different speed. This speed-up corresponds to approximately 25% and is linearly dependent on the amount of searched nodes.

Název v anglickém jazyce

Pathfinding in a Dynamically Changing Environment

Popis výsledku anglicky

This paper is focused on a proposal of an algorithm for dynamic path planning which uses the input speed of the vehicle as a dynamic value based on which paths are searched in a graph. The proposed algorithm AV* stems from algorithm A*, works with proposed weight functions of evaluation function and, once again, uses information about nodes which have already been calculated in order to find out a faster update of a new path. This algorithm has been subjected to tests, whose results were compared with the results of algorithm A*. The proposed algorithm AV* complies with the condition of pathfinding between two points in a finite time based on the criterion of the fastest path using the maximum of the speed limit. From the point of view of dynamic optimization, all tests achieved a higher speed when the algorithm was run again at a different speed. This speed-up corresponds to approximately 25% and is linearly dependent on the amount of searched nodes.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název statě ve sborníku

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISBN

978-3-319-75419-2

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

10

Strana od-do

265-274

Název nakladatele

Springer Verlag

Místo vydání

Cham, Switzerland

Místo konání akce

Dong Hoi City

Datum konání akce

19. 3. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000453510500025