Contingent Planning for Robust Multi-Agent Path Finding

Michal Nekvinda, Roman Barták, Meir Kalech

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A classical approach to Multi-agent Path Finding assumes an offline construction of collision-free paths that the agents blindly follow during execution. k-robust plans can be executed without collisions even if an agent is delayed for at most k steps. In the paper, we propose a novel concept of robustness that uses alternative paths to which the agents are diverted in case of delay. Such plans can be found with much higher chances than k-robust plans.

Original languageEnglish
Title of host publication14th International Symposium on Combinatorial Search, SoCS 2021
EditorsHang Ma, Ivan Serina
PublisherAssociation for the Advancement of Artificial Intelligence
Pages185-187
Number of pages3
ISBN (Electronic)9781713834557
StatePublished - 2021
Externally publishedYes
Event14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China
Duration: 26 Jul 202130 Jul 2021

Publication series

Name14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference14th International Symposium on Combinatorial Search, SoCS 2021
Country/TerritoryChina
CityGuangzhou, Virtual
Period26/07/2130/07/21

Bibliographical note

Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

Research is supported by the project P103-19-02183S of the Czech Science Foundation and the project LTAIZ19014 of Czech Ministry of Education, Youth, and Sports.

FundersFunder number
Czech Ministry of Education, Youth, and Sports
Grantová Agentura České RepublikyLTAIZ19014

    Fingerprint

    Dive into the research topics of 'Contingent Planning for Robust Multi-Agent Path Finding'. Together they form a unique fingerprint.

    Cite this