Hellow guys, Welcome to my website, and you are watching 5. Search: Optimal, Branch and Bound, A*. and this vIdeo is uploaded by MIT OpenCourseWare at 2014-01-10T11:38:06-08:00. We are pramote this video only for entertainment and educational perpose only. So, I hop you like our website.
| Name | 5. Search: Optimal, Branch and Bound, A* |
| Video Uploader | Video From MIT OpenCourseWare |
| Upload Date | This Video Uploaded At 10-01-2014 19:38:06 |
| Video Discription | 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 |
| Category | Education |
| Tags | shortest path | branch and bound | extended list | admissible heuristic | consistent heuristic | A* | optimal search | accumulated distance | potential distance | oracle |
