Agents and search
What an intelligent agent is, how to state a task as a search problem, and how to solve it with breadth-first, depth-first, uniform-cost, greedy and A* search.
About 5 hours of study
Learning objectives
- Describe agents and environments with PEAS
- Run BFS, DFS and uniform-cost search
- Design admissible heuristics and use A*
Lessons
- 1
Intelligent agents Intermediate
An agent perceives its environment and acts on it. Learn the parts of an agent, how to describe a task with PEAS, the kinds of environment, and the step from simple reflex agents to agents that keep a model of the world.
- 2
Problem solving by search Intermediate
Turn a task into a search problem with states, actions, a goal and costs. Explore the state space with breadth-first, depth-first and uniform-cost search, and know which one finds the shortest or the cheapest solution.
- 3
Heuristics and A* search Intermediate
Guide search with an estimate of the distance to the goal. Compare greedy best-first search with A*, learn why an admissible heuristic makes A* optimal, and design heuristics such as Manhattan distance.
Module practice
- AI: A reflex thermostatEasy
- AI: A model-based vacuumMedium
- AI: A cleaning robot in a roomHard
- AI: Fewest steps through a mazeEasy
- AI: The cheapest routeMedium
- AI: The water jug puzzleHard
- AI: Two heuristics for the 8-puzzleEasy
- AI: Greedy search against A*Medium
- AI: Solve the 8-puzzle with A*Hard