Robust Multi-Agent Pathfinding with Continuous Time
Proceedings of the International Conference on Automated Planning and Scheduling · 30.05.2024 · 34 · 570-578
DOI: 10.1609/icaps.v34i1.31519 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 30.05.2024. Verfasst von Wen Jun Tan und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).
Abstract (Originalsprache)
Multi-Agent Pathfinding (MAPF) is the problem of finding plans for multiple agents such that every agent moves from its start location to its goal location without collisions. If unexpected events delay some agents during plan execution, it may not be possible for the agents to continue following their plans without causing any collision. We define and solve a T-robust MAPF problem that seeks plans that can be followed even if some delays occur, under the generalized MAPFR setting with continuous time notions. The proposed approach is complete and provides provably optimal solutions. We also develop an exact method for collision detection among agents that can be delayed. We experimentally evaluate our proposed approach in terms of efficiency and plan cost.
Zitieren
APA
Tan, W. J., Tang, X., & Cai, W. (2024). Robust Multi-Agent Pathfinding with Continuous Time. Proceedings of the International Conference on Automated Planning and Scheduling, 34, 570-578. https://doi.org/10.1609/icaps.v34i1.31519
Vancouver
Tan WJ, Tang X, Cai W. Robust Multi-Agent Pathfinding with Continuous Time. Proceedings of the International Conference on Automated Planning and Scheduling. 2024;34:570-578. doi:10.1609/icaps.v34i1.31519
BibTeX
@article{Tan2024,
author = {Tan, Wen Jun and Tang, Xueyan and Cai, Wentong},
title = {Robust Multi-Agent Pathfinding with Continuous Time},
journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
year = {2024},
volume = {34},
pages = {570--578},
doi = {10.1609/icaps.v34i1.31519}
}
EUVIMED