# Partial-Order Planning with Concurrent Interacting Actions

@article{Boutilier2011PartialOrderPW,
title={Partial-Order Planning with Concurrent Interacting Actions},
author={Craig Boutilier and Ronen I. Brafman},
journal={ArXiv},
year={2011},
volume={abs/1106.0249}
}
• Published 1 June 2011
• Computer Science
• ArXiv
In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting effects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modifications, the STRIPS action representation language can be used to represent interacting actions. Moreover, algorithms for partial-order…
147 Citations
• Computer Science
Australasian Conference on Artificial Intelligence
• 2016
This paper gives a new specification technique for handling collaborative actions in a PDDL-like language and proposes a new approach to solve multi-agent planning problems without reasoning explicitly about time.
• 2014
This paper investigates how centralised, cooperative, multiagent planning problems with concurrent action constraints and heterogeneous agents can be encoded with some minor additions to PDDL, and
A hybrid between temporal partial-order and forward-chaining planning where each action in a partially ordered plan is associated with a partially defined state that can be used for partial evaluation of preconditions as well as precondition control formulas used as guidance is investigated.
• Computer Science, Economics
AAAI
• 2019
This work relies on a compilation from concurrent multiagent planning to classical planning, allowing it to be used to use an off-the-shelf classical planner to solve the original multiagent problem.
• Computer Science, Economics
ECAI
• 2014
This paper presents a novel approach to multiagent planning in domains with concurrent actions and associated concurrent action constraints, which allows for a transformation of the problems into single-agent planning problems that are considerably easier to solve.
This paper discusses the specifics of planning in multiagent environments and presents the formal framework MAPL ("maple") for describing multiagent planning domains, and presents a novel forward-search algorithm synthesizing MAPL's partially ordered temporal plans.
This paper discusses the specifics of planning in multiagent environments and presents the formal framework MAPL (“maple”) for describing multiagent planning domains and algorithms that in the future might allow crossevaluation of Multiagent Planning algorithms on standardized benchmarks.
In this paper, we discuss the particular characteristics of planning for multiagent systems, and present a rich formal model for describing features like concurrency, individual and mutual beliefs of
• Computer Science
DALT
• 2009
This paper extends the action language $\mathcal A$ in [12] to represent and reason about plans with cooperative actions of an individual agent operating in a multiagent environment and uses the proposed language to formalize the multiagent planning problem and the notion of a joint plan for multiagents in this setting.
The compilation for multiagent planning is able to generate concurrent actions that satisfy a set of concurrency constraints, and avoids the exponential blowup associated with concurrent actions, a problem that many multiagent planners are facing nowadays.

## References

SHOWING 1-10 OF 45 REFERENCES

AI Mag.
• 1999
It is argued that developing DCP systems will be necessary for planning applications to be successful in these environments and a historical overview of research leading to the current state of the art in DCP is given.
The underlying assumptions about when a partial plan can be executed in parallel are identified, the classes of parallel plans that can be generated by different partial-order planners are defined, and the changes required to turn UCPOP into a parallel execution planner are described.
• Computer Science
IEEE Trans. Syst. Man Cybern.
• 1991
The authors implement and evaluate partial global planning in a simulated vehicle monitoring application and identifying promising extensions to the framework.
A progression of least commitment planners is summarized, starting with one that handles the simple STRIPS representation and ending with UCPOP, a planner that manages actions with disjunctive precondition, conditional effects, and universal quantification over dynamic universes.
• Computer Science
J. Artif. Intell. Res.
• 2000
This article introduces a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains and describes the syntax and semantics of NADL and shows how to build an efficient OBDD-based representation of an NADL description.
• Computer Science
AIPS
• 1998
The Multiagent Planning Architecture is a framework for integrating diverse technologies into a system capable of solving complex planning problems and has been validated through its use in developing several large-scale problem-solving systems for Air Campaign Planning.
This work proposes an extension of value iteration in which the system's state space is augmented with the state of the coordination mechanism adopted, allowing agents to reason about the short and long term prospects for coordination, the long term consequences of (mis)coordination, and make decisions to engage or avoid coordination problems based on expected value.
• Computer Science
AAAI/IAAI
• 1998
This paper describes an approach to controlling information distribution among planning agents using irrelevance reasoning, and describes an implementation of this approach within a distributed version of the SIPE-2 planner.
• Computer Science
KR
• 1992
It is proved ucpop is both sound and complete for this representation and a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem".
• Computer Science
Artif. Intell.
• 1998