Two-Oracle Optimal Path Planning on Grid Maps
暂无分享,去创建一个
[1] Alban Grastien,et al. Improving Jump Point Search , 2014, ICAPS.
[2] Adi Botea. Fast, Optimal Pathfinding with Compressed Path Databases , 2012, SOCS.
[3] Nathan R. Sturtevant,et al. Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.
[4] Nathan R. Sturtevant,et al. Combining Bounding Boxes and JPS to Prune Grid Pathfinding , 2016, AAAI.
[5] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[6] Nathan R. Sturtevant,et al. The Grid-Based Path Planning Competition: 2014 Entries and Results , 2015, SOCS.
[7] Robert E. Tarjan,et al. A Back-to-Basics Empirical Study of Priority Queues , 2014, ALENEX.
[8] Hanan Samet,et al. Efficient query processing on spatial networks , 2005, GIS '05.
[9] Nathan R. Sturtevant,et al. Canonical Orderings on Grids , 2016, IJCAI.
[10] Nathan R. Sturtevant,et al. Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions , 2017, IJCAI.
[11] Ben Strasser,et al. Fast First-Move Queries through Run-Length Encoding , 2014, SOCS.
[12] Adi Botea,et al. Path Planning with Compressed All-Pairs Shortest Paths Data , 2013, ICAPS.