.png){kind=icon}
Return
Improving Collaborative Pathfinding Using Map Abstraction
.png){kind=icon}
OA
AI
DOI：10.1609/aiide.v2i1.18750.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we combine recent pathfinding research on spatial abstractions, partial refinement, and space-time reserva- tions to construct new collaborative pathfinding algorithms. We first present an enhanced version of WHCA* and then show how the ideas from WHCA* can be combined with PRA* to form CPRA*. These algorithms are shown to effectively plan trajectories for many objects simultaneously while avoiding collisions, as the original WHCA* does. These new algorithms are not only faster than WHCA* but also use less memory.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available