Figure 1.
Figure 2.
Figure 3.
Figure 4.
Figure 5.
Computational time to reach the target rack
| Target Node | Computational Times (s) | ||
|---|---|---|---|
| Dijkstra algorithm | A* algorithm | % difference in time | |
| (9,9) | 58 | 47 | 23 |
| (6,4) | 43 | 39 | 10 |
| (4,6) | 48 | 41 | 17 |
Summary of research work
| Criteria | Distance Traveled (m) | |
|---|---|---|
| Dijkstra algorithm | A* algorithm | |
| Path optimality | Good | Better |
| Speed | Slower | Moderate |
| Heuristic use | No | Yes |
| Computational cost | Higher | Lower |
| Implementation ease | Easy | Moderate |