资源分类
》 资源 》论文》Regarding Jump Point Search and Subgoal Graphs

Regarding Jump Point Search and Subgoal Graphs

2019-09-29 | |  67 |   40 |   0
Abstract In this paper, we define Jump Point Graphs (JP), a preprocessing-based path-planning technique similar to Subgoal Graphs (SG). JP allows for the first time the combination of Jump Point Search style pruning in the context of abstraction-based speedup techniques, such as Contraction Hierarchies. We compare JP with SG and its variants and report new state-of-the-art results for grid-based pathfinding

上一篇：Privacy-Preserving Obfuscation of Critical Infrastructure Networks

下一篇：Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring

用户评价
全部评价

热门资源

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