Publisher
Springer Nature Switzerland
Reference13 articles.
1. Cui, X., Shi, H.: A*-based pathfinding in modern computer games. IJCSNS Int. J. Comput. Sci. Netw. Secur. 11(1), 125–135 (2011)
2. Yang, B., Li, W., Wang, J., Yang, J., Wang, T., Liu, X.: A novel path planning algorithm for warehouse robots based on a two-dimensional grid model. IEEE Access 8, 80347–80357 (2020)
3. Angkuldee, A., Shih, K.P., Ruengittinun, S.: Apply A* search for robot path finding. In: 2019 Twelfth International Conference on Ubi-Media Computing (Ubi-Media), pp. 183–186. IEEE (2019)
4. Schär, K., Schwank, P., Dornberger, R., Hanne, T.: Pathfinding in the paparazzi problem comparing different distance measures. In: Proceedings of International Joint Conference on Advances in Computational Intelligence, pp. 81–95. Springer, Singapore (2022)
5. Jenkin, M., Dudek, G.: The paparazzi problem. In: Proceedings of the 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No. 00CH37113), vol. 3, pp. 2042–2047. IEEE (2000)