OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains

Abstract

Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton and then apply fast algorithms from model checking to search for a solution. obdds can e ectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this article, we present umop, a new universal obdd-based planning framework for non-deterministic, multi-agent domains. We introduce a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains. The language contributes the explicit de nition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an e cient obdd-based representation of an NADL description. The umop planning system uses NADL and di erent obdd-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms. In addition, we introduce our new optimistic planning algorithm that relaxes optimality guarantees and generates plausible universal plans in some domains where no strong nor strong cyclic solution exists. We present empirical results applying umop to domains ranging from deterministic and single-agent with no environment actions to non-deterministic and multi-agent with complex environment actions. Umop is shown to be a rich and e cient planning system. 1. The term precursor originates in Dean et al. (1995) in contrast to recurrent approaches that replan to recover from execution failures.

Optimal Dynamic Analysis of Electrical/Electronic Components in Wind Turbines

“…The events not considered are added in a queue list named "open". The list will be recalled "closed" list when every event is studied [59].…”

Non-deterministic planning methods for automated web service composition

“…In the case of partial or no observability, the generated plans are strong. Cimatti et al [6] compare MBP to various other planners, namely GPT, UMOP, [40] SIMPLAN, [41] QBFPLAN [42] and SGP. [43] MBP proved effective in a wide range of problems, although a blow up in its state space occurred even in problems with a limited number of state variables.…”

Temporal Logic Motion Planning

“…Authors differentiate their approach from previous related approaches that used model checking to generate discrete paths that satisfy temporal logic specifications. This previous research has resulted in the tools like: MBP 16 , TLPLAN 17 , and UMOP 18 . The aim of the paper is to generate continuous trajectories which satisfy temporal logic formulas.…”