5. Search: Optimal, Branch and Bound, A*
MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course: http://ocw.mit.edu/6-034F10
Instructor: Patrick Winston
This lecture covers strategies for finding the shortest path. We discuss branch and bound, which can be refined by using an extended list or an admissible heuristic, or both (known as A*). We end with an example where the heuristic must be consistent.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Watch video 5. Search: Optimal, Branch and Bound, A* online without registration, duration hours minute second in high quality. This video was added by user MIT OpenCourseWare 10 January 2014, don't forget to share it with your friends and acquaintances, it has been viewed on our site 254,347 once and liked it 2 thousand people.