Comparative Analysis Of Path-Finding Algorithm On Unrestricted Virtual Object Movable For Augmented Reality
Aninditya Anggari Nuryono, Alfian Ma’arif, Iswanto Iswanto · Selamat Datang di Repository UAD (Universitas Ahmad Dahlan) · 2020
Pathfinding is a necessary method in gaming, especially in 3D games. Path-finding is used by an object to find paths from one place to another based on the state of the map and other objects. Path-finding requires algorithms that can process quickly and produce the shortest path to reach a destination location. In this paper, path-finding is applied in Augmented Reality. The Intel RealSense camera is used to reconstruct the real environment and display virtual objects. The path-finding algorithm is reviewed that the A*, A* smooth, and Navigation Mesh algorithms. Each of these algorithms is implemented into the Unity 3D object game. Each object game will move simultaneously to the destination point with different starting positions and goals by avoiding many obstacles. It is obtained in the 3D simulation that the A* smooth algorithm is superior to the A* algorithm and NavMesh. The travel time required for a game object with an A* smooth algorithm is 1.54 seconds faster, and 1.4 seconds compared to A* and NavMesh. Virtual objects can use pathfinding algorithms as a navigation path in the real world. The navigation path is located in the grid area generated by Intel RealSense cameras.