List Point Marker Path Finding for Artificial Intelligence Movement in 3D Games
Journal: International Journal of Emerging Trends in Engineering Research (IJETER) (Vol.9, No. 10)Publication Date: 2021-09-14
Authors : Wirawan Istiono Alethea Suryadibrata Alexander Waworuntu;
Page : 1336-1340
Keywords : List point marker; Artificial Intelligence; Non playable character; Path Finding;
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.
Other Latest Articles
- A Review of Ensemble Learning-Based Solutions for Phishing Website Detection
- Selection of Materials for Double Layer Antireflection Coating of Silicon Solar Cell
- Success Factors Affecting Public Projects of Construction Industry in Pakistan
- The Effect of User Experience on Designing Interactive Tool: A Case Study of Learning Images Compression
- Communication Modes Used for Information Sharing in Construction Projects of Pakistan
Last modified: 2021-10-14 21:49:56