Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
The shortest path problem has been widely studied for decades. It has been applied in many practical applications. For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. Nonetheless, the A • algorithm do have some unique propert...
Saved in:
Main Author: | Nurul Hani , Nortaja |
---|---|
Format: | Thesis |
Published: |
2004
|
Subjects: | |
Online Access: | http://studentsrepo.um.edu.my/9948/1/Nurul_Hani_Nortaja_%2D_Academic_exercise.pdf http://studentsrepo.um.edu.my/9948/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Shortest Path Trajectory System Based on Dijkstra Algorithm
by: Putri, Indah Pratiwi
Published: (2012) -
Improvements Over Two Phase Shortest Path Algorithm
by: Qureshi, M.A., et al.
Published: (2010) -
Solving shortest path problem using gravitational search algorithm and neural networks
by: Sinaie, Saman
Published: (2010) -
Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
by: Qureshi, MA., et al.
Published: (2010) -
High-Speed shortest path co-processor design
by: Idris, Mohd Yamani Idna, et al.
Published: (2009)