Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]

Authors

  • Jiří Švancara Charles University, Prague, Czech Republic
  • Etienne Tignon University of Potsdam, Potsdam, Germany
  • Roman Barták Charles University, Prague, Czech Republic
  • Torsten Schaub University of Potsdam, Potsdam, Germany Potassco Solutions, Potsdam, Germany
  • Philipp Wanko University of Potsdam, Potsdam, Germany Potassco Solutions, Potsdam, Germany
  • Roland Kaminski University of Potsdam, Potsdam, Germany Potassco Solutions, Potsdam, Germany

DOI:

https://doi.org/10.1609/socs.v16i1.27306

Keywords:

Problem Compilation

Abstract

Multi-agent pathfinding is the task of navigating a set of agents in a shared environment without collisions. Finding an optimal plan is a computationally hard problem, therefore, one may want to sacrifice optimality for faster computation time. In this paper, we present our preliminary work on finding a valid solution using only a predefined path for each agent with the possibility of adding wait actions. This restriction makes some instances unsolvable, however, we show instances where this approach is guaranteed to find a solution.
SoCS-2023 Proceedings Cover

Downloads

Published

2023-07-02

How to Cite

Švancara, J., Tignon, E., Barták, R., Schaub, T., Wanko, P., & Kaminski, R. (2023). Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. Proceedings of the International Symposium on Combinatorial Search, 16(1), 185–186. https://doi.org/10.1609/socs.v16i1.27306

Issue

Vol. 16 No. 1: Sixteenth International Symposium on Combinatorial Search

Section

Extended Abstracts