资源论文Why Can’t You Do That HAL? Explaining Unsolvability of Planning Tasks

Why Can’t You Do That HAL? Explaining Unsolvability of Planning Tasks

2019-09-29 | |  76 |   53 |   0
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 a largely 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 our methods can generate compact, humanunderstandable 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

上一篇:STCA: Spatio-Temporal Credit Assignment with Delayed Feedback in Deep Spiking Neural Networks

下一篇:Unsupervised Learning of Scene Flow Estimation Fusing with Local Rigidity

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...