Lecture-3

Lecture-3 - Artificial Intelligence CS 165A 165A Thursday,...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Artificial Intelligence S 165A CS 165A Thursday, Jan 13, 2011 asic Search h 3) Basic Search (Ch. 3) 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Notes • Lecture notes – Username: cs165a – Password: winter2011 • Homework 1 posted; due by Jan 20 before the class. • Tomorrow (Jan 14) Makeup Class, 2
Background image of page 2
Review • What is an agent? An entity capable of combining cognition, perception and action in behaving autonomously, purposively and flexibly in some environment hat does an agent do? What does an agent do? An agent perceives its environment, reasons about its goals, and acts upon the environment • What does PEAS stand for (description of an agent)? P erformance measure, E nvironment, A ctuators, S ensors 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Generic Agent Program • Implementing f : P* A …or… f ( P* )= A ookup table? – Lookup table? – Learning? nowledge past percepts past actions Knowledge, past percepts, past actions e.g., Add percept to percepts UT [percepts, table] Table-Driven-Agent LUT [percepts, table] NOP 4
Background image of page 4
Basic types of agent programs • Simple reflex agent Model-based reflex agent • Goal-based agent • Utility-based agent • Learning agent gg 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
roblem Solving and Search Problem Solving and Search Chapter 3 6
Background image of page 6
Problem Solving Agents • Task: Find a sequence of actions that leads to desirable (goal) states – Must define problem and solution • Finding a solution is typically a search process in the problem space – Solution = A path through the state space from the initial state to a goal state – Optimal search find the least-cost solution • Search algorithm – Input: Problem statement (incl. goal) – Output: Sequence of actions that leads to a solution ormulate search execute (action) 7 Formulate, search, execute (action)
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/22/2011 for the course CS 165A taught by Professor Su during the Spring '11 term at UCSB.

Page1 / 24

Lecture-3 - Artificial Intelligence CS 165A 165A Thursday,...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online