Downloaded 110 times
More Related Content
More from Hema Kashyap
Lecture 19 sma star algorithm
- 1. Simplified Memory BoundA* Algorithm (Extension of A*) Lecture-19 Hema Kashyap 7 September 2015 1
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33. SMA*-Properties • Complete: Ifavailable memory allows to store the shortest path. • Optimal: If available memory allows to store the best path. – Otherwise: returns the best path that fits in memory. • Memory: Uses whatever memory available. • Speed: If enough memory to store entire tree: same as A* 7 September 2015 33