Fast and Memory-Efficient Multi-Agent Pathfinding
ICAPS, pp. 380-387, 2008.
path planningreal time
Multi-agent path planning has been shown to be a PSPACE- hard problem. Running a complete search such as A* at the global level is often intractable in practice, since both the number of states and the branching factor grow exponentially as the number of mobile units increases. In addition to the inherent difficulty of the problem, in man...More
Full Text (Upload PDF)
PPT (Upload PPT)