Comparison of A∗ and dynamic pathfinding algorithm with dynamic pathfinding algorithm for NPC on car racing game

Abstract

The game of a racing car is one of the simulation games that require Non-Playable Character (NPC) as the opponent's choice of play when a player wants to play on his own. In a race car game, the NPC needs 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 Dynamic Pathfinding Algorithm to avoid the static and dynamic obstacles in track. The experimental results show that NPCs using combined Dynamic Pathfinding Algorithm and Algorithm A∗ get the results from NPCs that use only DPA Algorithm A∗ while the obstacle position and trajectory shape have a big effect on DPA.