Acceptance-Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding

Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent path finding (MAPF) problems. This article proposes a new dRRT algorithm designed to tackle complex and challenging MAPF instances that current...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on industrial informatics S. 1 - 12
Hauptverfasser:	Xin, Jianbin, Duan, Yuze, Zhu, Hai, Liang, Jing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 2025
Schlagworte:	Backtracking Collision avoidance Connectors Heuristic algorithms Multi-robot systems Multiagent path finding (MAPF) multirobot systems path planning Planning Probabilistic logic Robot kinematics sampling-based algorithm Time complexity Training
ISSN:	1551-3203, 1941-0050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!