All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Pathfinding in a Dynamically Changing Environment

The result's identifiers

  • Result code in 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>

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Pathfinding in a Dynamically Changing Environment

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    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

  • Number of pages

    10

  • Pages from-to

    265-274

  • Publisher name

    Springer Verlag

  • Place of publication

    Cham, Switzerland

  • Event location

    Dong Hoi City

  • Event date

    Mar 19, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000453510500025