Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233767" target="_blank" >RIV/68407700:21230/15:00233767 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7138650" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7138650</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TASE.2015.2445780" target="_blank" >10.1109/TASE.2015.2445780</a>
Alternative languages
Result language
angličtina
Original language name
Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots
Original language description
In autonomous multirobot systems one of the concerns is how to prevent collisions between the individual robots. One approach to this problem involves finding coordinated trajectories from start to destination for all the robots and then letting the robots follow the preplanned coordinated trajectories. A widely used practical method for finding such coordinated trajectories is ?classical? prioritized planning, where robots plan sequentially one after another. This method has been shown to be effectivein practice, but it is incomplete (i.e., there are solvable problem instances that the algorithm fails to solve) and it has not yet been formally analyzed under what circumstances is the method guaranteed to succeed. Further, prioritized planning is a centralized algorithm, which makes the method unsuitable for decentralized multirobot systems. The contributions of this paper are: a) an adapted version of classical prioritized planning called revised prioritized planning with a formal ch
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-22125S" target="_blank" >GA13-22125S: Deterministic Domain-independent Multi-agent Planning</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
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
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
ISSN
1545-5955
e-ISSN
—
Volume of the periodical
12/3
Issue of the periodical within the volume
June
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
835-849
UT code for WoS article
000358585200007
EID of the result in the Scopus database
2-s2.0-84937717971