System RMPL Activity plan model Kirk Planner / Scheduler Plan Runner Schedulable / consistent planre-plan request commandsstatus update Compiler Converter.

Slides:



Advertisements
Similar presentations
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
Advertisements

JAYASRI JETTI CHINMAYA KRISHNA SURYADEVARA
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
5-1 Chapter 5 Tree Searching Strategies. 5-2 Satisfiability problem Tree representation of 8 assignments. If there are n variables x 1, x 2, …,x n, then.
Dynamic Wavelength Allocation in All-optical Ring Networks Ori Gerstel and Shay Kutten Proceedings of ICC'97.
Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”
Multi-agent Planning Amin Atrash. Papers Dynamic Planning for Multiple Mobile Robots –Barry L. Brummit, Anthony Stentz OBDD-based Universal Planning:
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
Specification and Enforcement of Authorization Constraints in Workflow Management Systems.
1 Wednesday, June 28, 2006 Command, n.: Statement presented by a human and accepted by a computer in such a manner as to make the human feel that he is.
Implementation of RRT based Path planner and conversion into Temporal Plan Network By: Aisha Walcott Final Project Presentation Dec. 10, J.
Math443/543 Mathematical Modeling and Optimization
Modeling and Planning with Robust Hybrid Automata Cooperative Control of Distributed Autonomous Vehicles in Adversarial Environments 2001 MURI: UCLA, CalTech,
Jean-Charles REGIN Michel RUEHER ILOG Sophia Antipolis Université de Nice – Sophia Antipolis A global constraint combining.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Hierarchical Reinforcement Learning Ersin Basaran 19/03/2005.
Executing Reactive, Model-based Programs through Graph-based Temporal Planning Phil Kim and Brian C. Williams, Artificial Intelligence and Space Systems.
03/03/2004CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Lecture 11. Matching A set of edges which do not share a vertex is a matching. Application: Wireless Networks may consist of nodes with single radios,
Backtracking.
CS230 Project Mobility in Energy Harvesting Wireless Sensor Network Nga Dang, Henry Nguyen, Xiujuan Yi.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Copyright R. Weber Search in Problem Solving ISYS 370 Dr. R. Weber.
Search.
CMSC 345 Fall 2000 Unit Testing. The testing process.
Minimum Spanning Trees
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Fundamentals of Algorithms MCS - 2 Lecture # 7
Model-based Programming of Cooperating Robots Brian C. Williams, Jonathan Kennell, I-hsiang Shu, and Raj Krishnan Artificial Intelligence and Space Systems.
Binary Search From solving a problem to verifying an answer.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
6. A PPLICATION MAPPING 6.3 HW/SW partitioning 6.4 Mapping to heterogeneous multi-processors 1 6. Application mapping (part 2)
Billy Timlen Mentor: Imran Saleemi.  Goal: Have an optimal matching  Given: List of key-points in each image/frame, Matrix of weights between nodes.
A System to Generate Test Data and Symbolically Execute Programs Lori A. Clarke Presented by: Xia Cheng.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Lecture 8 CSE 331. Main Steps in Algorithm Design Problem Statement Algorithm Problem Definition “Implementation” Analysis n! Correctness+Runtime Analysis.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Unified optimal search Search building example. Search Building 1.Choose ANW.location = window1, window2// 2 windows broken out on different floors 2.
MIT Dept of Aeronautics and Astronautics March 21, 2003 Graduate Open House Programming Cooperative Teams To Perform Global Science HOME TWO Enroute COLLECTION.
COSC 3101A - Design and Analysis of Algorithms 14 NP-Completeness.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Distributed Control and Autonomous Systems Lab. Sang-Hyuk Yun and Hyo-Sung Ahn Distributed Control and Autonomous Systems Laboratory (DCASL ) Department.
Tabu Search Applications Outlines: 1.Application of Tabu Search 2.Our Project with Tabu Search: EACIIT analytics.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Mission Planning Life in the Atacama 2004 Science & Technology Workshop Paul Tompkins Carnegie Mellon.
Distributed Vehicle Routing Approximation
Control Flow Testing Handouts
Greedy Technique.
Outline of the Chapter Basic Idea Outline of Control Flow Testing
Problem Solving by Searching
Analysis and design of algorithm
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Chapter 7: Lesson 7.6 Linear Programming
Unit 4: Dynamic Programming
Real-Time Motion Planning
Deadlocks Session - 14.
EE5900 Advanced Embedded System For Smart Infrastructure
Network Optimization Flow Decomposition.
The travelling salesman problem
Presentation transcript:

System RMPL Activity plan model Kirk Planner / Scheduler Plan Runner Schedulable / consistent planre-plan request commandsstatus update Compiler Converter RMPL program HCA Model RRTPN graph Robot Interface Autonomous Vehicles Optimal RRTPN Search Fast planning Scheduling

Locations in RMPL/TPN can grow RRTs in effort to satisfy the location constraints Tell(Robot.location = C) (start) (goal) RRT If…Path Found -Return total time to travel from start to goal -Return cost of path If…No Path Found -Add a Tell( NOT( Blimp = location)) constraint -Or if total time exceeds bound Minimum and Maximum time to get to Location C. That is, it takes at least 95 units of time to get to location C and at most 105 units of time to get to location C total time = 100 [95,105] Tell(Not(Robot.location = C)) [95,105] Signal that Robot cannot be going to any other location during this time interval RRTPN RRTTPN planning model Location constraints Memory-bounded optimal plan search

Activity: ANW1. Apply_Controls ( control inputs ) [l,u] Tell(ANW1.location = daycare) [L,U] RRTPN RRTTPN planning model Location constraints Memory-bounded optimal plan search

Location Constraints 2. Simultaneously execute on-board activities and navigate 1. Make a robot go to a location RMPL (sequence ((ANW1.location = daycare) [10,20]) ) [10,20] Tell(ANW1.location = corridor) RMPL (parallel ((ANW1.location = corridor) [10,20]) (( ANW1.Take_Pictures()) ) RRTPN Take_Pictures( )[5,15] [10,20] Tell(ANW1.location = daycare) RRTPN [0,0] AND-start RRTTPN planning model Location constraints Memory-bounded optimal plan search AND-end

Location Constraints 4. Choose which location the robot should visit 3. To perform an activitiy require a robot to be at a location RMPL (if -thennext(ANW-1.location = lab) ((Lower_Chembots()) [15,30]) ) RRTPN RMPL (choose ((ANW-1.location = daycare) [10,20]) ((ANW-1.location = cafeteria) [15,28]) ((ANW-1.location = lab) [5,20]) ) [0,0] Ask(ANW1.location = lab) Lower_Chembots( ) [15,30] [10,20] Tell(ANW1.location = daycare) [5,20] Tell(ANW1.location = lab) [15,28] Tell(ANW1.location = cafeteria) RRTPN Decision (OR) node RRTTPN planning model Location constraints Memory-bounded optimal plan search

RMPL Mission Strategies Robot Models Strategy Selection Global Path Planning Kinodynamic Maneuver Planning

Search Building steps Enter building through windowI or windowII Fly to labA Deploy chem bots