Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t...

49
Artificial Intelligence Chapter 1 Chapter 1 1

Transcript of Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t...

Page 1: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Artificial Intelligence

Chapter 1

Chapter 1 1

Page 2: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Outline

! What is AI?

! A brief history

! The state of the art

Chapter 1 2

Page 3: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

What is AI?

Systems that think like humans Systems that think rationallySystems that act like humans Systems that act rationally

Chapter 1 3

Page 4: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Acting humanly: The Turing test

Turing (1950) “Computing machinery and intelligence”:! “Can machines think?” "# “Can machines behave intelligently?”! Operational test for intelligent behavior: the Imitation Game

AI SYSTEM

HUMAN

? HUMANINTERROGATOR

! Predicted that by 2000, a machine might have a 30% chance offooling a lay person for 5 minutes

! Anticipated all major arguments against AI in following 50 years! Suggested major components of AI: knowledge, reasoning, language

understanding, learning

Problem: Turing test is not reproducible, constructive, oramenable to mathematical analysis

Chapter 1 4

Page 5: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Thinking humanly: Cognitive Science

1960s “cognitive revolution”: information-processing psychology replacedprevailing orthodoxy of behaviorism

Requires scientific theories of internal activities of the brain– What level of abstraction? “Knowledge” or “circuits”?– How to validate? Requires

1) Predicting and testing behavior of human subjects (top-down)or 2) Direct identification from neurological data (bottom-up)

Both approaches (roughly, Cognitive Science and Cognitive Neuroscience)are now distinct from AI

Both share with AI the following characteristic:the available theories do not explain (or engender)anything resembling human-level general intelligence

Hence, all three fields share one principal direction!

Chapter 1 5

Page 6: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Thinking rationally: Laws of Thought

Normative (or prescriptive) rather than descriptive

Aristotle: what are correct arguments/thought processes?

Several Greek schools developed various forms of logic:notation and rules of derivation for thoughts;

may or may not have proceeded to the idea of mechanization

Direct line through mathematics and philosophy to modern AI

Problems:1) Not all intelligent behavior is mediated by logical deliberation2) What is the purpose of thinking? What thoughts should I have

out of all the thoughts (logical or otherwise) that I could have?

Chapter 1 6

Page 7: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Acting rationally

Rational behavior: doing the right thing

The right thing: that which is expected to maximize goal achievement,given the available information

Doesn’t necessarily involve thinking—e.g., blinking reflex—butthinking should be in the service of rational action

Aristotle (Nicomachean Ethics):Every art and every inquiry, and similarly everyaction and pursuit, is thought to aim at some good

Chapter 1 7

Page 8: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Rational agents

An agent is an entity that perceives and acts

This course is about designing rational agents

Abstractly, an agent is a function from percept histories to actions:

f : P! # A

For any given class of environments and tasks, we seek theagent (or class of agents) with the best performance

Caveat: computational limitations makeperfect rationality unachievable

# design best program for given machine resources

Chapter 1 8

Page 9: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

AI prehistory

Philosophy logic, methods of reasoningmind as physical systemfoundations of learning, language, rationality

Mathematics formal representation and proofalgorithms, computation, (un)decidability, (in)tractabilityprobability

Psychology adaptationphenomena of perception and motor controlexperimental techniques (psychophysics, etc.)

Economics formal theory of rational decisionsLinguistics knowledge representation

grammarNeuroscience plastic physical substrate for mental activityControl theory homeostatic systems, stability

simple optimal agent designs

Chapter 1 9

Page 10: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Potted history of AI

1943 McCulloch & Pitts: Boolean circuit model of brain1950 Turing’s “Computing Machinery and Intelligence”1952–69 Look, Ma, no hands!1950s Early AI programs, including Samuel’s checkers program,

Newell & Simon’s Logic Theorist, Gelernter’s Geometry Engine1956 Dartmouth meeting: “Artificial Intelligence” adopted1965 Robinson’s complete algorithm for logical reasoning1966–74 AI discovers computational complexity

