<ul><li>Lowest-cost-first search (also called least-cost search or uniform-cost search) is a search method that is guaranteed to find a minimum-cost path.</li><li>It is similar to breadth-first search, but instead of expanding a path with the fewest number of arcs, it selects a path with the lowest cost.</li><li>The frontier is treated as a priority queue ordered by the cost function.</li><li>Example 3.13 illustrates the application of lowest-cost-first search from A to F in a delivery graph.</li></ul>

Lowest-Cost-First Search

Discover more