Synthesizing Robust Plans under Incomplete Domain Models

Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task, thus real world agents have to plan with incomplete domain models. While domain experts cannot guarantee completeness, often they are able to circumscribe the incompleteness of the model by providing annotations as to which parts of the domain model may be incomplete. In such cases, the goal should be to synthesize plans that are robust with respect to any known incompleteness of the domain. In this paper, we first introduce annotations expressing the knowledge of the domain incompleteness and formalize the notion of plan robustness with respect to an incomplete domain model. We then show an approach to compiling the problem of finding robust plans to the conformant probabilistic planning problem, and present experimental results with Probabilistic-FF planner.

[1]  Reachability Heuristics for Planning in Incomplete Domains , 2009 .

[2]  Carmel Domshlak,et al.  Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting , 2007, J. Artif. Intell. Res..

[3]  Manuela M. Veloso,et al.  Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning , 2004, ICAPS.

[4]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[5]  Daniel Bryce,et al.  Planning and Acting in Incomplete Domains , 2011, ICAPS.

[6]  Chelsea C. White,et al.  Markov Decision Processes with Imprecise Transition Probabilities , 1994, Oper. Res..

[7]  Daniel Bryce,et al.  Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics , 2006, ICAPS.

[8]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[9]  Andrew Garland,et al.  Plan evaluation with incomplete action descriptions , 2002, AAAI/IAAI.

[10]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[11]  Alexander Shapiro,et al.  Minimax analysis of stochastic problems , 2002, Optim. Methods Softw..

[12]  Frans A. Oliehoek,et al.  Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments , 2010 .

[13]  Edmund H. Durfee,et al.  Rational Coordination in Multi-Agent Environments , 2000, Autonomous Agents and Multi-Agent Systems.

[14]  Wolfgang Faber,et al.  Planning under Incomplete Knowledge , 2000, Computational Logic.

[15]  Daniel Bryce,et al.  Evaluating Temporal Plans in Incomplete Domains , 2012, AAAI.

[16]  Nathanael Hyafil,et al.  Conformant Probabilistic Planning via CSPs , 2003, ICAPS.

[17]  Scott Sanner,et al.  Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities , 2009, ICAPS.

[18]  Qiang Yang,et al.  Learning action models from plan examples using weighted MAX-SAT , 2007, Artif. Intell..

[19]  Robert Givan,et al.  Bounded-parameter Markov decision processes , 2000, Artif. Intell..

[20]  Maria Fox,et al.  Exploration of the Robustness of Plans , 2005, AAAI.

[21]  Laurent El Ghaoui,et al.  Robust Control of Markov Decision Processes with Uncertain Transition Matrices , 2005, Oper. Res..

[22]  Shlomo Zilberstein,et al.  Formal models and algorithms for decentralized decision making under uncertainty , 2008, Autonomous Agents and Multi-Agent Systems.

[23]  Subbarao Kambhampati,et al.  Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models , 2007, AAAI.

[24]  Eyal Amir,et al.  Learning Partially Observable Deterministic Action Models , 2005, IJCAI.

[25]  J. K. Satia,et al.  Markovian Decision Processes with Uncertain Transition Probabilities , 1973, Oper. Res..

[26]  Jörg Hoffmann,et al.  SAP Speaks PDDL , 2010, AAAI.

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

[28]  P. J. Gmytrasiewicz,et al.  A Framework for Sequential Planning in Multi-Agent Settings , 2005, AI&M.