Sign inSign in
ConceptAI & ML

Uniform cost search

A search algorithm that expands the node with the lowest cumulative path cost from the start node.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Pieter Abbeel

    UC Berkeley · Undergraduate

    • 16:00A* Search and Heuristics

Connections

8

The lectures that define it or assume it, and the concepts next to it.

Concepts6

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.