Multiagent Planning with Partially Ordered Temporal Plans
نویسنده
چکیده
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 multiagent 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 Multiagent Planning algorithms on standardized benchmarks. In this paper, we discuss the specific properties of planning in Multiagent Systems (MAS). With the term Multiagent Planning (MAP), we denote any kind of planning being performed in multiagent environments, meaning on the one hand that the planning process itself may be distributed among several planning agents, but also that individual plans can (and possibly must) take into account concurrent actions by several executing agents.
منابع مشابه
MAPL: a Framework for Multiagent Planning with Partially Ordered Temporal Plans
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 agent...
متن کاملEnabling Agility through Coordinating Temporally Constrained Planning Agents
In crisis response, hierarchical organizations are being replaced by dynamic assemblies of autonomous agents that promise more agility. However, these autonomous agents might cause a decrease in effectiveness when individually constructed plans for moderately-coupled tasks are not jointly feasible. Existing coordination techniques can be applied in the pre-planning phase to guarantee feasible j...
متن کاملA Multiagent Planning Language
This paper discusses specific features of planning in multiagent domains and presents concepts for a multiagent extension of PDDL, the Multiagent Planning Language MAPL (“maple”). MAPL uses non-boolean state variables and thus allows to describe an agent’s ignorance of facts as well as a simplified mutex concept. The time model of MAPL is based on Simple Temporal Networks and allows both quanti...
متن کاملMapping Planning Actions and Partially-Ordered Plans into Execution Knowledge
In essence, the underlying ultimate purpose of classical deliberative planning systems is to model some world task and generate plans that can then be executed. Execution systems rely on the assumption that there is a built-in library of a variety of plans and primitive actions for performing tasks. Although hard and time consuming, such libraries of execution plans and actions are usually hand...
متن کاملGoal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators, orderings and variable bindings are introduced to achieve such goals. While the planning community has known how to achieve individual goals for some time, there has been little work on the prob lem of which one of th...
متن کامل