ASET : a Multi-Agent Planning Language with Nondeterministic Durative Tasks for BDD-Based Fault Tolerant Planning ∗

In this paper, we introduce a multi-agent planning language called ASynchronous Evolving Tasks (ASET). The main contribution of ASET is a novel explicit representation of temp orally extended tasks that may be nondeterministic both with respect to duration and effects. Moreover, ASET explicitly models the environment as a set of uncontrollable agents. We formally define ASET descriptions and their transformation to a nondeterministic planning domain. Using a Boolean encoding, fault tolerant planning problems specified in ASET can be solved efficiently with state-of-the-art BDD-based planning systems. Our preliminary experimental results sh ow that the transformation of ASET domains to nondeterministi c planning domains is computationally efficient even for ASET descriptions with a high level of temporal detail.

[1]  E BryantRandal Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[2]  David J. Musliner,et al.  CIRCA: a cooperative intelligent real-time control architecture , 1993, IEEE Trans. Syst. Man Cybern..

[3]  Manuela M. Veloso,et al.  Guided Symbolic Universal Planning , 2003, ICAPS.

[4]  Marco Pistore,et al.  Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..

[5]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[6]  Manuela M. Veloso,et al.  OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..

[7]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[8]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[9]  Edmund M. Clarke,et al.  Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.

[10]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[11]  Luciano Lavagno,et al.  Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits , 1997, DAC.

[12]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[13]  Manuela M. Veloso,et al.  Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning , 2004, ICAPS.

[14]  Fahiem Bacchus,et al.  Planning with Resources and Concurrency: A Forward Chaining Approach , 2001, IJCAI.

[15]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[16]  Shlomo Zilberstein,et al.  LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..

[17]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[18]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[19]  Michael Gelfond,et al.  What are the Limitations of the Situation Calculus? , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.

[20]  A. R. Lingard,et al.  Planning Parallel Actions , 1998, Artif. Intell..

[21]  Håkan L. S. Younes Extending PDDL to Model Stochastic Decision Processes , 2003 .