Proceeding of the Electrical Engineering Computer Science and Informatics
Vol 5: EECSI 2018

Comparison Between A* And Obstacle Tracing Pathfinding In Gridless Isometric Game

Lailatul Husniah (Universitas Muhammadiyah Malang)
Rizky Ade Mahendra (Universitas Muhammadiyah Malang)
Ali Sofyan Kholimi (Universitas Muhammadiyah Malang)
Eko Budi Cahyono (Universitas Muhammadiyah Malang)

Article Info

Publish Date
18 Sep 2019

Abstract

The pathfinding algorithms have commonly used in video games. City 2.5 is an isometric grid-less game which already implements pathfinding algorithms. However, current pathfinding algorithm unable to produce optimal route when it comes to custom shape or concave collider. This research uses A* and a method to choose the start and end node to produce an optimal route. The virtual grid node is generated to make A* works on the grid-less environment. The test results show that A* be able to produce the shortest route in concave or custom obstacles scenarios, but not on the obstacle-less scenarios and tight gap obstacles scenarios.

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
857.14 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Proceeding of the Electrical Engineering Computer Science and Informatics
Website

Abbrev

EECSI

Publisher

Institute of Advanced Engineering and Science

Subject

Computer Science & IT Electrical & Electronics Engineering

Description

Proceeding of the Electrical Engineering Computer Science and Informatics publishes papers of the "International Conference on Electrical Engineering Computer Science and Informatics (EECSI)" Series in high technical standard. The Proceeding is aimed to bring researchers, academicians, scientists, ...