Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00359464" target="_blank" >RIV/68407700:21230/22:00359464 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/22:00359464
Result on the web
<a href="https://ojs.aaai.org/index.php/SOCS/article/view/21802" target="_blank" >https://ojs.aaai.org/index.php/SOCS/article/view/21802</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract)
Original language description
The Multi-agent Multi-item Pickup and Delivery problem (MAMPD) stands for a problem of finding collision-free trajectories for a fleet of mobile agents transporting a set of items from their initial positions to specified locations. Each agent can carry multiple items up to a given capacity. We study the solution quality of the naive decoupled approach, which decouples the problem into task assignment (TA) and Multi-Agent Pathfinding (MAPF). By computing the gap between the lower bound of the MAMPD cost, estimated using the TA cost, and the upper bound, given by the final MAMPD cost, we show that the decoupled approach is able to obtain near-optimal solutions in a wide range of cases.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF15_003%2F0000470" target="_blank" >EF15_003/0000470: Robotics 4 Industry 4.0</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2022
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
Proceedings of the Fifteenth International Symposium on Combinatorial Search
ISBN
978-1-57735-873-2
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
—
Publisher name
Association for the Advancement of Artificial Intelligence (AAAI)
Place of publication
Palo Alto, California
Event location
Vídeň
Event date
Jul 21, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—