Unit 2, Topic 12, Uniform Cost Search

Unit 2, Topic 12, Uniform Cost Search


An algorithm that has traditionally been called uniform-cost search but could be called cheapest-first search, is guaranteed to find the path with the cheapest total cost. Let’s see how it works. We start out as before in the start state. And we pop that empty path off. Move it from the frontier to explored, and then add in the paths out of that state. As before, there will be 3 of those paths. And now, which path are we going to pick next in order to expand according to the rules of cheapest first?

6 Replies to “Unit 2, Topic 12, Uniform Cost Search”

Leave a Reply

Your email address will not be published. Required fields are marked *