Sazaki, Y., Primanita, A. and Syahroyni, M. (2017) Pathfinding Car Racing Game Using Dynamic Pathfinding Algorithm and Algorithm A*. 2017 3rd International Conference on Wireless and Telematics (ICWT), Palembang, Indonesia, 27-28 July 2017, 164-169.

has been cited by the following article:

• TITLE: Study of the Interception Scheme Based on A* Path Finding Algorithm in Computer Game

  AUTHORS: Zhenjie Li, Haiming Li

  KEYWORDS: Interception Path, A* Algorithm, Dynamic Obstacles, Dynamic A* Algorithm

  JOURNAL NAME: Journal of Computer and Communications, Vol.8 No.7, July 30, 2020

  ABSTRACT: In the game, we generally use A* algorithm for pathfinding according to the target location and map information to realize the tracking and interception task. This approach is simple to implement, but is often less than ideal in its presentation, because it does not allow game units to predictably choose paths based on dynamic targets or obstacles, and may lead to blocked channels or difficulty in choosing the actual optimal path. This paper focuses on analyzing the need of a unit when intercepting another unit in the game, and make an interception scheme which can adapt itself to dynamic obstacles and moving target thus presents artificial intelligence to some extent.