papers AI Learner
The Github is limit! Click to go to the new site.

Why Couldn't You do that? Explaining Unsolvability of Classical Planning Problems in the Presence of Plan Advice

2019-03-19
Sarath Sreedharan, Siddharth Srivastava, David Smith, Subbarao Kambhampati

Abstract

Explainable planning is widely accepted as a prerequisite for autonomous agents to successfully work with humans. While there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains an open and under-studied problem, even though such situations can be the hardest to understand or debug. In this paper, we show that hierarchical abstractions can be used to efficiently generate reasons for unsolvability of planning problems. In contrast to related work on computing certificates of unsolvability, we show that these methods can generate compact, human-understandable reasons for unsolvability. Empirical analysis and user studies show the validity of our methods as well as their computational efficacy on a number of benchmark planning domains.

Abstract (translated by Google)
URL

http://arxiv.org/abs/1903.08218

PDF

http://arxiv.org/pdf/1903.08218


Similar Posts

Comments