EUVIMEDEUVIMED entdecken
Crossref

Probabilistic Robust Multi-Agent Path Finding

Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig

Proceedings of the International Conference on Automated Planning and Scheduling · 01.06.2020 · 30 · 29-37

DOI: 10.1609/icaps.v30i1.6642 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 01.06.2020. Verfasst von Dor Atzmon und 4 weiteren Autor:innen. Die Arbeit wurde bisher 22-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In a multi-agent path finding (MAPF) problem, the task is to move a set of agents to their goal locations without conflicts. In the real world, unexpected events may delay some of the agents. In this paper, we therefore study the problem of finding a p-robust solution to a given MAPF problem, which is a solution that succeeds with probability at least p, even though unexpected delays may occur. We propose two methods for verifying that given solutions are p-robust. We also introduce an optimal CBS-based algorithm, called pR-CBS, and a fast suboptimal algorithm, called pR-GCBS, for finding such solutions. Our experiments show that a p-robust solution reduces the number of conflicts compared to optimal, non-robust solutions.

Zitieren

APA

Atzmon, D., Stern, R., Felner, A., Sturtevant, N. R., & Koenig, S. (2020). Probabilistic Robust Multi-Agent Path Finding. Proceedings of the International Conference on Automated Planning and Scheduling, 30, 29-37. https://doi.org/10.1609/icaps.v30i1.6642

Vancouver

Atzmon D, Stern R, Felner A, Sturtevant NR, Koenig S. Probabilistic Robust Multi-Agent Path Finding. Proceedings of the International Conference on Automated Planning and Scheduling. 2020;30:29-37. doi:10.1609/icaps.v30i1.6642

BibTeX
@article{Atzmon2020,
  author = {Atzmon, Dor and Stern, Roni and Felner, Ariel and Sturtevant, Nathan R. and Koenig, Sven},
  title = {Probabilistic Robust Multi-Agent Path Finding},
  journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
  year = {2020},
  volume = {30},
  pages = {29--37},
  doi = {10.1609/icaps.v30i1.6642}
}
Kostenlos starten →