Using Classical Planners to Solve Nondeterministic Planning Problems

Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic solutions in fully-observable nondeterministic planning domains. Our experiments show that when using our technique with FF and SGPlan (two well-known classical planners), its performance compares quite favorably to that of MBP, one of the best-known planners for nondeterministic planning problems.

[1]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[2]  Steven Bradley,et al.  Using Model Checking for Pre-Planning Analysis , 2001 .

[3]  B. Wah,et al.  New Features in SGPlan for Handling Preferences and Constraints in PDDL3.0∗ , 2006 .

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

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

[6]  Félix Ingrand,et al.  Propice-Plan: Toward a Unified Framework for Planning and Execution , 1999, ECP.

[7]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[8]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

[9]  R. Brafman,et al.  Contingent Planning via Heuristic Forward Search witn Implicit Belief States , 2005, ICAPS.

[10]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[11]  M. Veloso,et al.  OBDD-Based Optimistic and Strong Cyclic Adversarial Planning , 2014 .

[12]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[13]  Piergiorgio Bertoli,et al.  Strong planning under partial observability , 2006, Artif. Intell..

[14]  Robert Givan,et al.  FF-Replan: A Baseline for Probabilistic Planning , 2007, ICAPS.

[15]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[16]  Dana S. Nau,et al.  Forward-Chaining Planning in Nondeterministic Domains , 2004, AAAI.

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

[18]  Marco Pistore,et al.  Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.

[19]  Robert P. Goldman,et al.  Conditional Linear Planning , 1994, AIPS.

[20]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[21]  Michel Barbeau,et al.  Planning Control Rules for Reactive Agents , 1997, Artif. Intell..

[22]  Daniel Bryce,et al.  Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..

[23]  Hector Geffner,et al.  Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes) , 2006, AAAI.

[24]  Piergiorgio Bertoli,et al.  Towards Strong Cyclic Planning under Partial Observability , 2006, ICAPS.

[25]  Karen Zita Haigh,et al.  Interleaving Planning and Robot Execution for Asynchronous User Requests , 1998, Auton. Robots.

[26]  Reid G. Simmons,et al.  Real-Time Search in Non-Deterministic Domains , 1995, IJCAI.

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

[28]  Marco Pistore,et al.  A Hierarchical Task-Network Planner based on Symbolic Model Checking , 2005, ICAPS.

[29]  Hector Geffner,et al.  From Conformant into Classical Planning: Efficient Translations that May Be Complete Too , 2007, ICAPS.