Probabilistic Planning in the Graphplan Framework

The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains. In this paper we explore the extent to which its representation can be used for probabilistic planning. In particular, we consider an MDP-style framework in which the state of the world is known but actions are probabilistic, and the objective is to produce a finite horizon contingent plan with highest probability of success within the horizon.

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

[2]  Craig A. Knoblock Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[3]  Leslie Pack Kaelbling,et al.  Planning under Time Constraints in Stochastic Domains , 1993, Artif. Intell..

[4]  Geoffrey J. Gordon Stable Function Approximation in Dynamic Programming , 1995, ICML.

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

[6]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

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

[8]  Tom Bylander A Linear Programming Heuristic for Optimal Planning , 1997, AAAI/IAAI.

[9]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[10]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[11]  Subbarao Kambhampati,et al.  Understanding and Extending Graphplan , 1997, ECP.

[12]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

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

[14]  David E. Smith,et al.  Conditional Effects in Graphplan , 1998, AIPS.

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

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

[17]  Ronen I. Brafman,et al.  Structured Reachability Analysis for Markov Decision Processes , 1998, UAI.

[18]  Eric Parker Making Graphplan Goal-Directed , 1999, ECP.

[19]  Michael L. Littman,et al.  Contingent planning under uncertainty via stochastic satisfiability , 1999, Artif. Intell..

[20]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.