MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees
-
Altmetric Citations
Description
Multi-agent path planning is a challenging problem with numerous real-life applications. Running a centralized search such as A* in the combined state space of all units is complete and cost-optimal, but scales poorly, as the state space size is exponential in the number of mobile units. Traditional decentralized approaches, such as FAR andWHCA*, are faster and more scalable, being based on problem decomposition. However, such methods are incomplete and provide no guarantees with respect to the...[Show more]
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/35798 |
Source: | Journal of Artificial Intelligence Research |
DOI: | 10.1613/jair.3370 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Wang_MAPP:_a_Scalable_Multi-Agent_2011.pdf | 1.76 MB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator