Regarding Jump Point Search and Subgoal Graphs.
作者： Daniel D. Harabor , Tansel Uras , Peter J. Stuckey , Sven Koenig
关键词:
摘要:
ijcai.org
sci-hub.st 参考文章(5)
Nathan R. Sturtevant, The Grid-Based Path Planning Competition AI Magazine. ,vol. 35, pp. 66- 69 ,(2014) , 10.1609/AIMAG.V35I3.2547
Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling, Contraction hierarchies: faster and simpler hierarchical routing in road networks WEA'08 Proceedings of the 7th international conference on Experimental algorithms. pp. 319- 333 ,(2008) , 10.1007/978-3-540-68552-4_24
Daniel Harabor, Alban Grastien, Improving jump point search international conference on automated planning and scheduling. pp. 128- 135 ,(2014)
Tansel Uras, Sven Koenig, Feasibility Study: Subgoal Graphs on State Lattices. SOCS. pp. 100- 108 ,(2017)
Tansel Uras, Sven Koenig, Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. international joint conference on artificial intelligence. pp. 1506- 1513 ,(2018) , 10.24963/IJCAI.2018/209