Neural network research almost disappears1969–79 Early development of knowledge-based systems1980–88 Expert systems industry booms1988–93 Expert systems industry busts: “AI Winter”1985–95 Neural networks return to popularity1988– Resurgence of probability; general increase in technical depth

“Nouvelle AI”: ALife, GAs, soft computing1995– Agents, agents, everywhere . . .2003– Human-level AI back on the agenda

Chapter 1 10

Page 11: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis

Chapter 1 11

Page 12: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road

Chapter 1 12

Page 13: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue

Chapter 1 13

Page 14: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web

Chapter 1 14

Page 15: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl

Chapter 1 15

Page 16: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge

Chapter 1 16

Page 17: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem

Chapter 1 17

Page 18: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology

Chapter 1 18

Page 19: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story

Chapter 1 19

Page 20: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law

Chapter 1 20

Page 21: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law! Translate spoken English into spoken Swedish in real time

Chapter 1 21

Page 22: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law! Translate spoken English into spoken Swedish in real time! Converse successfully with another person for an hour

Chapter 1 22

Page 23: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law! Translate spoken English into spoken Swedish in real time! Converse successfully with another person for an hour! Perform a complex surgical operation

Chapter 1 23

Page 24: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law! Translate spoken English into spoken Swedish in real time! Converse successfully with another person for an hour! Perform a complex surgical operation! Unload any dishwasher and put everything away

Chapter 1 24

Page 25: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

State of the art

Which of the following can be done at present?

! Play a decent game of table tennis! Drive safely along a curving mountain road! Drive safely along Telegraph Avenue! Buy a week’s worth of groceries on the web! Buy a week’s worth of groceries at Berkeley Bowl! Play a decent game of bridge! Discover and prove a new mathematical theorem! Design and execute a research program in molecular biology! Write an intentionally funny story! Give competent legal advice in a specialized area of law! Translate spoken English into spoken Swedish in real time! Converse successfully with another person for an hour! Perform a complex surgical operation! Unload any dishwasher and put everything away

Chapter 1 25

Page 26: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Intelligent Agents

Chapter 2

Chapter 2 1

Page 27: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Outline

! Agents and environments

! Rationality

! PEAS (Performance measure, Environment, Actuators, Sensors)

! Environment types

! Agent types

Chapter 2 3

Page 28: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Agents and environments

?

agent

percepts

sensors

actionsenvironment

actuators

Agents include humans, robots, softbots, thermostats, etc.

The agent function maps from percept histories to actions:

f : P! ! A

The agent program runs on the physical architecture to produce f

Chapter 2 4

Page 29: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Vacuum-cleaner world

A B

Percepts: location and contents, e.g., [A, Dirty]

Actions: Left, Right, Suck, NoOp

Chapter 2 5

Page 30: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

A vacuum-cleaner agent

Percept sequence Action[A, Clean] Right[A, Dirty] Suck[B, Clean] Left[B, Dirty] Suck[A, Clean], [A, Clean] Right[A, Clean], [A, Dirty] Suck... ...

function Reflex-Vacuum-Agent( [location,status]) returns an action

if status = Dirty then return Suckelse if location = A then return Rightelse if location = B then return Left

What is the right function?Can it be implemented in a small agent program?

Chapter 2 6

Page 31: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Rationality

Fixed performance measure evaluates the environment sequence– one point per square cleaned up in time T ?– one point per clean square per time step, minus one per move?– penalize for > k dirty squares?

A rational agent chooses whichever action maximizes the expected value ofthe performance measure given the percept sequence to date

Rational != omniscient– percepts may not supply all relevant information

Rational != clairvoyant– action outcomes may not be as expected

Hence, rational != successful

Rational " exploration, learning, autonomy

Chapter 2 7

Page 32: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

PEAS

To design a rational agent, we must specify the task environment

Consider, e.g., the task of designing an automated taxi:

Performance measure??

Environment??

Actuators??

Sensors??

Chapter 2 8

Page 33: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

PEAS

To design a rational agent, we must specify the task environment

Consider, e.g., the task of designing an automated taxi:

