Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190138" target="_blank" >RIV/00216208:11320/13:10190138 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1142/S0218213013600026" target="_blank" >http://dx.doi.org/10.1142/S0218213013600026</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218213013600026" target="_blank" >10.1142/S0218213013600026</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems

Popis výsledku v původním jazyce

Problems of motion coordination of multiple entities are addressed in this paper. These problems are dealt on the abstract level where they can be viewed as tasks of constructing a spatial-temporal plan for a set of identical mobile entities. The entities reside in a certain environment where they can move. Each entity need to reach a given goal position supposed it is starting from some initial position. The most abstract formal representations of coordinated motion problems are known as "pebble motionon a graph" and "multi-robot path planning". The existent algorithms for pebble motion and multi-robot problems were suspected of generating solutions containing redundancies. This hypothesis eventually confirmed in this work. We present several techniques for identifying and eliminating redundancies from solutions generated by existent algorithms. An extensive experimental evaluation was performed and it showed that the quality of generated solutions can be improved up to the order of

Název v anglickém jazyce

Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems

Popis výsledku anglicky

Problems of motion coordination of multiple entities are addressed in this paper. These problems are dealt on the abstract level where they can be viewed as tasks of constructing a spatial-temporal plan for a set of identical mobile entities. The entities reside in a certain environment where they can move. Each entity need to reach a given goal position supposed it is starting from some initial position. The most abstract formal representations of coordinated motion problems are known as "pebble motionon a graph" and "multi-robot path planning". The existent algorithms for pebble motion and multi-robot problems were suspected of generating solutions containing redundancies. This hypothesis eventually confirmed in this work. We present several techniques for identifying and eliminating redundancies from solutions generated by existent algorithms. An extensive experimental evaluation was performed and it showed that the quality of generated solutions can be improved up to the order of

Druh

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

—

Projekt

<a href="/cs/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Propojení plánování a provádění plánů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

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 periodika

International Journal on Artificial Intelligence Tools

ISSN

0218-2130

e-ISSN

—

Svazek periodika

22

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

19

Strana od-do

1-19

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—