Sign inSign in
ConceptAI & ML

A* search

A search algorithm that expands the node with the lowest combined value of path cost g(n)g(n) and heuristic estimate h(n)h(n).
as Brian Yu defines itHarvard UniversityThe wording closest to all 4 definitions
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

3

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    A* search combines uniform cost search and greedy search by ordering nodes using the sum of path cost and heuristic function, f(n) = g(n) + h(n).
    • 36:45A* Search and Heuristics
    • 8:45Markov Decision Processes (MDPs) Part 2/2
  • Pieter Abbeel & Daniel Klein

    UC Berkeley · Undergraduate

    A graph traversal and path planning algorithm used to find the lowest cost path across a terrain given a cost function.
    • 1:03:02Robotics, Language, and Vision

Lectures that assume it

1

Connections

15

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

3 lecturers. 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.