Universal Plans for Reactive Robots in Unpredictable Environments By M.J. Schoppers Presented by: Javier Martinez.

Slides:



Advertisements
Similar presentations
Time averages and ensemble averages
Advertisements

Completeness and Expressiveness
Heuristic Search techniques
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Planning with Non-Deterministic Uncertainty (Where failure is not an option) R&N: Chap. 12, Sect (+ Chap. 10, Sect 10.7)
Constraint Based Reasoning over Mutex Relations in Graphplan Algorithm Pavel Surynek Charles University, Prague Czech Republic.
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
Time Constraints in Planning Sudhan Kanitkar
Opmaker2: Efficient Action Schema Acquisition T.L.McCluskey, S.N.Cresswell, N. E. Richardson and M.M.West The University of Huddersfield,UK
© Sara Fleury & Félix Ingrand, LAAS/RIA, 2000 Architecture for Autonomy Sara Fleury & Félix Ingrand LAAS-CNRS (
Lecture 6: Hybrid Robot Control Gal A. Kaminka Introduction to Robots and Multi-Robot Systems Agents in Physical and Virtual Environments.
Lecture 2: Reactive Systems Gal A. Kaminka Introduction to Robots and Multi-Robot Systems Agents in Physical and Virtual Environments.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
1 Learning from Behavior Performances vs Abstract Behavior Descriptions Tolga Konik University of Michigan.
1 Planning. R. Dearden 2007/8 Exam Format  4 questions You must do all questions There is choice within some of the questions  Learning Outcomes: 1.Explain.
Picking Up the Pieces: Grasp Planning via Decomposition Trees Corey Goldfeder, Peter K. Allen, Claire Lackner, Raphael Pelosoff.
B + -Trees (Part 1). Motivation AVL tree with N nodes is an excellent data structure for searching, indexing, etc. –The Big-Oh analysis shows most operations.
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 5 Slide 1 Requirements engineering l The process of establishing the services that the.
Binary Trees Chapter 6.
November 25, 2014Computer Vision Lecture 20: Object Recognition IV 1 Creating Data Representations The problem with some data representations is that the.
Artificial Intelligence CIS 479/579 Bruce R. Maxim UM-Dearborn.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
(Classical) AI Planning. Some Examples Route search: Find a route between Lehigh University and the Naval Research Laboratory Project management: Construct.
Knowledge representation
CS212: DATA STRUCTURES Lecture 10:Hashing 1. Outline 2  Map Abstract Data type  Map Abstract Data type methods  What is hash  Hash tables  Bucket.
Design Pattern Interpreter By Swathi Polusani. What is an Interpreter? The Interpreter pattern describes how to define a grammar for simple languages,
Plan-Directed Architectural Change for Autonomous Systems Daniel Sykes, William Heaven, Jeff Magee, Jeff Kramer Imperial College London.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
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.
Pattern-directed inference systems
Test Drivers and Stubs More Unit Testing Test Drivers and Stubs CEN 5076 Class 11 – 11/14.
Black-box Testing.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
ECE450 - Software Engineering II1 ECE450 – Software Engineering II Today: Design Patterns IX Interpreter, Mediator, Template Method recap.
Expert Systems with Applications 34 (2008) 459–468 Multi-level fuzzy mining with multiple minimum supports Yeong-Chyi Lee, Tzung-Pei Hong, Tien-Chin Wang.
A fast and precise peak finder V. Buzuloiu (University POLITEHNICA Bucuresti) Research Seminar, Fermi Lab November 2005.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
Teleoperation In Mixed Initiative Systems. What is teleoperation? Remote operation of robots by humans Can be very difficult for human operator Possible.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Finding frequent and interesting triples in text Janez Brank, Dunja Mladenić, Marko Grobelnik Jožef Stefan Institute, Ljubljana, Slovenia.
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
1 Approximate XML Query Answers Presenter: Hongyu Guo Authors: N. polyzotis, M. Garofalakis, Y. Ioannidis.
1/17/2016CS225B Kurt Konolige Probabilistic Models of Sensing and Movement Move to probability models of sensing and movement Project 2 is about complex.
(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)
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
Planning I: Total Order Planners Sections
第 25 章 Agent 体系结构. 2 Outline Three-Level Architectures Goal Arbitration The Triple-Tower Architecture Bootstrapping Additional Readings and Discussion.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Artificial Intelligence 2004 Planning: Situation Calculus Review STRIPS POP Hierarchical Planning Situation Calculus (John McCarthy) situations.
Amortized Analysis and Heaps Intro David Kauchak cs302 Spring 2013.
1 Software Requirements Descriptions and specifications of a system.
Done by Fazlun Satya Saradhi. INTRODUCTION The main concept is to use different types of agent models which would help create a better dynamic and adaptive.
Chapter 3 Intercultural Communication Competence
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
Learning Teleoreactive Logic Programs by Observation
Rapid Prototyping.
Knowledge Representation
Class #20 – Wednesday, November 5
Amortized Analysis and Heaps Intro
Class #17 – Tuesday, October 30
Presentation transcript:

Universal Plans for Reactive Robots in Unpredictable Environments By M.J. Schoppers Presented by: Javier Martinez

Overview Integrate goal-directed advanced planning with sensor-driven reaction Allow the planner to generate new plans automatically

Motivation The linear approach used traditionally in AI has certain drawbacks such as: Requires a lot of a-priori information Time consuming Delays actions arrival Additionally, the plans it produces cannot cope with unpredictable environments

Ideas Not committing to any particular sequence of events Let the environment dictate what to do next “Planning is the goal-directed selection of reactions to possible situations” “If a situation satisfying condition P arises while trying to achieve goal G, then the appropriate response is action A”

Planner Elements Primitive Actions: are I/O conditions (in the context of a robot) that are maintained for an unspecified amount of time (i.e. speed up or slow down) Action Descriptions: is the actual motions that comprise them Domain Constraints: restrictions particular to a domain

Planner Elements The Goal: is a condition to be achieved, instead of a world state

Universal plans Interpretation: The plan has the shape of a tree and the interpreter traverses it by evaluating the environment at each node Hierarchy: The idea is that a plan can become part of another as an action actions, thus being a sub-plan Competence: Actions cannot replace planning even when both fulfill the same goal as plans are general while actions are conditioned

Plan Synthesis The process is done by back-chaining from the goal When back-chaining, what was a precondition now becomes a goal but in a negated form Back-chaining terminates when the preconditions are met or when a contradiction is found

Related Work Procedural Reasoning System (PRS): Reduced the amount of planning Behaviors are decomposed by hand Suffered from rigidity by not dealing with goal selection and rejection REX Project: Continuously evaluates predicates Lacks symbolic representation Plans are hand-coded

Related Work Triangle Tables: Create an index to a set of operators by extracting data from three sets: Were the first ones to use the environment in the planning stage It suffers from the same rigidity as PRS

Advantages & Limitations Being the plan basically a tree we can expect a computational efficiency of O(log(n)) Approach limited to state spaces The approach is dependant on how fast sensors can deliver information to the plan interpreter

Paper Comments Goal directed planning along with reaction based behavior seem a more natural way of achieving goals Examples were difficult to follow and assumes too much knowledge about STRIPS operators

Thank you!