摘要: … SSGs to find short any-angle paths quickly: 1) The high-level paths are already valid any-angle paths, so we do not need to refine them into a low-level paths on the grid. 2) We use the …
参考文章(20)
Neil Burch, Rob Holte, Jonathan Schaeffer, Peter Yap, Block A*: database-driven search with applications in any-angle path-planning national conference on artificial intelligence. pp. 120- 125 ,(2011)
Neil Burch, Robert C. Holte, Jonathan Schaeffer, Peter Yap, Any-angle path planning for computer games national conference on artificial intelligence. pp. 201- 207 ,(2011)
Julian Dibbelt, Ben Strasser, Dorothea Wagner, Erratum: Customizable Contraction Hierarchies Experimental Algorithms. pp. E1- E1 ,(2014) , 10.1007/978-3-319-07959-2_38
Charles E. Thorpe, Path relaxation: path planning for a mobile robot national conference on artificial intelligence. pp. 318- 321 ,(1984)
Sven Koenig, Alex Nash, Craig Tovey, Lazy theta*: any-angle path planning and path length analysis in 3D national conference on artificial intelligence. pp. 147- 154 ,(2010)
Michal Pěchouček, David Šišlák, Přemysl Volf, Accelerated A* path planning adaptive agents and multi agents systems. pp. 1133- 1134 ,(2009)
Tansel Uras, Sven Koenig, An Empirical Comparison of Any-Angle Path-Planning Algorithms annual symposium on combinatorial search. pp. 206- 211 ,(2015)
Julian Dibbelt, Ben Strasser, Dorothea Wagner, Customizable Contraction Hierarchies ACM Journal of Experimental Algorithms. ,vol. 21, pp. 1- 49 ,(2016) , 10.1145/2886843
Ariel Felner, Kenny Daniel, Sven Koenig, Alex Nash, Theta*: any-angle path planning on grids Journal of Artificial Intelligence Research. ,vol. 39, pp. 533- 579 ,(2010) , 10.1613/JAIR.2994
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136