Bounded Branching and Modalities in Non-Deterministic Planning

We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when modal formulae are introduced into the description language. New planning tasks, such as whether there exists a plan with at most k branch points for a fully (or partially) observable non-deterministic domain, and whether there exists a no-branch (a.k.a. conformant) plan for partially observable domains, are introduced and their complexity analyzed. Among other things, we show that deciding the existence of a conformant plan for partially observable domains with modal formulae is 2EXPSPACE-complete, and that the problem of deciding the existence of plans with bounded branching, for fully or partially observable contingent domains, has the same complexity of the conformant task. These results generalize previous results on the complexity of non-deterministic planning and fill a slot that has gone unnoticed in non-deterministic planning, that of conformant planning for partially observable domains.

[1]  Robert P. Goldman,et al.  Expressive Planning and Explicit Knowledge , 1996, AIPS.

[2]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[3]  Leslie Pack Kaelbling,et al.  Acting Optimally in Partially Observable Stochastic Domains , 1994, AAAI.

[4]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

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

[8]  David E. Smith,et al.  Optimal Limited Contingency Planning , 2002, UAI.

[9]  Blai Bonet,et al.  Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback , 2003, IJCAI.

[10]  Vasek Chvátal,et al.  Mastermind , 1983, Comb..

[11]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs , 1978, Oper. Res..

[12]  Patrik Haslum,et al.  Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.

[13]  E. J. Sondik,et al.  The Optimal Control of Partially Observable Markov Decision Processes. , 1971 .

[14]  Blai Bonet,et al.  An Algorithm Better than AO*? , 2005, AAAI.

[15]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[16]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[17]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

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

[19]  Jussi Rintanen,et al.  Distance Estimates for Planning in the Discrete Belief Space , 2004, AAAI.

[20]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[21]  Michael L. Littman,et al.  Probabilistic Propositional Planning: Representations and Complexity , 1997, AAAI/IAAI.

[22]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[23]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[24]  Hudson Turner,et al.  Polynomial-Length Planning Spans the Polynomial Hierarchy , 2002, JELIA.

[25]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[26]  D. Du,et al.  Theory of Computational Complexity , 2000 .

[27]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[28]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[29]  Michael L. Littman,et al.  MAXPLAN: A New Approach to Probabilistic Planning , 1998, AIPS.

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