It makes use of easy and simpler methods to prune out unnecessary routes by comparing minimal possible path distance from a given node.
This is improvised algorithm to Dijkstra’s algorithm and is used for specified application such as route finding for vehicles where the distance can be evaluated ahead of time.
It Increases the efficiency.
It uses path distance from source node to destination node with least distance measure and identifying potential nodes.
The reason behind using this algorithm due to following factors described below[5]:
Gives least cost path distance from given node hence results as good estimation of total path length. Increased Performance and so far found as best in comparison to other algorithms as it gives out quick results. It follows Best First Search algorithm and finds least cost path from initial node to destination keeping a priority queue for alternate path as well. It always finds a solution if exists.