资源分类
》 资源 》论文》Deceptive Path-Planning

Deceptive Path-Planning

2019-10-29 | |  55 |   29 |   0
Abstract Deceptive path-planning involves finding a path such that the probability of an observer identifying its final destination—before it has been reached— is minimised. This paper formalises deception as it applies to path-planning and introduces the notion of a last deceptive point (LDP) which, when measured in terms of path completion, can be used to rank paths by their potential to deceive. Building on recent developments in probabilistic goalrecognition, we propose a formula to calculate an optimal LDP and present strategies for the generation of deceptive paths by both simulation (‘showing the false’) and dissimulation (‘hiding the real’)

上一篇：Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals

下一篇：Dominance and Optimisation Based on Scale-Invariant Maximum Margin Preference Learning

用户评价
全部评价

热门资源

  • 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...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...