1. A formal basis for the heuristic determination of minimum cost paths;Hart;IEEE Transact Syst Sci Cyber,1968
2. Near optimal hierarchical path-finding;Botea;J Game Develop,2004
3. Pochter N, Zohar A, Rosenschein JS, Felner A. Search space reduction using swamp hierarchies. Proceedings of the twenty-fourth AAAI conference on artificial intelligence; 2010 July 11–15; Atlanta, USA. Menlo Park: AAAI Press; 2010. p. 155–6.
4. Botea A. Ultra-fast optimal pathfinding without runtime search. Proceedings of the seventh AAAI conference on artificial intelligence and interactive digital entertainment; 2011 October 11–14; Palo Alto, USA. Menlo Park: AAAI Press; 2011. p. 122–7.
5. Botea A. Fast, optimal pathfinding with compressed path databases. Proceedings of the fifth annual symposium on combinatorial search; 2012 July 19–21; Ontario, Canada. Menlo Park: AAAI Press; 2012. p. 204–5.