Coming up With Good Excuses: What to do When no Plan Can be Found

When using a planner-based agent architecture, many things can go wrong. First and foremost, an agent might fail to execute one of the planned actions for some reasons. Even more annoying, however, is a situation where the agent is incompetent, i.e., unable to come up with a plan. This might be due to the fact that there are principal reasons that prohibit a successful plan or simply because the task's description is incomplete or incorrect. In either case, an explanation for such a failure would be very helpful. We will address this problem and provide a formalization of coming up with excuses for not being able to find a plan. Based on that, we will present an algorithm that is able to find excuses and demonstrate that such excuses can be found in practical settings in reasonable time.

[1]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2]  Donald Nute,et al.  Counterfactuals , 1975, Notre Dame J. Formal Log..

[3]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[4]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[5]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[6]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[7]  Bernhard Nebel,et al.  The DESIRE Service Robotics Initiative , 2008, Künstliche Intell..

[8]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[9]  Bernhard Nebel,et al.  Continual planning and acting in dynamic multiagent environments , 2006 .

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

[11]  Hector Geffner.  Functional strips: a more flexible language for planning and problem solving , 2000 .

[12]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[13]  P. Gärdenfors.  Belief Revisions and the Ramsey Test for Conditionals , 1986 .

[14]  David E. Smith.  Choosing Objectives in OverSubscription Planning , 2004 .

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