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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on industrial informatics s. 1 - 12
Hlavní autori:	Xin, Jianbin, Duan, Yuze, Zhu, Hai, Liang, Jing
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!