A topic in the Open Knowledge Graph — a free, open map of 15,495 topics and the order to learn them in.

Intelligent Agents and Task Environments

Graduate Depth 91 in the knowledge graph ☐ I know this ☆ Set as goal
32topics build on this
407prerequisites beneath it
See this on the map →
Algorithm Design BasicsConditional Statements+1 more→→Problem Formulation and Uninformed Search Strategies
agents rationality PEAS environment-types reflex-agents utility AI-foundations

Core Idea

An agent is anything that perceives its environment through sensors and acts on it through actuators, such as a robot, a chess program or a thermostat. A rational agent chooses, for each sequence of percepts, the action expected to do best on a stated performance measure, given what it has perceived and what it knows. Designing an agent starts with describing its task environment, often with the PEAS checklist (Performance measure, Environment, Actuators, Sensors), and classifying that environment, for example as fully or partially observable. That classification largely decides which kind of agent program, from simple reflex to utility-based learning agent, is appropriate.

How It's Best Learned

Follow the opening chapters of Russell and Norvig's *Artificial Intelligence: A Modern Approach*: write a PEAS description for several tasks (a vacuum robot, a taxi driver, a spam filter, a crossword solver), then classify each environment on every dimension. Implement a reflex agent for a two-square vacuum world and show where it fails, then add internal state and a goal. Discuss how a badly chosen performance measure produces technically rational but unwanted behavior.

Common Misconceptions

Explainer

Much of AI can be described with one idea: an agent acting in an environment. The agent receives percepts through its sensors and changes the world through its actuators. A robot vacuum senses dirt and bumps and drives wheels and a brush. A chess program perceives the board and outputs moves. Mathematically, an agent's behavior is an agent function from the whole percept history to an action. The code that computes it is the agent program.

What makes an agent good? Russell and Norvig define a rational agent as one that, for each possible percept sequence, selects the action expected to maximize its performance measure, given its percepts and built-in knowledge. Three points follow. The performance measure must be stated by the designer, and it should reward what we actually want: a vacuum scored on "dirt picked up" might dump dirt and pick it up again. Rationality is about expected results, not guaranteed ones. And a rational agent should gather information and learn when that improves its expected performance.

Before designing an agent, describe its task with PEAS: Performance measure, Environment, Actuators, Sensors. Then classify the environment along several separate dimensions:

These answers guide the design. A simple reflex agent maps the current percept to an action with if-then rules. It is enough only when the environment is fully observable. A model-based reflex agent keeps internal state to track what it cannot currently see. A goal-based agent considers future action sequences that reach a goal, which leads directly to search and planning. A utility-based agent compares outcomes by how desirable they are, which matters when goals conflict or results are uncertain. Any of these can become a learning agent that improves its own components from experience.

The rest of an AI course can be read through this lens. Search and planning serve goal-based agents. Probability serves partially observable, stochastic worlds. Learning serves unknown ones.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Combining Small Groups Within 5 → Number Bonds Within 5 → Number Bonds to 10 → Tens and Ones Place Value → Reading and Writing Three-Digit Numbers → Comparing Three-Digit Numbers → Comparing and Ordering Three-Digit Quantities → Comparing and Ordering Whole Numbers → Comparing Numbers 1 to 20 → Ordering Numbers to 20 → Number Line 0 to 20 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Opposites and Additive Inverses → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Conditional Statements → Defining and Calling Functions → Functions: Decomposing Problems → Function Parameters and Argument Passing → Return Values → Variable Scope → Introduction to Classes → Objects and Instances → Methods and Attributes → Algorithm Design Basics → Intelligent Agents and Task Environments

Longest path: 92 steps · 407 total prerequisite topics

Prerequisites (3)

Leads To (1)