Solving Abstract Cooperative Path-Finding in Densely Populated Environments
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10126392" target="_blank" >RIV/00216208:11320/14:10126392 - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1111/coin.12002" target="_blank" >http://dx.doi.org/10.1111/coin.12002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1111/coin.12002" target="_blank" >10.1111/coin.12002</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Solving Abstract Cooperative Path-Finding in Densely Populated Environments
Popis výsledku v původním jazyce
The problem of cooperative path-finding is addressed in this work. A set of agents moving in a certain environment is given. Each agent need to reach a given goal location. The task is to find spatial temporal paths for agents such that they eventually reach their goals by following these paths without colliding with each other. An abstraction where the environment is modeled as an undirected graph is adopted - vertices represent locations and edges represent passable regions. Agents are modeled as elements placed in the vertices. Space occupancy by agents is represented by a constraint that at most one agent can be located in a vertex at a time. At least one vertex remains unoccupied to allow agents to move. An agent can move into unoccupied neighboring vertex or into a vertex being currently vacated in a certain case. Two novel scalable algorithms for solving cooperative path-finding in bi connected graphs are presented. They are both targeted on the case with environments densely po
Název v anglickém jazyce
Solving Abstract Cooperative Path-Finding in Densely Populated Environments
Popis výsledku anglicky
The problem of cooperative path-finding is addressed in this work. A set of agents moving in a certain environment is given. Each agent need to reach a given goal location. The task is to find spatial temporal paths for agents such that they eventually reach their goals by following these paths without colliding with each other. An abstraction where the environment is modeled as an undirected graph is adopted - vertices represent locations and edges represent passable regions. Agents are modeled as elements placed in the vertices. Space occupancy by agents is represented by a constraint that at most one agent can be located in a vertex at a time. At least one vertex remains unoccupied to allow agents to move. An agent can move into unoccupied neighboring vertex or into a vertex being currently vacated in a certain case. Two novel scalable algorithms for solving cooperative path-finding in bi connected graphs are presented. They are both targeted on the case with environments densely po
Klasifikace
Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
JD - Využití počítačů, robotika a její aplikace
OECD FORD obor
—
Návaznosti výsledku
Projekt
Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2014
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ů
Údaje specifické pro druh výsledku
Název periodika
Computational Intelligence
ISSN
0824-7935
e-ISSN
—
Svazek periodika
2014
Číslo periodika v rámci svazku
30 (2)
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
50
Strana od-do
402-450
Kód UT WoS článku
000335401900009
EID výsledku v databázi Scopus
—