Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems
Original language description
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
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
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
Name of the periodical
International Journal on Artificial Intelligence Tools
ISSN
0218-2130
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
5
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
1-19
UT code for WoS article
—
EID of the result in the Scopus database
—