Conference Proceeding Article
Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special structure, where we can find provably near-optimal solutions. In contrast, here we focus on provably near-optimal solutions in domains with many agents, by exploiting influence limits. To that end, we make two key contributions: (a) an algorithm, based on Lagrangian relaxation and randomized rounding, for solving multi-agent planning problems represented as large mixed-integer programs; (b) a proof of convergence of our algorithm to a near-optimal solution.
Multi-agent Planning, Lagrangian Relaxation
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2012), 4-8 June, Valencia, Spain
City or Country
GORDON, Geoff; VARAKANTHAM, Pradeep Reddy; YEOH, William; SRINIVASAN, Ajay; LAU, Hoong Chuin; and CHENG, Shih-Fen.
Lagrangian relaxation for large-scale multi-agent planning. (2012). Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2012), 4-8 June, Valencia, Spain. 1227-1228. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1565
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.