Cooperative Multi-Agent Planning: A Survey

Abstract

Cooperative multi-agent planning (MAP) is a relatively recent research field that combines technologies, algorithms and techniques developed by the Artificial Intelligence Planning and Multi-Agent Systems communities. While planning has been generally treated as a single-agent task, MAP generalizes this concept by considering multiple intelligent agents that work cooperatively to develop a course of action that satisfies the goals of the group. This paper reviews the most relevant approaches to MAP, putting the focus on the solvers that took part in the 2015 Competition of Distributed and Multi-Agent Planning, and classifies them according to their key features and relative performance.

34 pages, 4 figures, 4 tables

References in corpus (4)

• PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
• SHOP2: An HTN Planning System
• FMAP: Distributed Cooperative Multi-Agent Planning
• A Flexible Coupling Approach to Multi-Agent Planning under Incomplete Information

Cited by in corpus (10)

• Industrial Internet of Things Intelligence Empowering Smart Manufacturing: A Literature Review
• Time Minimization and Online Synchronization for Multi-agent Systems under Collaborative Temporal Tasks
• Resonating Minds -- Emergent Collaboration Through Hierarchical Active Inference
• Agree to Disagree: Subjective Fairness in Privacy-Restricted Decentralised Conflict Resolution
• Multi-Robot Planning on Dynamic Topological Graphs using Mixed-Integer Programming
• Assisted Shortest Path Planning for a Convoy through a Repairable Network
• Active Modular Environment for Robot Navigation
• CE-MRS: Contrastive Explanations for Multi-Robot Systems
• Heterogeneous Multi-robot Task Allocation for Long-Endurance Missions in Dynamic Scenarios
• ORTAC+ : A User Friendly Domain Specific Language for Multi-Agent Mission Planning