List Point Marker Path Finding for Artificial Intelligence Movement in 3D Games

Abstract

In making a path finding algorithm in a 3D game to determine the direction of the NPC agent towards the destination, the Djiksra algorithm, Depth First Search, Breadth First Search and so on, usually the shortest distance is directly proportional to the travel duration to the target point. In this study, a test will be made using a list marker point such as the Djiksra algorithm to get the shortest distance and fastest time to reach the destination, in making this algorithm the C# language is used and the Unity software is used. After experimenting with various list points in different places in two directions, it was found that the distance traveled is always directly proportional to duration. So the selection of the fastest or shortest path can be done with this list point marker algorithm.

A-star Optimization with Heap-sort Algorithm on NPC Character

“…The longer the path that must be passed, the longer it will take to complete the process. To solve this problem, optimization of the algorithm can be done to shorten the calculation process (9) . Research to shorten pathfinding time by A-star algorithm has been conducted by C. Liu, et al In his research, C.Liu, et al implemented Improved A-star considering water current, traffic separation, and berthing for vessel path planning, the result is more precise towards and faster its destination (10,11) .…”