Simulation Of Path Optimisation Algorithms
The main concern is to find and calculate the shortest distance from one node to another in the most efficient way. 3 algorithms (A* algorithm, Dijkstra algorithm and Greedy algorithm) and 2 concepts (Bidirectional Searching and Replanning) are explored and simulated. The benchmark for comparing...
Saved in:
| Main Author: | |
|---|---|
| Format: | Monograph |
| Language: | English |
| Published: |
Universiti Sains Malaysia
2017
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/53081/1/Simulation%20Of%20Path%20Optimisation%20Algorithms_Sim%20Choon%20Yeee3_2017.pdf http://eprints.usm.my/53081/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|