Android-Based Shortest Path Finding Using A-Star (A*) Algorithm in Bekasi City
| Main Authors: | Herlawati, Herlawati, Atika, Prima Dina, Yusuf, Ajif Yunizar Pratama, Khasanah, Fata Nidaul, Retnoningsih, Endang, Sanusi, Beno Aditya, Wakhid, Gedhe Hilman |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
LPPM Universitas Islam 45 Bekasi
, 2021
|
| Online Access: |
https://jurnal.unismabekasi.ac.id/index.php/piksel/article/view/3227 https://jurnal.unismabekasi.ac.id/index.php/piksel/article/view/3227/2065 |
Daftar Isi:
- Getting information on routes can be he main problem for visitors. For example in determining the route to a proper place for eating and how to find the closest route to a mall. Based on the existing problems, this study proposes an application for finding information about places that visitors want to go based on the closest route. Algorithm A-Star (A*) was implemented that uses the distance estimation by finding the closest path to the destination using a heuristic function as a basis to select from several alternatives effectively. The result showed that an android application can give the information about the location of places to visit for eating and malls by calculating the distance from the starting point to the end point.