Computing Contingent Plans via Fully Observable Non-Deterministic Planning

Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we push the envelope on this challenging problem, proposing a technique for generating conditional (aka contingent) plans offline. The key to our planner's success is the reliance on state-of-the-art techniques for fully observable non-deterministic (FOND) planning. In particular, we use an existing compilation for converting a planning problem under partial observability and sensing to a FOND planning problem. With a modified FOND planner in hand, we are able to scale beyond previous techniques for generating conditional plans with solutions that are orders of magnitude smaller than previously possible in some domains.

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

[2]  Alexandre Albore,et al.  Acting in Partially Observable Environments When Achievement of the Goal Cannot be Guaranteed , 2009 .

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

[4]  Hannes Strass,et al.  A general first-order solution to the ramification problem with cycles , 2013, J. Appl. Log..

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

[6]  Hector Geffner,et al.  Planning under Partial Observability by Classical Replanning: Theory and Experiments , 2011, IJCAI.

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

[8]  Piergiorgio Bertoli,et al.  Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.

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

[10]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[11]  D. Nau,et al.  Conditionalization: Adapting Forward-Chaining Planners to Partially Observable Environments , 2007 .

[12]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

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

[14]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[15]  Javier Pinto,et al.  Compiling Ramification Constraints into Effect Axioms , 1999, Comput. Intell..

[16]  Sheila A. McIlraith,et al.  What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems , 2000, AAAI/IAAI.

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

[18]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

[19]  Guy Shani,et al.  Replanning in Domains with Partial Information and Sensing Actions , 2011, IJCAI.

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

[21]  Hector Geffner,et al.  A Translation-Based Approach to Contingent Planning , 2009, IJCAI.

[22]  Christian J. Muise,et al.  Non-Deterministic Planning With Conditional Effects , 2014, ICAPS.