CPSC 322 Introduction to Artificial Intelligence November 24, 2004.

Slides:



Advertisements
Similar presentations
Factorise means put into brackets Solve means Find the values of x which make the equation true.
Advertisements

Microsoft ® Office Excel ® 2007 Training Get started with PivotTable ® reports Sweetwater ISD presents:
1-10 Introduction to Complex Numbers What is a complex number?
Planning III Introduction to Artificial Intelligence CS440/ECE448 Lecture 16.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning and Scheduling. 2 USC INFORMATION SCIENCES INSTITUTE Some background Many planning problems have a time-dependent component –  actions happen.
TWEAK solving the Sussman anomaly ON(A,B) ON(B,C) ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY STACK(A,B) STACK(B,C) Two step additions to.
Planning Chapter 10.
Planning Planning is fundamental to “intelligent” behaviour. E.g.
All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.
Sussman anomaly - analysis The start state is given by: ON(C, A) ONTABLE(A) ONTABLE(B) ARMEMPTY The goal by: ON(A,B) ON(B,C) This immediately leads to.
Artificial Intelligence II S. Russell and P. Norvig Artificial Intelligence: A Modern Approach Chapter 11: Planning.
1 CSC 8520 Spring Paula Matuszek On the syllabus page there are links to two Prolog programs: a simple Prolog planner and an ADT library. Download.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
CPSC 322 Introduction to Artificial Intelligence November 19, 2004.
1 Ganesh Iyer Final Exam l Final Exam will be on Monday 10 th December. l Exam will be based on a mini-case and on all the course materials and you will.
CPSC 322 Introduction to Artificial Intelligence November 10, 2004.
CPSC 322 Introduction to Artificial Intelligence November 26, 2004.
1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)
Microsoft ® Office Excel ® 2007 Training Get started with PivotTable ® reports [Your company name] presents:
Microsoft ® Office Excel ® 2007 Training Get started with PivotTable ® reports Guangzhou Newelink Technology Co,. Ltd.
1 Pertemuan 17 Planning Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
Searching in a Graph CS 5010 Program Design Paradigms “Bootcamp” Lesson 8.4 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
Get started with PivotTable reports Make your data work for you Imagine an Excel worksheet of sales figures. It lays out thousands of rows of data about.
DRAFTING TECHNIQUES I 136. Here is a basic shape. From here, we will do some advanced drafting once we put this shape on a sheet as a drawing. Select.
1 Leaning Tower Output: Stack them leaning as far over as possible. Input: Lots of 2in wide blocks More of the output? With out falling How far over can.
Solving Equations Foundation Tier GCSE. Starter Activity – Evaluate when…... Put the cards in order of smallest on the left to largest on the right….when….
22/11/04 AIPP Lecture 16: More Planning and Operators1 More Planning Artificial Intelligence Programming in Prolog.
Simplifying Rational Expressions – Part II
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 07 : Planning.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
1 Percent Proportion. 2 Percent Means ‘of a hundred’
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Monday December 3rd 1. Check for an titled “assignments” make corrections 2. Open Fall of the Roman Empire letter project your reason.
Name: Rania Nasser Al- Asmari Section: third year B Course No : 3143.
Introduction to Planning Dr. Shazzad Hosain Department of EECS North South Universtiy
Preparing for the OCR Functional Skills Maths Assessment
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
CPSC 322 Introduction to Artificial Intelligence December 3, 2004.
Introduction to Artificial Intelligence Class 1 Planning & Search Henry Kautz Winter 2007.
1/16 Planning Chapter 11- Part1 Author: Vali Derhami.
PSY 200 Principles of Psychology Fall 2007 Calendar.
Iteration. Iteration: Review  If you wanted to display all the numbers from 1 to 1000, you wouldn’t want to do this, would you? Start display 1 display.
Tuesday December 4th 1. Review Game 2. Open Fall of the Roman Empire letter project Take notes from video 3. Fall of Roman Empire Video (40)
Adding 2-digit numbers with regrouping. Always add the ones place first
Spring Semester Planning Advisory – December 9, 2015.
How else can we find them? What are they? EMERGING Due: Friday 11 th December Circle the square numbers.
The ‘the’ By mark. Introduction A simple presentation for dealing with grammar without the complex terminology Making the works bright and simple, leaving.
1 Planning Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.
Introduction to Programming with Scratch Exploring Computer Science – Lesson 4-1.
Fact Family Fun Do you know what a fact family is? A fact family is a bunch of numbers that all work together…
Fact Family Fun Do you know what a fact family is? A fact family is a bunch of numbers that all work together…
The Distributive Property of Multiplication over Addition!!! What is this ‘Distributive’ Business Anyway??
Multiplying 2 x 2 digit numbers
The student will be able to:
Prime Numbers.
Comments on the “Three Piles” Problem
Log in but don’t open any work. Things are changing!!!
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
CSC 8520 Spring Paula Matuszek
Planning Chapter
CPSC 322 Introduction to Artificial Intelligence
CPSC 322 Introduction to Artificial Intelligence
LONG MULTIPLICATION is just multiplying two numbers.
Friday, 03 May 2019 HOW TO ANSWER ‘AMERICAN WEST’ QUESTIONS – QUESTION 1 – JANUARY 2013 LEARNING OBJECTIVES MUST– know about the different types of question.
GraphPlan Jim Blythe.
Presentation transcript:

