<![CDATA[With the advancement of information technology today, there are several solutions that can facilitate the search for the shortest path (Shortest Path Problem) by using various algorithms such as the djiktra algorithm, A star algorithm, floyd warshall algorithm, prim algorithm and others. Algorithm A* (A star) is one of the algorithms included in the category of search methods that have information (informed search method). This algorithm is very good as a solution to the path finding process where this algorithm looks for the distance of the fastest route that will be taken by an initial point (starting point) to the destination object. The search technique used in this simulation is using the A* Algorithm with the manhattan distance heuristic function. Path Finding is one of the most important materials in Artificial Intelligence. Path Finding is usually used to solve problems on a graph. This study aims to provide a solution in finding the shortest route, so as to reduce operational costs that must be incurred by the company and also with this new system, it can be known the distance from one point to another without using manual calculations.]]>
Copyrights © 2022
