Corpus ID: 16348646

The Grid-Based Path Planning Competition: 2014 Entries and Results

  title={The Grid-Based Path Planning Competition: 2014 Entries and Results},
  author={Nathan R Sturtevant and Jason M. Traish and J. Tulip and T. Uras and Sven Koenig and Ben Strasser and A. Botea and Daniel Damir Harabor and S. Rabin},
  • Nathan R Sturtevant, Jason M. Traish, +6 authors S. Rabin
  • Published in SOCS 2015
  • Computer Science
  • The Grid-Based Path Planning Competition has just completed its third iteration. The entriesused in the competition have improved significantly during this time, changing the view ofthe state of the art of grid-based pathfinding. Furthermore, the entries from the competition have beenmade publicly available, improving the ability of researchers to compare their work. Thispaper summarizes the entries to the 2014 competition, presents the 2014 competition results,and talks about what has been… CONTINUE READING
    23 Citations

    Figures, Tables, and Topics from this paper

    Two-Oracle Optimal Path Planning on Grid Maps
    • 4
    • PDF
    Combining Bounding Boxes and JPS to Prune Grid Pathfinding
    • 19
    • PDF
    The 2^k Neighborhoods for Grid Path Planning
    • PDF
    Grid Pathfinding on the 2 k Neighborhoods
    • 10
    Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs
    • 2
    • PDF
    Pathfinding and Abstraction with Dynamic Terrain Costs
    • 3
    • PDF
    Jump Point Search and Subgoal Graphs
    • PDF
    Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods
    • 5
    Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder
    • 2
    • PDF


    Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding
    • 1
    Abstract: Block A* and Any-Angle Path-Planning
    • 2
    • Highly Influential
    • PDF
    Online Graph Pruning for Pathfinding On Grid Maps
    • 153
    • PDF
    Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids
    • 48
    • PDF
    Identifying Hierarchies for Fast Optimal Search
    • 18
    • PDF
    Benchmarks for Grid-Based Pathfinding
    • Nathan R Sturtevant
    • Computer Science
    • IEEE Transactions on Computational Intelligence and AI in Games
    • 2012
    • 318
    • PDF
    Fast, Optimal Pathfinding with Compressed Path Databases
    • 13
    2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues
    • 6
    Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
    • 620
    • PDF
    Improving Jump Point Search
    • 43
    • PDF