The Shortest Path Search Application for Base Transceiver Station (BTS) Using A^* Algorithm

DOI

10.2991/ahe.k.210205.079How to use a DOI?

Keywords

Shortest Path, Application, BTS, A* Algorithm

Abstract

Looking for the shortest path to a place is very necessary, especially when there is damage that requires immediate repair. This paper shows the design and development of an application of the shortest path search for Base Transceiver Station (BTS) using the A* algorithm. It has been designed an application that can help technicians in optimizing the distance to the base transceiver station (BTS) in case of damage and maintenance. In designing the Google Maps API (Application Programming Interface) system, the Global Positioning System (GPS), the Android SDK (Software Development Kit) has been used. A* algorithm was also successfully implemented. The result shows that there is no difference between the results of the shortest path produced by the application or the results of manual calculation. The shortest route is 0-3-1-2 which is 24.1km. It was chosen from the starting position BTS 37 -BTS 2 -BTS 29.

Copyright

© 2021, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ikhthison Mekongga
AU  - Aryanti Aryanti
PY  - 2021
DA  - 2021/02/09
TI  - The Shortest Path Search Application for Base Transceiver Station (BTS) Using A* Algorithm
BT  - Proceedings of the 4th Forum in Research, Science, and Technology (FIRST-T1-T2-2020)
PB  - Atlantis Press
SP  - 472
EP  - 477
SN  - 2589-4943
UR  - https://doi.org/10.2991/ahe.k.210205.079
DO  - 10.2991/ahe.k.210205.079
ID  - Mekongga2021
ER  -