PENERAPAN ALGORITMA A* (STAR) UNTUK MENCARI RUTE TERCEPAT DENGAN HAMBATAN
No Thumbnail Available
Date
2016-05-28
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Seminar Nasional Telekomunikasi dan Informatika (SELISIK 2016),Universitas Pasundan
Abstract
Algorithm A* (Astar) is one of the algorithms included in the category of search methods that has an information (informed search method). This algorithm is very good as a pathfinding process (search path). These algorithms look for the fastest route distance to be taken an initial point (starting point) to object to the destination by comparing the values in this algorithm. The calculation of the heuristic function in these simulations using Manhattan distance heuristic function. To explore the behavior of A* algorithm, we build a simulation using Java programming language. The aim of this research is to establish a simulation application of A* Algorithm for finding the fastest route, and we try to implement it into the case of barriers traffic jam. The result shows that the calculation can prove that the route found in this simulation is the route with the best solution which have the smallest value.
Description
Keywords
Algorithm, A-star, simulation, route, traffic jam