mGPT: A Probabilistic Planner Based on Heuristic Search

We describe the version of the GPT planner used in the probabilistic track of the 4th International Planning Competition (IPC-4). This version, called mGPT, solves Markov Decision Processes specified in the PPDDL language by extracting and using different classes of lower bounds along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations where the alternative probabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state and the greedy policy.

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

[2]  Wolfgang Spohn,et al.  A general non-probabilistic theory of inductive reasoning , 2013, UAI.

[3]  Andrew G. Barto,et al.  Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..

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

[5]  Subbarao Kambhampati,et al.  Extracting Effective and Admissible State Space Heuristics from the Planning Graph , 2000, AAAI/IAAI.

[6]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[7]  Blai Bonet,et al.  GPT: A Tool for Planning with Uncertainty and Partial Information , 2001, IJCAI 2001.

[8]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

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

[10]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

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

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

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

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

[17]  Blai Bonet,et al.  Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming , 2003, ICAPS.

[18]  Patrik Haslum,et al.  New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.

[19]  Judea Pearl,et al.  From Conditional Oughts to Qualitative Decision Theory , 1993, UAI.

[20]  Blai Bonet,et al.  GPT Meets PSR , 2003, ICAPS.