Introduction to Artificial Intelligence Agents Henry Kautz.

Slides:



Advertisements
Similar presentations
The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Advertisements

REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
Language for planning problems
© by cellconsult.com UC Brew Coffee The Use Case Idea.
AI planning approaches to robotics Jeremy Wyatt School of Computer Science University of Birmingham.
Paper Title Presenter: Advocate: Devil’s Advocate: NAME Date.
Planning Search vs. planning STRIPS operators Partial-order planning.
Artificial Intelligence 2005/06
CS 460, Session 20 1 Planning Search vs. planning STRIPS operators Partial-order planning.
Artificial Intelligence Chapter 11: Planning
Lecture 14: Collaborative Filtering Based on Breese, J., Heckerman, D., and Kadie, C. (1998). Empirical analysis of predictive algorithms for collaborative.
Artificial Intelligence 2005/06 Planning: STRIPS.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 2: Introduction, and Conditionals.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Prospect Priority Index
Deviation = The sum of the variables on each side of the mean will add up to 0 X
AI Principles, Lecture on Planning Planning Jeremy Wyatt.
V Avon High School Tech Club Agenda Old Business –Delete Files New Business –Week 16 Topics: Intro to HTML/CSS –Questions? Tech Club Forums.
Notes for CS3310 Artificial Intelligence Part 2: Representation of facts Prof. Neil C. Rowe Naval Postgraduate School Version of January 2006.
COMP 1001: Introduction to Computers for Arts and Social Sciences Programming in Scratch Monday, May 16, 2011.
Unit 5 – “Watch Out!”. Introduction New Topics Case Structures New Functions Less? Comparison Function Ultrasonic Sensor.
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning Michael Scherger Department of Computer Science Kent State University.
* * 0 OWL-S: Ontology Web Language For Services Reyhan AYDOĞAN Emre YILMAZ 21/12/2005OWL-S: Ontology Web Language for Services.
Artificial Intelligence: Planning Lecture 6 Problems with state space search Planning Operators A Simple Planning Algorithm (Game Playing)
CS 188: Artificial Intelligence Logical Agents Instructor: Stuart Russell University of California, Berkeley.
Recognizing Activities of Daily Living from Sensor Data Henry Kautz Department of Computer Science University of Rochester.
1 CO Games Development 2 Week 17 – Goal-Oriented Action Planning Gareth Bellaby.
Introduction to AgentSpeak and Jason for Programming Multi-agent Systems (1) Dr Fuhua (Oscar) Lin SCIS Athabasca University June 19, 2009.
CS344: Introduction to Artificial Intelligence Lecture: Herbrand’s Theorem Proving satisfiability of logic formulae using semantic trees (from Symbolic.
Equation Jeopardy Add Mixed Multiply/ Divide Fractions Q $100 Q $200 Q $300 Q $400 Q $500 Q $100 Q $200 Q $300 Q $400 Q $500 Final Jeopardy Subtract.
Solving Systems Using Elimination
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
According to the image, what is the file name? According to the image, what is the program name? Quiz Example.ev3 Falcon.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
More Than, Less Than Which Unit? True/False Estimation.
First-Order Logic and Inductive Logic Programming.
Agents that plan K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”, Morgan.
KaaShiv InfoTech presents ROBOTICS For Inplant Training / Internship, please download the "Inplant training registration form"
Introduction to Artificial Intelligence Class 1 Planning & Search Henry Kautz Winter 2007.
1/16 Planning Chapter 11- Part1 Author: Vali Derhami.
Classical Planning Chapter 10 Mausam / Andrey Kolobov (Based on slides of Dan Weld, Marie desJardins)
1 Timothy 1:33:164:11:1-26:20-21 Teachers and Church Leaders Attitude of Church Leaders SalutationSalutation 6:19 ClosingClosing.
Planning I: Total Order Planners Sections
The Microcontroller An Introduction. Topics What is a Micro Categories Example Projects Test Drive a BASIC Stamp.
Solving Systems by Elimination 5.4 NOTES, DATE ____________.
CS 4630: Intelligent Robotics and Perception Planning (Chapter 2) Instructor: Tucker Balch.
Consider the task get milk, bananas, and a cordless drill.
CS382 Introduction to Artificial Intelligence Lecture 1: The Foundations of AI and Intelligent Agents 24 January 2012 Instructor: Kostas Bekris Computer.
Starter – Think…Pair…Share Explain how ICT can be used to support the following tasks: Payroll Personnel Independently think of a suitable response (2.
Propositional Logic.
Section 1-3: Solving Equations
BASIC ELECTRONICS & ROBOTICS Instructor: Humayun Rashid Raahat
Planning Search vs. planning STRIPS operators Partial-order planning
CSE 473 Introduction to Artificial Intelligence Neural Networks
Consider the task get milk, bananas, and a cordless drill
Planning Search vs. planning STRIPS operators Partial-order planning
CSE P573 Applications of Artificial Intelligence Bayesian Learning
Planning Search vs. planning STRIPS operators Partial-order planning
CS344 : Introduction to Artificial Intelligence
CSE P573 Introduction to Artificial Intelligence Class 1 Planning & Search INTRODUCE MYSELF Relative new faculty member, but 20 years in AI research.
Artificial Intelligence CS370D
CS4341 Introduction to Artificial Intelligence
Mathematics for Computer Science MIT 6.042J/18.062J
Example 1: Writing Equivalent Equations
Warm Up Solve. 1. 2x + 9x – 3x + 8 = –4 = 6x + 22 – 4x 3. + = 5
SECTION 2-4 : SOLVING EQUATIONS WITH THE VARIABLE ON BOTH SIDES
Around the room Orders of operations.
Objectives: Graph (and write) inequalities on a number line.
Systems of Linear Equations: An Introduction
Presentation transcript:

Introduction to Artificial Intelligence Agents Henry Kautz

(Model-Based Agent)

(Planning Agent)

(Decision-Theoretic Agent)

How should the agent be designed if… It has location and dirt sensors, but no internal state? It has no sensors, but knows the starting state? It has no sensors, and does not know the starting state?

Constants = names for particular objects. Eg: COSTCO9, IPOD6 Predicates = are true or false of particular objects. Eg: At, Sells, Have Literal = predicate applied to constant(s) or variable(s). Eg: At(p), At(COSTCO9) Ground literal = predicate applied to constant(s). Eg.: At(COSTCO9) STRIPS state = set of all of the ground literals that are true in that state. Eg: { At(COSTCO9), Sells(COSTCO9,IPOD6), Sells(WALMART4,TV6) }, ~Sells(p,x) ~Sells(p,x)

, ~Sells(p,x) ~Sells(p,x) Precondition = must be true in order for action to be possible Add effect = makes a ground literal true Delete effect = makes a ground literal false { At(COSTCO9), Sells(COSTCO9,IPOD6), Sells(WALMART4,TV6) } Buy(IPOD6) { At(COSTCO9), Have(IPOD6), Sells(WALMART4,TV6) }

Shakey Making Coffee Shakey the robot has to bring coffee to Prof. Kautz. In order to make the coffee, Shakey will need to gather coffee filters, coffee, and Prof. Kautz's mug and bring them to the coffee maker in the kitchen. The coffee and filters are in the supply room, but it is locked. To unlock the supply room, Shakey will need to get the key from Prof. Kautz's office. Shakey starts in the kitchen. His goal is to fill Prof. Kautz's mug with freshly made coffee and bring the filled mug to Prof. Kautz's office.