资源分类
》 资源 》论文》Cost-Based Goal Recognition for the Path-Planning Domain Peta Masters and Sebastian Sardina

Cost-Based Goal Recognition for the Path-Planning Domain Peta Masters and Sebastian Sardina

2019-11-06 | |  48 |   44 |   0
Abstract “Plan recognition as planning” uses an off-the-shelf planner to perform goal recognition. In this paper, we apply the technique to path-planning. We show that a simpler formula provides an identical result in all but one set of conditions and, further, that identical ranking of goals by probability can be achieved without using any observations other than the agent’s start location and where she is “now”.

上一篇：Inhibition of Occluded Facial Regions for Distance-Based Face Recognition

下一篇：Distributing Frank-Wolfe via Map-Reduce? Armin Moharrer and Stratis Ioannidis

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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