Fast and memory-efficient multi-agent pathfinding
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 many real-life applications such as computer games, solutions have to be computed in real time, using limited CPU and memory resources. In this paper we introduce...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008)|
|01_Wang_Fast_and_memory-efficient_2008.pdf||4.1 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.