Upload
hema-kashyap
View
48
Download
3
Embed Size (px)
Citation preview
7 September 2015 1
Simplified Memory Bound A* Algorithm(Extension of A*)
Lecture-19
Hema Kashyap
7 September 2015 2
7 September 2015 3
7 September 2015 4
7 September 2015 5
7 September 2015 6
7 September 2015 7
7 September 2015 8
7 September 2015 9
7 September 2015 10
7 September 2015 11
7 September 2015 12
7 September 2015 13
7 September 2015 14
7 September 2015 15
7 September 2015 16
7 September 2015 17
7 September 2015 18
7 September 2015 19
7 September 2015 20
7 September 2015 21
7 September 2015 22
7 September 2015 23
7 September 2015 24
7 September 2015 25
7 September 2015 26
7 September 2015 27
7 September 2015 28
7 September 2015 29
7 September 2015 30
7 September 2015 31
7 September 2015 32
7 September 2015 33
SMA*-Properties
• Complete: If available 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*