Using swamps to improve optimal pathfinding
暂无分享,去创建一个
[1] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[2] Maxim Likhachev,et al. D*lite , 2002, AAAI/IAAI.
[3] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[4] Nathan R. Sturtevant. Memory-Efficient Abstractions for Pathfinding , 2007, AIIDE.
[5] Nathan R. Sturtevant,et al. Partial Pathfinding Using Map Abstraction and Refinement , 2005, AAAI.
[6] Sven Koenig,et al. A comparison of fast search methods for real-time situated agents , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[7] Richard E. Korf,et al. Real-Time Heuristic Search , 1990, Artif. Intell..
[8] Sven Koenig,et al. Real-time adaptive A* , 2006, AAMAS '06.
[9] David Furcy,et al. Lifelong Planning A , 2004, Artif. Intell..
[10] Adi Botea,et al. Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..