Probabilistic Propositional Planning: Representations and Complexity

Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superficial differences between the representations, they are "expressively equivalent," meaning that planning problems specified in one representation can be converted to equivalent planning problems in any of the other representations with at most a polynomial factor increase in the size of the resulting representation and the number of steps needed to reach the goal with sufficient probability. The paper proves that the computational complexity of determining whether a successful plan exists for planning problems expressed in any of these representations is EXPTIME-complete and PSPACE-complete when plans are restricted to take a polynomial number of steps.

[1]  Larry J. Stockmeyer,et al.  Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..

[2]  Christos H. Papadimitriou,et al.  Games Against Nature (Extended Abstract) , 1983, IEEE Annual Symposium on Foundations of Computer Science.

[3]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[4]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[5]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

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

[7]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[8]  Craig Boutilier,et al.  Exploiting Structure in Policy Construction , 1995, IJCAI.

[9]  Christer Bäckström.  Expressive Equivalence of Planning Formalisms , 1995, Artif. Intell..

[10]  Christopher Lusena,et al.  The Complexity of Deterministically Observable Finite-horizon Markov Decision Processes , 1996 .

[11]  David Heckerman,et al.  Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[12]  Craig Boutilier,et al.  Approximate Value Trees in Structured Dynamic Programming , 1996, ICML.

[13]  E. Allender,et al.  The Complexity of Unobservable Nite-horizon Markov Decision Processes , 1996 .

[14]  T. Dean,et al.  Planning under uncertainty: structural assumptions and computational leverage , 1996 .

[15]  Craig Boutilier,et al.  Abstraction and Approximate Decision-Theoretic Planning , 1997, Artif. Intell..

[16]  Michael L. Littman,et al.  The Complexity of Plan Existence and Evaluation in Probabilistic Domains , 1997, UAI.