CPSC 322 Introduction to Artificial Intelligence November 24, 2004

Things... Term project is due Monday The final exam will be at noon on Friday, December 10, in MCML 166

A new start state B A ontable(a) ontable(b) ontable(c) cleartop(a) cleartop(b) cleartop(c) armempty C

A new goal state B A on(a,b) on(b,c) C

Will our simple planner work? Load ‘strips01.ci’ and add the extra block Try it on both of these: ask achieve_all([on(b,c),on(a,b)],init,P). ask achieve_all([on(a,b),on(b,c)],init,P).

Why it doesn’t work /* the simple STRIPS planner */ remove(X,[X|Y],Y). achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & % choose first goal on list achieve(G,W0,W1) & % try to achieve that goal G achieve_all(Rem_Gs,W1,W2). % then deal with other goals achieve(G,W,W) <- holds(G,W). % goal G is achieved if it % holds for state W achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & % G on add list for Action preconditions(Action,Pre) & % get preconds for Action achieve_all(Pre,W0,W1). % preconds are now goals You gotta check intermediate states, not just the initial state

Will a more complex planner work? Load ‘strips02.ci’ -- the extra block is already there Then try it on both of these: ask achieve_all([on(b,c),on(a,b)],init,P). ask achieve_all([on(a,b),on(b,c)],init,P).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). achieve(A \= B,W,W) <- A \= B. achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- holds(G,init). true_in(G,do(A,_)) <- achieves(A,G). true_in(G,do(A,S)) <- true_in(G,S) & ~ deletes(A,G).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). achieve(A \= B,W,W) <- A \= B. % so we don’t stack a block % on itself achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- holds(G,init). true_in(G,do(A,_)) <- achieves(A,G). true_in(G,do(A,S)) <- true_in(G,S) & ~ deletes(A,G).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). % check more than init state achieve(A \= B,W,W) <- A \= B. % so we don’t stack a block % on itself achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- holds(G,init). true_in(G,do(A,_)) <- achieves(A,G). true_in(G,do(A,S)) <- true_in(G,S) & ~ deletes(A,G).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). % check more than init state achieve(A \= B,W,W) <- A \= B. % so we don’t stack a block % on itself achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- % G achieved if it holds in holds(G,init). % initial state true_in(G,do(A,_)) <- achieves(A,G). true_in(G,do(A,S)) <- true_in(G,S) & ~ deletes(A,G).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). % check more than init state achieve(A \= B,W,W) <- A \= B. % so we don’t stack a block % on itself achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- % G achieved if it holds in holds(G,init). % initial state true_in(G,do(A,_)) <- % or if it’s on the add list achieves(A,G). % of the action that’s the true_in(G,do(A,S)) <- % most recent plan step true_in(G,S) & ~ deletes(A,G).

Here’s a better planner achieve_all([],W0,W0). achieve_all(Goals,W0,W2) <- remove(G,Goals,Rem_Gs) & achieve(G,W0,W1) & achieve_all(Rem_Gs,W1,W2). achieve(G,W,W) <- true_in(G,W). % check more than init state achieve(A \= B,W,W) <- A \= B. % so we don’t stack a block % on itself achieve(G,W0,do(Action,W1)) <- achieves(Action,G) & preconditions(Action,Pre) & achieve_all(Pre,W0,W1). true_in(G,init) <- % G achieved if it holds in holds(G,init). % initial state true_in(G,do(A,_)) <- % or if it’s on the add list achieves(A,G). % of the action that’s the true_in(G,do(A,S)) <- % most recent plan step true_in(G,S) & % or if it’s achieved in an ~ deletes(A,G). % earlier plan step and not % on delete list of A

Why doesn’t it work always? goals: on(b,c) on(a,b) B A C

Why doesn’t it work always? goals: on(b,c) on(a,b) B A C

Why doesn’t it work always? goals: on(b,c) on(a,b) B A C

Why doesn’t it work always? goals: on(a,b) B A C

Why doesn’t it work always? goals: on(a,b) B A C

Why doesn’t it work always? goals: this works B A C

Why doesn’t it work always? goals: on(a,b) on(b,c) B A C

Why doesn’t it work always? goals: on(a,b) on(b,c) B A C

Why doesn’t it work always? goals: on(b,c) Now what? B A C

Why doesn’t it work always? goals: on(b,c) Pick it up again... B A C

Why doesn’t it work always? goals: on(b,c)...and put it where? B A C

Why doesn’t it work always? goals: on(b,c) B A C here?