Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain

We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal is to find a sequence of parallel, collision-free agent motions that minimizes the overall time (the makespan) until al...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fekete, Sándor P, Kosfeld, Ramin, Kramer, Peter, Neutzner, Jonas, Rieck, Christian, Scheffer, Christian
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!