74.419 Artificial Intelligence 2005/06 Partially Ordered Plans - or: "How Do You Put Your Shoes On?"

Slides:



Advertisements
Similar presentations
ARTIFICIAL INTELLIGENCE: THE MAIN IDEAS Nils J. Nilsson OLLI COURSE SCI 102 Tuesdays, 11:00 a.m. – 12:30 p.m. Winter Quarter, 2013 Higher Education Center,
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.
Artificial Intelligence 2005/06 Partial Order Planning.
Chapter 5 Plan-Space Planning.
Cognitive Systems, ICANN panel, Q1 What is machine intelligence, as beyond pattern matching, classification and prediction. What is machine intelligence,
Planning  We have done a sort of planning already  Consider the “search” applied to general problem solving  The sequence of moves with the “Jugs” was.
Planning II: Partial Order Planning
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
Plan Generation & Causal-Link Planning 1 José Luis Ambite.
PLANNING IN AI. Determine the set of steps that are necessary to achieve a goal Some steps might be conditional, i.e., they are only taken when a set.
ECE457 Applied Artificial Intelligence R. Khoury (2007)Page 1 Please pick up a copy of the course syllabus from the front desk.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Artificial Intelligence 2005/06
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
Planning: Part 2 Partial Order Planning COMP151 April 2, 2007.
Concrete architectures (Section 1.4) Part II: Shabbir Ssyed We will describe four classes of agents: 1.Logic based agents 2.Reactive agents 3.Belief-desire-intention.
Artificial Intelligence Chapter 11: Planning
A Summary of the Article “Intelligence Without Representation” by Rodney A. Brooks (1987) Presented by Dain Finn.
SPECIFYING COGNITIVE MODELS Using Patterns and Conflicts A. Macklem, F. Mili Oakland University S. Dungrani TARDEC June, 2004.
Artificial Intelligence 2005/06 Hierarchical Planning and Other Stuff Russell and Norvig, Chapter 11.
Artificial Intelligence 2005/06 Planning: STRIPS.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Biointelligence Laboratory School of Computer Science and Engineering Seoul National University Cognitive Robots © 2014, SNU CSE Biointelligence Lab.,
Intelligent Agents. Software agents O Monday: O Overview video (Introduction to software agents) O Agents and environments O Rationality O Wednesday:
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Introduction to Behavior- Based Robotics Based on the book Behavior- Based Robotics by Ronald C. Arkin.
1 Plan-Space Planning Dr. Héctor Muñoz-Avila Sources: Ch. 5 Appendix A Slides from Dana Nau’s lecture.
(Classical) AI Planning. Some Examples Route search: Find a route between Lehigh University and the Naval Research Laboratory Project management: Construct.
An Architecture for Empathic Agents. Abstract Architecture Planning + Coping Deliberated Actions Agent in the World Body Speech Facial expressions Effectors.
Artificial Intelligence Intro Agents
Topics for Today Task planning for non-player characters Coping with player character interactions and their effect on narrative In Hamlet on the Holodeck,
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
Artificial Intelligence Chapter 25 Agent Architectures Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Using Abstraction in Multi-Rover Scheduling Bradley J. Clement and Anthony C. Barrett Artificial Intelligence Group Jet Propulsion Laboratory {bclement,
K. J. O’Hara AMRS: Behavior Recognition and Opponent Modeling Oct Behavior Recognition and Opponent Modeling in Autonomous Multi-Robot Systems.
Intelligent Systems Lecture 13 Intelligent robots.
Artificial Intelligence Intro Agents
Agents CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.
Lecture 3-1CS251: Intro to AI/Lisp II Planning to Learn, Learning to Plan.
Introduction to Planning Dr. Shazzad Hosain Department of EECS North South Universtiy
Partial Order Planning 1 Brian C. Williams J/6.834J Sept 16 th, 2002 Slides with help from: Dan Weld Stuart Russell & Peter Norvig.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 25 –Robotics Thursday –Robotics continued Home Work due next Tuesday –Ch. 13:
Artificial Intelligence 2004 Non-Classical Logics Non-Classical Logics Specific Language Constructs added to classic FOPL Different Types of Logics.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2007.
Review of Parnas’ Criteria for Decomposing Systems into Modules Zheng Wang, Yuan Zhang Michigan State University 04/19/2002.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
(Classical) AI Planning. General-Purpose Planning: State & Goals Initial state: (on A Table) (on C A) (on B Table) (clear B) (clear C) Goals: (on C Table)
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
第 25 章 Agent 体系结构. 2 Outline Three-Level Architectures Goal Arbitration The Triple-Tower Architecture Bootstrapping Additional Readings and Discussion.
Cognitive Architectures and General Intelligent Systems Pay Langley 2006 Presentation : Suwang Jang.
Artificial Intelligence 2004 Planning: Situation Calculus Review STRIPS POP Hierarchical Planning Situation Calculus (John McCarthy) situations.
ADVANCED PLANNING TECHNIQUES Dr. Adam Anthony Lecture 22.
Causal-link planning 1 Jim Blythe. 2 USC INFORMATION SCIENCES INSTITUTE Causal Link Planning The planning problem Inputs: 1. A description of the world.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
Planning as Search State Space Plan Space Algorihtm Progression
Classical Planning via Plan-space search
Temporal Planning: Part 2
Artificial Intelligence Chapter 25 Agent Architectures
Class #20 – Wednesday, November 5
Subsuption Architecture
Artificial Intelligence Chapter 25. Agent Architectures
Causal-link planning 2 Jim Blythe.
Artificial Intelligence Chapter 25 Agent Architectures
Structure of intelligent agents and environments
Presentation transcript:

Artificial Intelligence 2005/06 Partially Ordered Plans - or: "How Do You Put Your Shoes On?"

Partially Ordered Plans Partially Ordered Plans - or: "How Do You Put Your Shoes On?" Partially Ordered Plans: no strict sequence partly parallel observe threats

Least Commitment Strategy Partially Instantiated Plans Least Commitment Strategy In general, make as little concrete as possible, i.e. leave things undetermined until you have to determine them and become concrete. Partially Instantiated Plans During planning, variables have not necessarily to be instantiated immediately. Instantiation can wait, until binding becomes necessary

Partial Order Planning 1 Start with a rough plan and refine iteratively. First plan consists only of start and finish actions: start - T as precondition, initial world state as effect finish - goal as precondition, NIL as effect Select actions to achieve sub-goals separately, quasi in parallel  partial-order plan Fulfill open preconditions (sub-goals), until no more unsatisfied preconditions are left (last one is T of start)

Partial Order Planning 2 Add causal links to connect effects from actions to matching preconditions for plan. Causal links specify a partial order. Recognize threats - the effect of an action A negates the precondition of another action B. Add threats as partial order to plan: B<A (do B before A).

Partial Order Planning - Threats partial order plan = set of action strings (partial plans) Problem: Detect and resolve threats, i.e. conflicts between actions – where the precondition of one action is deleted by another action – by choosing an adequate ordering of actions: if action b is a threat to action a, then a<b, i.e. a has to occur before b. (see also Russell/Norvig textbook, The POP Planner)

Partial Order Planning - Overall Use plan transformation operators to refine the partial plan and construct a complete plan: add an action (operator), reorder actions (operators), instantiate actions (operators). A partial order plan consists of a set of action sequences (partial plans; action strings) which together achieve the complete set of goal literals. Threats induce an additional partial order of these action sequences.

Hierarchical Planning Hierarchical Planning / Plan Decomposition Plans are organized in a hierarchy. Links between nodes at different levels in the hierarchy denote a decomposition of a “ complex action ” into more primitive actions (operator expansion). Example: move (x, y, z) operator expansion pickup (x, y) putdown (x, z) The lowest level corresponds to executable actions of the agent.

Hierarchical Planning Hierarchical Planning / Plan Decomposition hierarchical organisation of 'actions' complex and less complex (or: abstract) actions lowest level reflects directly executable actions planning starts with complex action on top plan constructed through action decomposition substitute complex action with plan of less complex actions (pre-defined plan schemata; or learning of plans/plan abstraction, cf. ABSTRIPS) overall plan must generate effect of complex action

Abstract Planning ABSTRIPS Consider different criticality values of preconditions in planning. Start with global, abstract plan. Then refine plan by trying to fulfill preconditions of abstract plan: Choose preconditions with highest criticality values first ( = most difficult to achieve). Then lower criticality value and continue with planning.

Other Issues in Planning Disjunctive Preconditions Conditional Effects change is due to specific condition integrate into partial planning with threats Disjunctive Effects parallel future worlds to consider All-Quantified Variables (in preconditions and effects) only for finite, static Universe of objects

Real World Agents 1 Consider Sensors and Effectors perception of environment, e.g. vision ensure correspondence between internal map of robot and environment, e.g. locating robot low-level body control, e.g. Motion Control (behaviour routines, e.g. Fuzzy or Neural Network Controller) other sensor information for body control and environment mapping, e.g. bumpers, radar sensors for other information channels and cognitive processes, e.g. speech – language

Real World Agents 2 Low-level Processing and Control Motion Control Audio Recording and low-level analysis Medium-level Processing Navigation / Route Planning Robot Location Higher-level Processing Speech Recognition, NLP,... Strategies, Planning BDI (Belief-Desire-Intention) - Architecture

Real World Agents 3 Multi-Agents Language / Communication → communicating agents mental Models of other Agents cooperating agents Strategies cooperating agents Deontic Systems Trust

Additional References Nils J. Nilsson: Artificial Intelligence – A New Synthesis. Morgan Kaufmann, San Francisco, Konolidge, K. and K. Myers: The Saphira Architecture for Autonomous Mobile Robots (Robot Soccer Class Project) Guzzoni, D. et al.: Many Robots Make Short Work. (AAAI’96 Robot Competition - Meeting Scheduling) Martina Veloso, MIT (RoboCup)

Web Links RoboCup official web page – Active Media Robotics (pioneer, Saphira) – SONY’s RoboDog AIBO – PBS Videos – Robots Alive, (AAAI’96, Maze/Meeting Scheduling Robot Competition) Games Machines Play, (RoboCup, Seattle 2001)