Skip navigation
Skip navigation

Fast and memory-efficient multi-agent pathfinding

Wang, Ko-Hsin; Botea, Adi


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]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
Source: Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008)


File Description SizeFormat Image
01_Wang_Fast_and_memory-efficient_2008.pdf4.1 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator