Artificial Intelligence - Special issue on knowledge representation
Fast planning through planning graph analysis
Artificial Intelligence
Functional strips: a more flexible language for planning and problem solving
Logic-based artificial intelligence
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Optimizing Graph Algorithms for Improved Cache Performance
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL ("maple") for describing multiagent planning domains. MAPL allows to describe both qualitative and quantitative temporal relations among events, thus subsuming the temporal models of both PDDL 2.1 and POP. Other features are different levels of control over actions, modeling of agents' ignorance of facts, and plan synchronization with communicative actions. For single-agent planning in multi-agent domains, we present a novel forward-search algorithm synthesizing MAPL's partially ordered temporal plans. Finally, we present a general distributed algorithm scheme for solving MAPL problems with several coordinating planners. These different contributions are intended as as step towards a simple, yet expressive standard for the description of multiagent planning domains and algorithms. Such a standard could in the future allow cross-evaluation of Multi-agent Planning algorithms on standardized benchmarks.