Non-Deterministic Planning With Conditional Effects

Recent advances in fully observable non-deterministic (FOND) planning have enabled new techniques for various applications, such as behaviour composition, among others. One key limitation of modern FOND planners is their lack of native support for conditional effects. In this paper we describe an extension to PRP, the current state of the art in FOND planning, that supports the generation of policies for domains with conditional effects and non-determinism. We present core modifications to the PRP planner for this enhanced functionality without sacrificing soundness and completeness. Additionally, we demonstrate the planner's capabilities on a variety of benchmarks that include actions with both conditional effects and non-deterministic outcomes. The resulting planner opens the door to models of greater expressivity, and does so without affecting PRP's efficiency.

[1]  Christian J. Muise,et al.  Improved Non-Deterministic Planning by Exploiting State Relevance , 2012, ICAPS.

[2]  Richard Waldinger,et al.  Achieving several goals simultaneously , 1977 .

[3]  Sebastian Sardiña,et al.  Behavior Composition as Fully Observable Non-Deterministic Planning , 2013, ICAPS.

[4]  Hector Geffner,et al.  Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners , 2013, IJCAI.

[5]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[6]  Christian Muise,et al.  Exploiting Relevance to Improve Robustness and Flexibility in Plan Generation and Execution , 2014 .

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

[8]  Malte Helmert,et al.  Pattern Database Heuristics for Fully Observable Nondeterministic Planning , 2010, ICAPS.

[9]  Stefan Edelkamp,et al.  Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game , 2009, KI.

[10]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[11]  Farokh B. Bastani,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems �� , 2022 .

[12]  Malte Helmert,et al.  Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..

[13]  Robert P. Goldman,et al.  Using Classical Planners to Solve Nondeterministic Planning Problems , 2008, ICAPS.