Performance measure?? safety, destination, profits, legality, comfort, . . .

Environment?? US streets/freeways, tra!c, pedestrians, weather, . . .

Actuators?? steering, accelerator, brake, horn, speaker/display, . . .

Sensors?? video, accelerometers, gauges, engine sensors, keyboard, GPS, . . .

Chapter 2 9

Page 34: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Internet shopping agent

Performance measure??

Environment??

Actuators??

Sensors??

Chapter 2 10

Page 35: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Internet shopping agent

Performance measure?? price, quality, appropriateness, e!ciency

Environment?? current and future WWW sites, vendors, shippers

Actuators?? display to user, follow URL, fill in form

Sensors?? HTML pages (text, graphics, scripts)

Chapter 2 11

Page 36: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable??Deterministic??Episodic??Static??Discrete??Single-agent??

Chapter 2 12

Page 37: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic??Episodic??Static??Discrete??Single-agent??

Chapter 2 13

Page 38: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic?? Yes No Partly NoEpisodic??Static??Discrete??Single-agent??

Chapter 2 14

Page 39: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic?? Yes No Partly NoEpisodic?? No No No NoStatic??Discrete??Single-agent??

Chapter 2 15

Page 40: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic?? Yes No Partly NoEpisodic?? No No No NoStatic?? Yes Semi Semi NoDiscrete??Single-agent??

Chapter 2 16

Page 41: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic?? Yes No Partly NoEpisodic?? No No No NoStatic?? Yes Semi Semi NoDiscrete?? Yes Yes Yes NoSingle-agent??

Chapter 2 17

Page 42: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Environment types

Solitaire Backgammon Internet shopping TaxiObservable?? Yes Yes No NoDeterministic?? Yes No Partly NoEpisodic?? No No No NoStatic?? Yes Semi Semi NoDiscrete?? Yes Yes Yes NoSingle-agent?? Yes No Yes (except auctions) No

The environment type largely determines the agent design

The real world is (of course) partially observable, stochastic, sequential,dynamic, continuous, multi-agent

Chapter 2 18

Page 43: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Agent types

Four basic types in order of increasing generality:– simple reflex agents– reflex agents with state– goal-based agents– utility-based agents

All these can be turned into learning agents

Chapter 2 19

Page 44: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Simple reflex agents

AgentEnvironm

entSensors

What the worldis like now

What action Ishould do nowCondition−action rules

Actuators

Chapter 2 20

Page 45: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Reflex agents with state

Agent

Environment

Sensors

What action Ishould do now

State

How the world evolves

What my actions do

Condition−action rules

Actuators

What the worldis like now

Chapter 2 22

Page 46: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Goal-based agents

Agent

Environment

Sensors

What it will be like if I do action A

What action Ishould do now

State

How the world evolves

What my actions do

Goals

Actuators

What the worldis like now

Chapter 2 24

Page 47: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Utility-based agents

Agent

Environment

Sensors

What it will be like if I do action A

How happy I will be in such a state

What action Ishould do now

State

How the world evolves

What my actions do

Utility

Actuators

What the worldis like now

Chapter 2 25

Page 48: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Learning agentsPerformance standard

Agent

Environment

Sensors

Performance element

changes

knowledgelearning goals

Problem generator

feedback

Learning element

Critic

Actuators

Chapter 2 26

Page 49: Arl eranger.uta.edu/~huber/cse4308/Slides/Lecture1.pdf · g y: Laws of ht Noe (or pe) er n e e: t are coect at pro cesses? l eek o s op ed vas fos of c: ion d s of ivion for s; may

Summary

Agents interact with environments through actuators and sensors

The agent function describes what the agent does in all circumstances

The performance measure evaluates the environment sequence

A perfectly rational agent maximizes expected performance

Agent programs implement (some) agent functions

PEAS descriptions define task environments

Environments are categorized along several dimensions:observable? deterministic? episodic? static? discrete? single-agent?

Several basic agent architectures exist:reflex, reflex with state, goal-based, utility-based

Chapter 2 27