1. Antikainen, H.: Using the hierarchical pathfinding A* algorithm in GIS to find paths through rasters with nonuniform traversal cost. ISPRS Int. J. Geo-Inf. 2(4), 996–1014 (2013). https://doi.org/10.3390/ijgi2040996
2. Botea, A., Müller, M., Schaeffer, J.: Near optimal hierarchical path-finding (HPA*). J. Game Dev. 1, 7–28. (2004)
3. Cui, Z.X., Gu, Z.H.: Shortest path search of game map based on A* algorithm. Softw. Guide 17, 145–147. https://doi.org/CNKI:SUN:RJDK.0.2007-17-067 (2007)
4. Dean, T., Boddy, M.: An analysis of time-dependent planning. In: Seventh National Conference on Artificial Intelligence (AAAI 88), pp 49–54. Springer, Paul (1988)
5. Duchoň, F., Babinec, A., Kajan, M., Beňo, P., Florek, M., Fico, T., Jurišica, L.: Path planning with modified a star algorithm for a mobile robot. Procedia. Eng. 96, 59–69 (2014). https://doi.org/10.1016/j.proeng.2014.12.098