Route Recommendation Simulation for Ride Sharing Autonomous Vehicle: A Comparative Study of A* and Dijkstra Algorithm
MUHAMMAD IRSYAD MAKARIM
Informasi Umum
Kode
23.04.266
Klasifikasi
629.8 - Automatic Control Engineering
Jenis
Karya Ilmiah - Skripsi (S1) - Reference
Subjek
Computer Modeling And Simulation, Automatic Control Engineering,
Dilihat
141 kali
Informasi Lainnya
Abstraksi
<p>Autonomous vehicles have the potential to take over conventional vehicles and public vehicles. Autonomous vehicles have many advantages such as reducing congestion and reducing the use of fleet vehicles. Autonomous vehicles can be used in <a name="IntTSbGXRfh">ride-sharing</a> and also help with the problems mentioned earlier. In this research we compare the performance of the A* and Dijkstra algorithms in autonomous vehicle simulations, especially in the context of <a name="IntBCm7VUZQ">ride-sharing</a>. We investigate which algorithm is best to be implemented into ride-sharing autonomous vehicles using a simulation approach that is run in the Godot game engine. The result of this simulation shows that the A* algorithm has a better processing time and memory usage while Dijkstra has the faster completion time. </p>
- ITH3G3 - SISTEM CERDAS
Koleksi & Sirkulasi
Seluruh 1 koleksi sedang dipinjam
Anda harus log in untuk mengakses flippingbook
Pengarang
| Nama | MUHAMMAD IRSYAD MAKARIM |
| Jenis | Perorangan |
| Penyunting | Nungki Selviandro, Gia Septiana Wulandari |
| Penerjemah |
Penerbit
| Nama | Universitas Telkom, S1 Teknologi Informasi |
| Kota | Bandung |
| Tahun | 2023 |
Sirkulasi
| Harga sewa | IDR 0,00 |
| Denda harian | IDR 0,00 |
| Jenis | Non-Sirkulasi |
