Pathfinding car racing game using dynamic pathfinding algorithm and algorithm A∗

Abstract

The game of a racing car is one of the simulation games that requires Non-Playable Character (NPC) as the opponent's choice of play when a player wants to play alone. In a race car game, the NPC requires pathfinding to be able to walk on the track and avoid obstacles to reach the finish line. Pathfinding method used by NPC in this game is Al A∗ Algorithm to find the shortest path on path and combined with Dynamic Pathfinding Algorithm to avoid static or dynamic obstacles in track. The experimental results show that the combination of the two methods gives better results compared to Al A∗. The combination of both methods can be implemented well in racing car games with unobstructed track conditions as well as track conditions with static obstacles. While on the path with dynamic barriers, the combination of both methods successfully passes the track only under certain conditions.