Skip to content
lectern.tv
1/16

A* Search and Heuristics

Pieter AbbeelDistinguishedUC Berkeley

Professor of Electrical Engineering and Computer Sciences

1:25:00·2018·undergraduate level

This lecture introduces informed search algorithms, detailing the principles of heuristic functions, greedy best-first search, and the A* algorithm. It rigorously covers the properties of A* optimality and completeness, examining the conditions of heuristic admissibility and consistency.

AI & MLAlgorithms & Data StructuresSearch AlgorithmsHeuristic SearchA* Algorithm

COMPSCI 188, LEC 001 - Fall 2018

COMPSCI 188, LEC 001 - Pieter Abbeel, Daniel Klein

Copyright @2018 UC Regents; all rights reserved

LecturerAll lecturers →
Pieter AbbeelDistinguished

Professor of EECS & Director of Berkeley Robot Learning Lab, UC Berkeley

Professor of EECS at UC Berkeley and ACM Prize in Computing recipient for deep reinforcement learning and apprenticeship robotics.

1 course · 22 lecturesCanon
Previous · Lecture 2

Uninformed Search

Next · Lecture 4

Constraint Satisfaction Problems (CSPs) Part 1/2

Comments

Add a comment...Sign in