1 Chapter 15 Introduction to Planning. 2 Chapter 15 Contents l Planning as Search l Situation Calculus l The Frame Problem l Means-Ends Analysis l The.

Slides:



Advertisements
Similar presentations
First-Order Logic: Better choice for Wumpus World Propositional logic represents facts First-order logic gives us Objects Relations: how objects relate.
Advertisements

Control Flow Analysis. Construct representations for the structure of flow-of-control of programs Control flow graphs represent the structure of flow-of-control.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Plan Generation & Causal-Link Planning 1 José Luis Ambite.
Binary Trees CSC 220. Your Observations (so far data structures) Array –Unordered Add, delete, search –Ordered Linked List –??
Chapter 8 Structuring Requirements Logic Modeling.
CS 484 – Artificial Intelligence
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Axiomatic Semantics.
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Artificial Intelligence 2005/06
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
Inference and Resolution for Problem Solving
Axiomatic Semantics Dr. M Al-Mulhem ICS
Jump to first page Chapter 2c System Analysis - Logic Modeling.
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Axiomatic Semantics ICS 535.
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Consumer Decision Making
Table of Contents Compound Linear Inequalities: Solving Algebraically Example: Algebraically solve, - 5 < 2x + 3  8. First break the compound inequality.
Binary Trees Chapter 6.
Group practice in problem design and problem solving
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
CS4311 Spring 2011 Unit Testing Dr. Guoqiang Hu Department of Computer Science UTEP.
المحاضرة الثالثة. Software Requirements Topics covered Functional and non-functional requirements User requirements System requirements Interface specification.
Artificial Intelligence: Planning Lecture 6 Problems with state space search Planning Operators A Simple Planning Algorithm (Game Playing)
22/11/04 AIPP Lecture 16: More Planning and Operators1 More Planning Artificial Intelligence Programming in Prolog.
UNIT - 1Topic - 3. Computer software is a program that tells a computer what to do. Computer software, or just software, is any set of machine-readable.
1 Chapter 8 Inference and Resolution for Problem Solving.
Chapter 8 Structuring System Logical Requirements.
Chapter 6 Binary Trees. 6.1 Trees, Binary Trees, and Binary Search Trees Linked lists usually are more flexible than arrays, but it is difficult to use.
Chapter 17 Designing for the Web Ryan Galloway Andy O’Neil Joe Ahn.
Lecture 7: Uninformed Search Dr John Levine Algorithms and Complexity February 13th 2006.
1 Chapter 15 Introduction to Planning. 2 Chapter 15 Contents l Planning as Search l Situation Calculus l The Frame Problem l Means-Ends Analysis l The.
[ Part III of The XML seminar ] Presenter: Xiaogeng Zhao A Introduction of XQL.
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Introduction to Planning Dr. Shazzad Hosain Department of EECS North South Universtiy
Human Alive Detection and Locating the Detection Area Using GPS and XBee Student Name USN NO Guide Name H.O.D Name Name Of The College & Dept.
Intro to Planning Or, how to represent the planning problem in logic.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Introduction to State Space Search
Search in State Spaces Problem solving as search Search consists of –state space –operators –start state –goal states A Search Tree is an efficient way.
Planning I: Total Order Planners Sections
Chapter 2 Approaches/Methods Artificial Intelligence Instructor: Haris Shahzad Artificial Intelligence CS-402.
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
Chapter 12 Theory of Computation Introduction to CS 1 st Semester, 2014 Sanghyun Park.
CS 101 – Oct. 7 Solving simple problems: create algorithm Structure of solution –Sequence of steps (1,2,3….) –Sometimes we need to make a choice –Sometimes.
Representation and Search The function of a representation is to capture the critical features of the problem domain –and make the information accessible.
Modern Systems Analysis and Design Fourth Edition Chapter 8 Structuring System Logical Requirements (process description)
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Lego League. What is the Lego League? What we will be doing for the next few weeks The AIM of the next few weeks is to gain knowledge into programming,
Knowledge Representation
Chapter 8 Structuring System Logical Requirements
Plan Agents Chapter 7..
2. Specification and Modeling
Planning in Answer Set Programming
Chapter 1: Introduction
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
CSE (c) S. Tanimoto, 2001 Search-Introduction
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
Math I Quarter I Standards
Chapter 8 Structuring System Logical Requirements
A QUICK START TO OPL IBM ILOG OPL V6.3 > Starting Kit >
Unit 3 lesson 2-5 The Need For Algorithms- Creativity in Algorithms – Simple Commands - Functions Day 18.
Artificial Intelligence Chapter 7 Agents That Plan
CSE (c) S. Tanimoto, 2002 State-Space Search
CSE (c) S. Tanimoto, 2004 State-Space Search
Chapter 7, Preparing the Content of your Speech pgs
Chapter 2 Problems, Problem Spaces, and Search?
Presentation transcript:

1 Chapter 15 Introduction to Planning

2 Chapter 15 Contents l Planning as Search l Situation Calculus l The Frame Problem l Means-Ends Analysis l The Blocks World

3 Planning as Search l Planning involves finding a plan which will enable a system (or a robot) to solve a problem, or carry out some task. l A planner aims to find a plan, which is a sequence of actions. l One method is to use search to identify a plan. l A search tree contains nodes which represent states, with edges between nodes representing actions.

4 Situation Calculus (1) l An extension of FOPC. l For example: l S 1 is a situation variable. l The above statement tells us that in situation S 1 the robot is in the same room as the cheese. l This notation, unlike FOPC, allows us to describe things that change over time.

5 Situation Calculus (2) l The Result function allows us to describe the result of carrying out actions: Result (Move 1,2, S 1 ) = S 2 l This states that if in situation S 1 the planner carried out the action Move 1,2 it will be in situation S 2 l An effect axiom describes the effect of carrying out an action. For example: l  x, y, s In (Robot, y, s) Λ In (x, y, s)  Has (Robot, x, Result (Take, s))

6 The Frame Problem (1) l An effect axiom does not specify what does not change when an action is taken. l Determining what stays the same is the frame problem. l This can be difficult – usually there are very many things that do not change when an action is taken. l Frame axioms specify things that do not change. For example:  y, s In (Robot, y, s)  In (Robot, y, Result (Take, s)) l This states that if the robot is in room y and it takes an object then it will still be in room y.

7 The Frame Problem (2) l Even in a simple problem, a planner can need an enormous number of frame axioms. l This is the representational frame problem. l One way to solve this problem is to combine frame axioms and effect axioms into successor state axioms such as:

8 Means-Ends Analysis l Means-ends analysis involves examining the differences between the current state and the goal state. l Actions are selected that minimize these differences. l The planner can select an action even if it is not currently possible. It must then select another action that will make the first action possible.

9 The Blocks World l Many planning systems can be illustrated using the blocks world. l The blocks world consists of a number of blocks and a table. l The blocks can be picked up and moved around. l The following shows the start and goal states of a simple problem: