Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents

A common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan’s ability to avoid failure. Given a plan and an agent’s belief, which describes the set of states it deems as possible, robustness counts the number of world states in the belief from which the plan will achieve the goal without the need to replan. We formally describe the trade-off between robustness and plan cost and offer a solver that is guaranteed to produce plans that satisfy a required level of robustness. By evaluating our approach on a set of standard benchmarks, we demonstrate how it can improve the performance of a partially informed agent.

[1]  Fahiem Bacchus,et al.  A Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2002, AIPS.

[2]  Guy Shani,et al.  Comparative criteria for partially observable contingent planning , 2019, Autonomous Agents and Multi-Agent Systems.

[3]  Christian J. Muise,et al.  Computing Contingent Plans via Fully Observable Non-Deterministic Planning , 2014, AAAI.

[4]  Sven Koenig,et al.  Performance bounds for planning in unknown terrain , 2003, Artif. Intell..

[5]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

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

[8]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

[9]  Subbarao Kambhampati,et al.  Robust planning with incomplete domain models , 2017, Artif. Intell..

[10]  Hector Geffner,et al.  Planning under Partial Observability by Classical Replanning: Theory and Experiments , 2011, IJCAI.

[11]  Sarah Keren,et al.  Information Shaping for Enhanced Goal Recognition of Partially-Informed Agents , 2020, AAAI.

[12]  Shlomi Maliah,et al.  Partially Observable Online Contingent Planning Using Landmark Heuristics , 2014, ICAPS.

[13]  Alexander Zelinsky,et al.  A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..

[14]  Blai Bonet,et al.  Flexible and Scalable Partially Observable Planning with Linear Translations , 2014, AAAI.

[15]  Hector Geffner,et al.  A Translation-Based Approach to Contingent Planning , 2009, IJCAI.

[16]  Blai Bonet,et al.  Belief Tracking for Planning with Sensing: Width, Complexity and Approximations , 2014, J. Artif. Intell. Res..

[17]  Guy Shani,et al.  Replanning in Domains with Partial Information and Sensing Actions , 2011, IJCAI.

[18]  Bernhard Nebel,et al.  Continual planning and acting in dynamic multiagent environments , 2006, PCAR '06.

[19]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..