Extension of A* Algorithm -Example

1. Simplified Memory Bound A*
Algorithm
(Extension of A*)
Lecture-19
Hema Kashyap
7 September 2015 1

2. 7 September 2015 2

3. 7 September 2015 3

4. 7 September 2015 4

5. 7 September 2015 5

6. 7 September 2015 6

7. 7 September 2015 7

8. 7 September 2015 8

9. 7 September 2015 9

10. 7 September 2015 10

11. 7 September 2015 11

12. 7 September 2015 12

13. 7 September 2015 13

14. 7 September 2015 14

15. 7 September 2015 15

16. 7 September 2015 16

17. 7 September 2015 17

18. 7 September 2015 18

19. 7 September 2015 19

20. 7 September 2015 20

21. 7 September 2015 21

22. 7 September 2015 22

23. 7 September 2015 23

24. 7 September 2015 24

25. 7 September 2015 25

26. 7 September 2015 26

27. 7 September 2015 27

28. 7 September 2015 28

29. 7 September 2015 29

30. 7 September 2015 30

31. 7 September 2015 31

32. 7 September 2015 32

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*
7 September 2015 33