Lecture11HO - Lecture 11: Planning Prof. Julia Hockenmaier

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: Lecture 11: Planning Prof. Julia Hockenmaier [email protected] http://cs.illinois.edu/fa11/cs440 CS440/ECE448: Intro to ArtiFcial Intelligence What is planning? What is planning? Plan = ʻ plan of attack ʼ : Use inference to Fnd a sequence of actions to reach a goal state from the initial state Combines logic and search: – Logic: to describe states and deFne actions – Search: to Fnd the actual sequence of actions Applications of planning – Space exploration – Manufacturing – Games (Bridge) – Scheduling – Logistics – Semantic web support 4 CS440/ECE448: Intro AI Main types of planners Domain-speciFc: Tuned to target domain; don ʼ t generalize; used in real-world applications ( In CS440): domain-independent planning the only domain-specifc knowledge: defnitions oF basic actions; requires many simpliFying assumptions; = classical planning 5 CS440/ECE448: Intro AI Classical planning: assumptions The environment is: – ¡ully observable – Deterministic – Static – Known – ¡inite (fnitely many states and actions) Under these assumptions, a plan is a linear sequence oF actions, and planning can be done oFF-line 6 CS440/ECE448: Intro AI Classical planning State transition system ! = (S, A, ! ) – S = {states} – A = {actions} – ! = S " A # 2 S {state transition function) Initial state: s 0 Set of goal states: S g Task: Given ( ! , s , S g ) , fnd a sequence oF actions (a 1 ,a 2 ,…,a n-1 ,a n ) that produces a sequence oF state transitions (s 1 ,s 2 ,…,s n-1 ,s n ) such that s n ∈ S g . 7 CS440/ECE448: Intro AI State transition system ! = (S,A, ! ) Classical Planning Planner Solution (= sequence oF actions) (a 1 ,a 2 ,…,a n-1 ,a n ) Initial state s Goal specifcation (description oF goal states) S g Blocks World Goals: – Build a tower of A,B,C,… – Get block G, – …. Silly domain, but concisely illustrates many general planning issues B D E G C F A B Granularities of representations: Blocks World Several ontologies possible (ways to conceptualize the world and its changes) D E G C F A Alternative Ontologies: how to move a block Version 1: MoveBlock Version 2: MoveGripper GraspBlock MoveGripper UngraspBlock Version 3: MoveGripper OpenGripper MoveGripper CloseGripper Version 4: Motor1 Velocity Motor2 Velocity … Version 5: Motor1-Voltage (current, dutycycle) … …. 11 CS440/ECE448: Intro AI Levels of Ontological Commitment Abstract, High-Level Ontology Action(Achieve-Block-Confguration3) Problem is trivialized Mid-Level Ontology MoveBlock( ... ) Low-Level Ontology Action(Motor3, Voltage7) Arti¡cially and unnecessarily dif¡cult Assume we ʼ re here Planning Assumed Hardware Support Traditional Blocks World Only support relationships matter (and change): On(x,y) (x is on y) , Clr(x) (x is clear) Assumptions: – A block can support at most one other block – The table can support any number of blocks – Generalized block movement move(x,y,z) B D E G C F A I I,a2,a34 All reachable situations are defned by…...
View Full Document

This note was uploaded on 10/13/2011 for the course CS 440 taught by Professor Levinson,s during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 14

Lecture11HO - Lecture 11: Planning Prof. Julia Hockenmaier

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

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