Prof. Brian C. Williams February 23 rd, /6.834 Cognitive Robotics. based on [Kim,Williams & Abramson, IJCAI01] Outline
|
|
- Osborne Joseph Whitehead
- 5 years ago
- Views:
Transcription
1 Executing Model-based Programs Using Graph-based Temporal Planning Prof. Brian C. Williams February 23 rd, /6.834 Cognitive Robotics based on [Kim,Williams & Abramson, IJCAI01] Outline Model-based Programming Cooperative Vehicle Missions The Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning
2 Why Model-based Programming? Image courtesy of JPL. Mars 98: Climate Orbiter Mars Polar Lander Leading Diagnosis: Legs deployed during descent. Noise spike on leg sensors latched by monitors. Laser altimeter registers 50ft. Begins polling leg monitors to determine touch down. Latched noise spike read as touchdown. Engine shutdown at ~50ft. Create Embedded Languages That Reason on the Fly from Commonsense Models Model-based Programs Interact Directly with State Embedded programs interact with plant sensors/actuators: Read sensors Set actuators Model-based programs interact with plant state: Read state Write state Embedded Program Model-based Embedded Program Obs Cntrl S Plant S Plant Programmer must map between state and sensors/actuators. Model-based executive maps between sensors, actuators to states.
3 Example: The model-based program sets the state to thrusting, and the deductive controller.... Oxidizer tank Fuel tank Deduces that thrust is off, and the engine is healthy Plans actions to open six valves Deduces that a valve failed - stuck closed Determines that valves on the backup engine will achieve thrust, and plans needed actions. RMPL Model-based Program Titan Model-based Executive Control Program Executes concurrently Preempts Queries (hidden) states Asserts (hidden) state Generates target goal states conditioned Control on Sequencer state estimates System Model State estimates State goals Open Open Closed Valve Close Stuck open Stuck 0.01 closed inflow = outflow = 0 Tracks Mode Mode Deductive likely Controller Estimation plant states Observations Commands Plant Tracks least cost Reconfiguration goal states
4 Modeling Complex Behaviors through Probabilistic Concurrent Constraint Automata Open Open Closed Valve Close Stuck open Stuck 0.01 closed inflow = outflow = 0 Complex, discrete behaviors modeled through concurrency, hierarchy and non-determinism. Anomalies and uncertainty modeled by probabilistic transitions Physical interactions modeled by discrete and continuous constraints Outline Model-based Programming Cooperative Vehicle Missions The Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning
5 Cooperative Search and Rescue High-level vehicle coordination Fast Agile Maneuvering Cooperative Mars Exploration How do we coordinate heterogeneous teams of orbiters, rovers and air vehicles to perform globally optimal science exploration?
6 Example Scenario TWO ONE HOME Landing Site: ABC COLLECTION POINTEnroute RENDEZVOUS Landing Site: XYZ SCIENCE AREA 1 Diverge SCIENCE AREA 1 Properties: SCIENCE AREA 3 Teams exploit a hierarchy of complex strategies. Maneuvers are temporally coordinated. Novel events occur during critical phases. Quick responses draw upon a library of contingencies. Self-Adaptive Languages: RAPs [Firby PhD] RAPS programs monitor goals and plan activities (define-rap (index (move-to?thing?place)) (succeed (LOCATION?thing?place)) (method (context (and (LOCATION?thing?loc) (not (=?loc UNKNOWN)))) (task-net (t0 (goto?loc) ((TRUCK-LOCATION?loc) for t1)) (t1 (pickup?thing)((truck-holding?thing) for t2) ((TRUCK-HOLDING?thing) for t3)) (t2 (goto?place) ((TRUCK-LOCATION?place) for t3)) (t3 (putdown?thing)))) (method (context (LOCATION?thing UNKNOWN)) (task-net (t0 (goto WAREHOUSE)))))
7 Self-Adaptive Languages: RAPs [Firby PhD] RAPS Programs recover by selecting from functionally redundant methods (define-rap (index (move-to?thing?place)) (succeed (LOCATION?thing?place)) (method (context(and (LOCATION?thing?loc) (not (=?loc UNKNOWN)))) (task-net (t0 (goto?loc) ((TRUCK-LOCATION?loc) for t1)) (t1 (pickup?thing)((truck-holding?thing) for t2) ((TRUCK-HOLDING?thing) for t3)) (t2 (goto?place) ((TRUCK-LOCATION?place) for t3)) (t3 (putdown?thing)))) (method (context (LOCATION?thing UNKNOWN)) (task-net (t0 (goto WAREHOUSE))))) Self-Adaptive languages: RAPS RAPS Exploits contingencies by performing functionally redundant method selection Methods are chosen based on the current situation. If a method fails, another is tried instead. Tasks do not complete until satisfied. Methods can include monitoring subtasks that deal with contingencies and opportunities. Limitations Goals must be explicitly observable Methods selected reactively Method selection may dig itself into a hole. Create Languages with planner-like capabilities
8 RMPL Model-based Program Control Program Executes concurrently Preempts non-deterministic choice A[l,u] timing A at l location Environment Model Kirk Model-based Executive Selects consistent threads of activity Control from redundant Sequencer methods Schedules and Dispatches Activities Dynamically location estimates location goals HOME Landing Site: ABC Landing Site: XYZ T W O O N E COLLECTION POINT Enroute RENDEZVOUS SCIENCE AREA 1 Diverge SCIENCE AREA 1 Tracks location Mode Mode Deductive Controller Estimation Finds least cost paths Reconfiguration SCIENCE AREA 3 Executive Observations pre-plans activities pre-plans paths Plant dynamically schedules [Tsmardinos et al.] Commands Outline Model-based Programming Cooperative Vehicle Missions Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning
9 Reactive Model-based Programming Idea: Describe team behaviors by starting with a rich concurrent, embedded programming language (RMPL,TCC, Esterel): c If c next A Unless c next A A, B Always A Sensing/actuation activities Conditional execution Preemption Full concurrency Iteration Add temporal constraints: A [l,u] Timing Add choice (non-deterministic or decision-theoretic): Choose {A, B} Contingency Example Enroute Activity: Enroute Corridor 2 Rendezvous Rescue Area Corridor 1
10 RMPL for Group-Enroute Group-Enroute()[l,u] = { choose { do { Group-Traverse- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Traverse- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK }; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } } RMPL for Group-Enroute Activities: Group-Enroute()[l,u] = { choose { do { Group-Traverse- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Traverse- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK }; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } }
11 RMPL for Group-Enroute Conditionality Group-Enroute()[l,u] = { choose { and Preemption: do { Group-Traverse- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Traverse- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK }; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } } RMPL for Group-Enroute Sequentiality: Group-Enroute()[l,u] = { choose { Concurrency: do { Group-Traverse- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Traverse- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK } ; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } }
12 RMPL for Group-Enroute Temporal Constraints: Group-Enroute()[l,u] = { choose { do { Group-Fly- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Fly- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK }; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } } RMPL for Group-Enroute Non-deterministic Group-Enroute()[l,u] = { choose { choice: do { Group-Traverse- Path(PATH1_1,PATH1_2,PATH1_3,RE_POS)[l*90%,u*90%]; } maintaining PATH1_OK, do { Group-Traverse- Path(PATH2_1,PATH2_2,PATH2_3,RE_POS)[l*90%,u*90%]; } maintaining PATH2_OK }; { Group-Transmit(OPS,ARRIVED)[0,2], do { Group-Wait(HOLD1,HOLD2)[0,u*10%] } watching PROCEED } }
13 Model-Predictive Dispatch for RMPL How do we provide fast, temporally flexible planning? Graph-based planners support fast planning. but plans are totally order. Desire flexible plans based on simple temporal networks (e.g., HSTS, Muscetola et al.). How do we create temporally flexible plan graphs? Generalize simple temporal networks (temporal plan network TPN). Model-Predictive Dispatch for RMPL Reactive Model-based Programming Language RMPL Compiler Temporal Plan Network (TPN) with STN Represents all RMPL executions Reactive Temporal Planner Selects schedulable execution threads of TPN Concurrent Plan Plan = Execution threads related by Simple Temporal Net
14 Outline Model-based Programming Cooperative Vehicle Missions Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning Enroute Activity: Start with flexible plan representation 1 Enroute 2 Group Fly Traverse 4 5 Group Wait 9 10 Science Target 8 Group Transmit Activity (or sub-activity)
15 Enroute Activity: Start with flexible plan representation 1 Enroute [450,540] 2 Group Traverse Group Wait 4 [405, 486] 5 [0, 54] Science Target 8 Group Transmit [0, ] [0, 2] Activity (or sub-activity) Duration (temporal constraint) Enroute Activity: TPN representation of Enroute activity and sub-activities 1 Enroute 2 Group Fly Path Group Wait Science Target 3 Group Fly Path 8 Group Transmit Activity (or sub-activity)
16 Enroute Activity: Add conditional nodes 1 Enroute [450,540] 2 Group Traverse Group Wait [405, 486] [0, 54] 4 5 Science Target 3 Group Traverse 8 Group Transmit [0, ] [405, 486] [0, 2] Activity (or sub-activity) Duration (temporal constraint) Conditional node Enroute Activity: Add temporally extended, symbolic constraints 1 Enroute [450,540] 2 Group Traverse Group Wait [405, 486] [0, 54] Ask( PATH1 = OK) Science Target Ask( EXPLORE = OK) 3 Group Traverse 8 Group Transmit [0, ] 13 6 [405, 486] 7 11 [0, 2] 12 Ask( PATH2 = OK) Activity (or sub-activity) Duration (temporal constraint) Conditional node Symbolic constraint (Ask,Tell)
17 Outline Cooperative Vehicle Missions Model-based Programming Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning Planning Group-Enroute Group-Enroute 1 2 Group Traverse Group Wait [405,486] 6 Ask(PATH1=OK) Group Traverse Ask(PATH2=OK) [405,486] 7 [450,540] Science Target 8 11 Ask(PROCEED) 9 10 [0,54] Group Transmit [0,2] 12 [0, ] 1 3 To Plan: Instantiate Group-Enroute
18 s [0, ] 3 Planning Group-Enroute 1 2 Group Traverse Group Wait 4 5 [405,486] 6 Ask(PATH1=OK) Group Traverse Ask(PATH2=OK) [405,486] Group-Enroute 7 [500,800] [450,540] Science Target 8 11 Ask(PROCEED) 9 10 [0,54] Group Transmit [0,2] 12 [0, ] 1 3 [0, ] e Tell(PATH1=OK) Tell(PROCEED) [10,10] [0, ] [450,450] [200,200] To Plan: Instantiate Group-Enroute Add External Constraints (Tells) s [0, ] 3 Generates Schedulable Plan 1 2 Group Traverse Group Wait 4 5 [405,486] 6 Ask(PATH1=OK) Group Traverse Ask(PATH2=OK) [405,486] Group-Enroute 7 [500,800] [450,540] Science Target 8 11 Ask(PROCEED) 9 10 [0,54] Group Transmit [0,2] 12 [0, ] 13 [0, ] e Tell(PATH1=OK) Tell(PROCEED) [10,10] [0, ] [450,450] [200,200] To Plan: Instantiate Group-Enroute Add External Constraints Trace consistent trajectories Check Schedulability Satisfy and Protect Asks
19 Planning Example Find paths from start-node to end-node Start End Planning Example Not a decision-node: Follow all outarcs Start End
20 Planning Example Not a decision-node: Follow all outarcs Start End Planning Example Not a decision-node: Follow all outarcs Start End
21 Planning Example Decision-node: Select a single outarc Start End Planning Example Not a decision-node: Follow all outarcs Start End
22 Planning Example Continue Start End Planning Example Not a decision-node: Follow all outarcs Start End
23 Planning Example Continue Start End Planning Example Start End
24 Temporal Constraint Consistency Don t test consistency at each step. Only when a path induces a cycle, check for negative cycle in the STN distance graph [18,20] 1 2 [4,6] [15,16] [2,3] [3,8] [0, ] [5,5] Temporal Constraint Consistency Example: Inconsistent [18,20] 1 2 [4,6] [15,16] [2,3] [3,8] [0, ] [5,5]
25 Temporal Constraint Consistency Backtrack to choice [18,20] 1 2 [4,6] [15,16] [2,3] [12,13] [3,8] [0, ] [5,5] Temporal Constraint Consistency Complete paths [18,20] 1 2 [4,6] [15,16] [2,3] [12,13] [3,8] [0, ] [5,5]
26 s [0, ] 3 How Do We Handle Asks? 1 2 Group Traverse Group Wait 4 5 [405,486] 6 Ask(PATH1=OK) Group Traverse Ask(PATH2=OK) [405,486] Group-Enroute 7 [500,800] [450,540] Science Target 8 11 Ask(PROCEED) 9 10 [0,54] Group Transmit [0,2] 12 [0, ] 1 3 [0, ] e Tell(PATH1=OK) Tell(PROCEED) [10,10] [0, ] [450,450] [200,200] Unconditional Planning: Guarantee satisfaction at compile time. Treatment similar to causal-link planning Satisfying Asks Compute bounds on activities. Link ask to equivalent, overlapping tell. Constrain tell to contain ask. [4,6] [5,8] [7,11] ask(c) [4,6} 5 6 [8,11] [4,6] [6,9] tell(c) [7,10]
27 Avoiding Threats Identify overlapping Inconsistent activities. [4,6] [5,8] [7,11] tell(c) [4,6] 5 6 [8,11] [4,6] [6,9] tell( c) [7,10] Symbolic Constraint Consistency Promote or demote [4,6] [5,8] [7,9] tell(c) [4,6] 5 [0,inf] 6 [8,11] [4,6] [7,9] tell( c) [7,10]
28 Outline Cooperative Vehicle Missions Model-based Programming Reactive Model-based Programming Language (RMPL) Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning How do we optimally select activities and paths? Current Research: Perform global path planning using Rapidly-exploring Random Trees (RRTs) (la Valle). Search for globally optimal plan by unifying TPN & RRT graphs, and by searching hybrid graph best first. Refine plan using receding horizon control based on CLP (Krishnan, Williams), or MILP (How) or hybrid maneuver automata (Frazzoli, Dahleh, Feron).
29 Enroute Activity: Closer look at Group Traverse sub-activity 1 Enroute [450,540] 2 Group Traverse Group Wait 4 [405, 486] 5 9 [0, 54] 10 Ask( PATH1 = OK) Science Target Ask( PROCEED) 3 Group Traverse 8 Group Transmit [0, ] 13 6 [405, 486] 7 11 [0, 2] 12 Ask( PATH2 = OK) Traverse to Science Target Group Traverse sub-activity: Traverse through way points to science target Group Traverse [405, 486] 4 5 Ask( PATH2 = OK) 3 8 Group Traverse [405, 486] 6 7 Ask( PATH2 = OK)
30 Group Traverse sub-activity: One obstacle between nodes 4 and 5 Two Obstacles between nodes 6 and 7 Obstacle Obstacle Obstacle 6 7 Group Traverse sub-activity: Non-explicit representations of obstacles obtained from an incremental collision detection algorithm
31 RRT: Example Path Path RRT: Example Planner considers rovers taking Path 1: x init 4 Path 1 5 x goal 3 8 Path 2 6 7
32 RRT: Example Path 1 x init x goal 4 X obs 5 RRT: Example Path 1 x init x goal 4 X obs 5
33 RRT: Example Path 1 x init x goal 4 X obs 5 RRT: Example Path 1 x init x goal 4 X obs 5
34 RRT: Example Path 1 x init x goal 4 X obs 5 RRT: Example Path 1 x init x goal 4 X obs 5
35 RRT: Example Path 1 x init x goal 4 X obs 5 Common Node RRT: Example Path 1 x init x goal 4 X obs 5
36 RRT: Example Path 1 x init x goal 4 X obs 5 RRT: Example Path 1 x init x goal 4 X obs 5
37 Model-based Cooperative Programming Goal: Fast, mission-directed coordination of teams of vehicles acting in an uncertain environments. Solution: New middle ground between embedded programming, task decomposition execution, and temporal planning. Rich embedded language,rmpl, for describing complex concurrent team strategies extended to time and contingency. Kirk Interpreter looks for schedulable threads of execution before leaping to execution. Temporal Plan Network provides a flexible, temporal, graphbased planning paradigm built upon Simple Temporal Nets. Global optimality achieved by unifying activity planning and global kino-dynamic path planning.
Robust Task Execution: Procedural and Model-based. Outline. Desiderata: Robust Task-level Execution
Robust Task Execution: Procedural and Model-based Mission Goals and Environment Constraints Temporal Planner Temporal Network Solver Projective Task Expansion Initial Conditions Temporal Plan Dynamic Scheduling
More informationModel-based Programming of Cooperating Explorers
Model-based Programming of Cooperating Explorers Brian C. Williams CSAIL Dept. Aeronautics and Astronautics Massachusetts Institute of Technology Programming Long-lived Embedded Systems With Complex Autonomic
More informationThe Cooperative Cleaners Case Study: Modelling and Analysis in Real-Time ABS
: Modelling and Analysis in Real-Time ABS Silvia Lizeth Tapia Tarifa Precise Modelling and Analysis University of Oslo sltarifa@ifi.uio.no 29.11.2013 S. Lizeth Tapia Tarifa Outline Motivation 1 Motivation
More information#19 MONITORING AND PREDICTING PEDESTRIAN BEHAVIOR USING TRAFFIC CAMERAS
#19 MONITORING AND PREDICTING PEDESTRIAN BEHAVIOR USING TRAFFIC CAMERAS Final Research Report Luis E. Navarro-Serment, Ph.D. The Robotics Institute Carnegie Mellon University November 25, 2018. Disclaimer
More informationSystems Theoretic Process Analysis (STPA)
Systems Theoretic Process Analysis (STPA) 1 Systems approach to safety engineering (STAMP) STAMP Model Accidents are more than a chain of events, they involve complex dynamic processes. Treat accidents
More informationEnhancing Discrete Event Simulation by Integrating
Enhancing Discrete Event Simulation by Integrating Continuous Models Jane T. Malin Automation, Robotics and Simulation Division NASA Johnson Space Center Houston, TX 77258 malin@jsc.nasa.gov Land Fleming
More informationD-Case Modeling Guide for Target System
D-Case Modeling Guide for Target System 1/32 Table of Contents 1 Scope...4 2 Overview of D-Case and SysML Modeling Guide...4 2.1 Background and Purpose...4 2.2 Target System of Modeling Guide...5 2.3 Constitution
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Partially Observable MDP Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)
More information/435 Artificial Intelligence Fall 2015
Final Exam 600.335/435 Artificial Intelligence Fall 2015 Name: Section (335/435): Instructions Please be sure to write both your name and section in the space above! Some questions will be exclusive to
More informationAutonoVi-Sim: Modular Autonomous Vehicle Simulation Platform Supporting Diverse Vehicle Models, Sensor Configuration, and Traffic Conditions
AutonoVi-Sim: Modular Autonomous Vehicle Simulation Platform Supporting Diverse Vehicle Models, Sensor Configuration, and Traffic Conditions Andrew Best, Sahil Narang, Lucas Pasqualin, Daniel Barber, Dinesh
More informationSystems Theoretic Process Analysis (STPA)
Systems Theoretic Process Analysis (STPA) Systems approach to safety engineering (STAMP) STAMP Model (Leveson, 2012) Accidents are more than a chain of events, they involve complex dynamic processes. Treat
More informationLecturers. Multi-Agent Systems. Exercises: Dates. Lectures. Prof. Dr. Bernhard Nebel Room Dr. Felix Lindner Room
Lecturers Multi-Agent Systems Prof. Dr. Bernhard Nebel Room 52-00-028 Phone: 0761/203-8221 email: nebel@informatik.uni-freiburg.de Albert-Ludwigs-Universität Freiburg Dr. Felix Lindner Room 52-00-043 Phone:
More informationUsing STPA in the Design of a new Manned Spacecraft
Using STPA in the Design of a new Manned Spacecraft Japan Aerospace Exploration Agency (JAXA) Ryo Ujiie 1 Contents Abstract Purpose JAXA s Manned Spacecraft (CRV) JAXA s Experience of STPA STPA in CRV
More informationProblem Solving as Search - I
Problem Solving as Search - I Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Problem-Solving
More informationLecture 1 Temporal constraints: source and characterization
Real-Time Systems Lecture 1 Temporal constraints: source and characterization Basic concepts about real-time Requirements of Real-Time Systems Adapted from the slides developed by Prof. Luís Almeida for
More informationEfficient Gait Generation using Reinforcement Learning
Efficient Gait Generation using Reinforcement Learning Josep M Porta and Enric Celaya Institut de Robòtica i Informàtica Industrial, UPC-CSIC, Barcelona, Spain. SYNOPSIS The use of a free gait becomes
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Motion Planning: Introduction & Reactive Strategies Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)
More informationBetter Search Improved Uninformed Search CIS 32
Better Search Improved Uninformed Search CIS 32 Functionally PROJECT 1: Lunar Lander Game - Demo + Concept - Open-Ended: No One Solution - Menu of Point Options - Get Started NOW!!! - Demo After Spring
More informationThe Incremental Evolution of Gaits for Hexapod Robots
The Incremental Evolution of Gaits for Hexapod Robots Abstract Gait control programs for hexapod robots are learned by incremental evolution. The first increment is used to learn the activations required
More informationPlanning and Acting in Partially Observable Stochastic Domains
Planning and Acting in Partially Observable Stochastic Domains Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra (1998). Planning and Acting in Partially Observable Stochastic Domains,
More informationSoftware Engineering. M Umair.
Software Engineering M Umair www.m-umair.com Advantages of Agile Change is embraced With shorter planning cycles, it s easy to accommodate and accept changes at any time during the project. There is always
More informationBasic STPA Tutorial. John Thomas
Basic STPA Tutorial John Thomas How is STAMP different? STAMP Model (Leveson, 2003); (Leveson, 2011) Accidents are more than a chain of events, they involve complex dynamic processes. Treat accidents as
More informationYAN GU. Assistant Professor, University of Massachusetts Lowell. Frederick N. Andrews Fellowship, Graduate School, Purdue University ( )
YAN GU Assistant Professor, University of Massachusetts Lowell CONTACT INFORMATION 31 University Avenue Cumnock 4E Lowell, MA 01854 yan_gu@uml.edu 765-421-5092 http://www.locomotionandcontrolslab.com RESEARCH
More informationIntroduction. AI and Searching. Simple Example. Simple Example. Now a Bit Harder. From Hammersmith to King s Cross
Introduction AI and Searching We have seen how models of the environment allow an intelligent agent to dry run scenarios in its head without the need to act Logic allows premises to be tested Machine learning
More informationVisual Traffic Jam Analysis Based on Trajectory Data
Visual Traffic Jam Analysis Based on Trajectory Data Zuchao Wang, Min Lu, Xiaoru Yuan, Peking University Junping Zhang, Fudan University Huub van de Wetering, Technische Universiteit Eindhoven Introduction
More informationEngineering Risk Assessment of Space Thruster Challenge Problem
Engineering Risk Assessment of Space Thruster Challenge Problem Donovan L. Mathias *a, Christopher J. Mattenberger b, and Susie Go a a NASA Ames Research Center, Moffett Field, CA, USA b Science and Technology
More informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 3 Terminology review State: a representation of a possible configuration of our problem Action: -how our agent interacts with the problem -can be different depending on
More informationFirst Experimental investigations on Wheel- Walking for improving Triple-Bogie rover locomotion performances
First Experimental investigations on Wheel- Walking for improving Triple-Bogie rover locomotion performances M. Azkarate With the collaboration of ESA/TEC-MMA Table of Contents 2. The ExoTeR Rover: a Triple-Bogie
More informationEVOLVING HEXAPOD GAITS USING A CYCLIC GENETIC ALGORITHM
Evolving Hexapod Gaits Using a Cyclic Genetic Algorithm Page 1 of 7 EVOLVING HEXAPOD GAITS USING A CYCLIC GENETIC ALGORITHM GARY B. PARKER, DAVID W. BRAUN, AND INGO CYLIAX Department of Computer Science
More informationOnline Diagnosis of Engine Dyno Test Benches: A Possibilistic Approach
Online Diagnosis of Engine Dyno Test Benches: A Possibilistic Approach S. Boverie (d), D. Dubois (c), X. Guérandel (a), O. de Mouzon (b), H. Prade (c) Engine dyno diagnostic BEST project Bench Expert System
More informationBasic STPA Exercises. Dr. John Thomas
Basic STPA Exercises Dr. John Thomas Chemical Plant Goal: To produce and sell chemical X What (System): A chemical plant (production), How (Method): By means of a chemical reaction, a catalyst,. CATALYST
More informationOptimization and Search. Jim Tørresen Optimization and Search
Optimization and Search INF3490 - Biologically inspired computing Lecture 1: Marsland chapter 9.1, 9.4-9.6 2017 Optimization and Search Jim Tørresen 2 Optimization and Search Methods (selection) Optimization
More informationDesign and Evaluation of Adaptive Traffic Control System for Heterogeneous flow conditions
Design and Evaluation of Adaptive Traffic Control System for Heterogeneous flow conditions Tom Mathew IIT Bombay Outline 1. Heterogeneous traffic 2. Traffic Simulation 3. Traffic Signal control 4. Adaptive
More informationSearch I. Tuomas Sandholm Carnegie Mellon University Computer Science Department. [Read Russell & Norvig Chapter 3]
Search I Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Russell & Norvig Chapter 3] Search I Goal-based agent (problem solving agent) Goal formulation (from preferences).
More informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 7 Small examples 8-Queens: how to fit 8 queens on a 8x8 board so no 2 queens can capture each other Two ways to model this: Incremental = each action is to add a queen to
More informationMulticore Real-Time Scheduling
Multicore Real-Time Scheduling Bjorn Andersson and Dionisio de Niz Software Engineering Institute Carnegie Mellon University Pittsburgh, PA 15213 Copyright 2015 Carnegie Mellon University This material
More informationPrincess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department
Princess Nora University Faculty of Computer & Information Systems 1 ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART2) PROBLEM SOLVING AND SEARCH (Course coordinator) Searching
More informationSEARCH TREE. Generating the children of a node
SEARCH TREE Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children of a node Open: Closed:
More informationGait Evolution for a Hexapod Robot
Gait Evolution for a Hexapod Robot Karen Larochelle, Sarah Dashnaw, and Gary Parker Computer Science Connecticut College 270 Mohegan Avenue New London, CT 06320 @conncoll.edu Abstract
More informationPedestrian Behaviour Modelling
Pedestrian Behaviour Modelling An Application to Retail Movements using Genetic Algorithm Contents Requirements of pedestrian behaviour models Framework of a new model Test of shortest-path model Urban
More informationLOCOMOTION CONTROL CYCLES ADAPTED FOR DISABILITIES IN HEXAPOD ROBOTS
LOCOMOTION CONTROL CYCLES ADAPTED FOR DISABILITIES IN HEXAPOD ROBOTS GARY B. PARKER and INGO CYLIAX Department of Computer Science, Indiana University, Bloomington, IN 47405 gaparker@cs.indiana.edu, cyliax@cs.indiana.edu
More informationNATIONAL INSTRUMENTS AUTONOMOUS ROBOTICS COMPETITION Task and Rules Document
NATIONAL INSTRUMENTS AUTONOMOUS ROBOTICS COMPETITION 2018 2018 Task and Rules Document Table of Contents Competition Background:... 2 Theme: Autonomous Vehicles Fast Track to the Future... 2 Design Elements
More informationModel-based Adaptive Acoustic Sensing and Communication in the Deep Ocean with MOOS-IvP
Model-based Adaptive Acoustic Sensing and Communication in the Deep Ocean with MOOS-IvP Henrik Schmidt & Toby Schneider Laboratory for Autonomous Marine Sensing Systems Massachusetts Institute of technology
More informationApplication of Bayesian Networks to Shopping Assistance
Application of Bayesian Networks to Shopping Assistance Yang Xiang, Chenwen Ye, and Deborah Ann Stacey University of Guelph, CANADA Abstract. We develop an on-line shopping assistant that can help a e-shopper
More informationDesign and Evaluation of Adaptive Traffic Control System for Heterogeneous flow conditions. SiMTraM & CosCiCost2G
Design and Evaluation of Adaptive Traffic Control System for Heterogeneous flow conditions SiMTraM & CosCiCost2G Tom Mathew IIT Bombay Outline 1. Heterogeneous traffic 2. Traffic Simulation 3. Traffic
More informationPedestrian Dynamics: Models of Pedestrian Behaviour
Pedestrian Dynamics: Models of Pedestrian Behaviour John Ward 19 th January 2006 Contents Macro-scale sketch plan model Micro-scale agent based model for pedestrian movement Development of JPed Results
More informationFailure Detection in an Autonomous Underwater Vehicle
Failure Detection in an Autonomous Underwater Vehicle Alec Orrick, Make McDermott, Department of Mechanical Engineering David M. Barnett, Eric L. Nelson, Glen N. Williams, Department of Computer Science
More information(C) Anton Setzer 2003 (except for pictures) A2. Hazard Analysis
A2. Hazard Analysis In the following: Presentation of analytical techniques for identifyin hazards. Non-formal, but systematic methods. Tool support for all those techniques exist. Techniques developed
More informationCprE 288 Final Project Description
CprE 288 Final Project Description Parts of the Project: Communication with the VORTEX Manually Traversing Treacherous Terrain for Retrieval Positioning the Rover for Retrieval Code and Documentation Story
More informationPERCEPTIVE ROBOT MOVING IN 3D WORLD. D.E- Okhotsimsky, A.K. Platonov USSR
PERCEPTIVE ROBOT MOVING IN 3D WORLD D.E- Okhotsimsky, A.K. Platonov USSR Abstract. This paper reflects the state of development of multilevel control algorithms for a six-legged mobile robot. The robot
More informationbeestanbul RoboCup 3D Simulation League Team Description Paper 2012
beestanbul RoboCup 3D Simulation League Team Description Paper 2012 Baris Demirdelen, Berkay Toku, Onuralp Ulusoy, Tuna Sonmez, Kubra Ayvaz, Elif Senyurek, and Sanem Sariel-Talay Artificial Intelligence
More informationPerforming Hazard Analysis on Complex, Software- and Human-Intensive Systems
Performing Hazard Analysis on Complex, Software- and Human-Intensive Systems J. Thomas, S.M.; Massachusetts Institute of Technology; Cambridge, Massachusetts, USA N. G. Leveson Ph.D.; Massachusetts Institute
More informationLearning of Cooperative actions in multi-agent systems: a case study of pass play in Soccer Hitoshi Matsubara, Itsuki Noda and Kazuo Hiraki
From: AAAI Technical Report SS-96-01. Compilation copyright 1996, AAAI (www.aaai.org). All rights reserved. Learning of Cooperative actions in multi-agent systems: a case study of pass play in Soccer Hitoshi
More informationProblem Solving Agents
Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest path from one city to another 8-puzzle Problem
More informationSTAMP/STPA Beginner Introduction. Dr. John Thomas System Engineering Research Laboratory Massachusetts Institute of Technology
STAMP/STPA Beginner Introduction Dr. John Thomas System Engineering Research Laboratory Massachusetts Institute of Technology Agenda Beginner Introduction What problems are we solving? How does STAMP/STPA
More informationA SEMI-PRESSURE-DRIVEN APPROACH TO RELIABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS
A SEMI-PRESSURE-DRIVEN APPROACH TO RELIABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS S. S. OZGER PhD Student, Dept. of Civil and Envir. Engrg., Arizona State Univ., 85287, Tempe, AZ, US Phone: +1-480-965-3589
More information6.034 Artificial Intelligence
Massachusetts Institute of Technology 6.034 Artificial Intelligence Examination Solutions # 1 Problem 1 Enforcing the Rules on Wall Street (30 points) Part A (12 points) Worksheet Initial Database Joe
More informationGOLOMB Compression Technique For FPGA Configuration
GOLOMB Compression Technique For FPGA Configuration P.Hema Assistant Professor,EEE Jay Shriram Group Of Institutions ABSTRACT Bit stream compression is important in reconfigurable system design since it
More informationBreaking Up is Hard to Do: An Investigation of Decomposition for Assume-Guarantee Reasoning
Breaking Up is Hard to Do: An Investigation of Decomposition for Assume-Guarantee Reasoning Jamieson M. Cobleigh Dept. of Computer Science University of Massachusetts Amherst, MA 01003, USA jcobleig@cs.umass.edu
More informationSEARCH SEARCH TREE. Node: State in state tree. Root node: Top of state tree
Page 1 Page 1 Page 2 SEARCH TREE SEARCH Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children
More informationUNDERWATER DRONES CONTROL TOWER UNDERWATER DRONES CONTROL TOWER
UNDERWATER DRONES CONTROL TOWER UNDERWATER DRONES CONTROL TOWER Adnan Tahirovic - Kemal Delic ARCHITECTURE, DESIGN, ENGINEERING Talk outline - why and how uwr is important? Underwater World Explained Technology
More informationApplication of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs
Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs Jehyun Cho a, Ghang Lee a, Jongsung Won a and Eunseo Ryu a a Dept. of Architectural Engineering, University of Yonsei,
More informationCOLREGS Based Collision Avoidance of Unmanned Surface Vehicles
COLREGS Based Collision Avoidance of Unmanned Surface Vehicles Aug 2nd, 2017 Michael R. Benjamin Kyle Woerner, Michael Novitzky, John Leonard MIT Dept. of Mechanical Engineering Computer Science and Artificial
More informationOcean Fishing Fleet Scheduling Path Optimization Model Research. Based On Improved Ant Colony Algorithm
4th International Conference on Sensors, Measurement and Intelligent Materials (ICSMIM 205) Ocean Fishing Fleet Scheduling Path Optimization Model Research Based On Improved Ant Colony Algorithm Li Jia-lin2,
More informationCENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)
CENG 466 Artificial Intelligence Lecture 4 Solving Problems by Searching (II) Topics Search Categories Breadth First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening
More informationHazard analysis. István Majzik Budapest University of Technology and Economics Dept. of Measurement and Information Systems
Hazard analysis István Majzik Budapest University of Technology and Economics Dept. of Measurement and Information Systems Hazard analysis Goal: Analysis of the fault effects and the evolution of hazards
More informationSolving Problems by Searching chap3 1. Problem-Solving Agents
Chapter3 Solving Problems by Searching 20070315 chap3 1 Problem-Solving Agents Reflex agents cannot work well in those environments - state/action mapping too large - take too long to learn Problem-solving
More informationDynamically stepping over large obstacle utilizing PSO optimization in the B4LC system
1 Dynamically stepping over large obstacle utilizing PSO optimization in the B4LC system QI LIU, JIE ZHAO, KARSTEN BERNS Robotics Research Lab, University of Kaiserslautern, Kaiserslautern, 67655, Germany
More informationIntroducing STAMP in Road Tunnel Safety
Introducing STAMP in Road Tunnel Safety Kostis Kazaras National Technical University of Athens, Mechanical Engineering School, Greece Contact details: kkazaras@gmail.com kkaz@central.ntua.gr Problem illustration
More informationAN AUTONOMOUS DRIVER MODEL FOR THE OVERTAKING MANEUVER FOR USE IN MICROSCOPIC TRAFFIC SIMULATION
AN AUTONOMOUS DRIVER MODEL FOR THE OVERTAKING MANEUVER FOR USE IN MICROSCOPIC TRAFFIC SIMULATION OMAR AHMAD oahmad@nads-sc.uiowa.edu YIANNIS E. PAPELIS yiannis@nads-sc.uiowa.edu National Advanced Driving
More informationAuthor s Name Name of the Paper Session. Positioning Committee. Marine Technology Society. DYNAMIC POSITIONING CONFERENCE September 18-19, 2001
Author s Name Name of the Paper Session PDynamic Positioning Committee Marine Technology Society DYNAMIC POSITIONING CONFERENCE September 18-19, 2001 POWER PLANT SESSION A New Concept for Fuel Tight DP
More informationThis course will deal with Locomotion and Navigation that includes:
1 Key Concepts in Autonomous Mobile Robotics The three key questions in Mobile Robotics Where am I? Where am I going? How do I get there? 1 - Introduction? To answer these questions the robot has to have
More informationTransit Signal Preemption and Priority Treatments
Transit Signal Preemption and Priority Treatments Peter Koonce, PE Portland, OR Today s Message Transit signal priority presents an opportunity to partner with an agency that isn t always recognized as
More informationKochi University of Technology Aca Study on Dynamic Analysis and Wea Title stem for Golf Swing Author(s) LI, Zhiwei Citation 高知工科大学, 博士論文. Date of 2015-03 issue URL http://hdl.handle.net/10173/1281 Rights
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Differential Kinematics, Probabilistic Roadmaps Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)
More informationRole of Simulation Assisted Risk Assessment in Abort Trigger Recommendations
Role of Simulation Assisted Risk Assessment in Abort Trigger Recommendations T. Manning a*, S. Lawrence a, D. Mathias a, H. Nejad b, K. Gee a, B. Ramamurthy c, and P. Gage d a NASA Ames Research Center,
More informationA Distributed Control System using CAN bus for an AUV
International Conference on Information Sciences, Machinery, Materials and Energy (ICISMME 2015) A Distributed Control System using CAN bus for an AUV Wenbao Geng a, Yu Huang b, Peng Lu c No. 710 R&D Institute,
More informationthe world s most advanced humanoid robot
the world s most advanced humanoid robot 02 : ASIMO V2 : TECHNICAL GUIDE : ROBOT DEVELOPMENT : CONTENTS ROBOT DEVELOPMENT 3 HISTORY OF HUMANOIDS 5 ASIMO v1 7 ASIMO v2 16 THE FUTURE 18 Creating New Mobility
More informationMWGen: A Mini World Generator
MWGen: A Mini World Generator Jianqiu Xu and Ralf Hartmut Güting Database Systems for New Applications, Mathematics and Computer Science FernUniversität in Hagen, Germany July, 2012 Outline 1 Problem Description
More informationCS 4649/7649 Robot Intelligence: Planning
CS 4649/7649 Robot Intelligence: Planning Roadmap Approaches Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1 *Slides
More informationEvolving Cyclic Control for a Hexapod Robot Performing Area Coverage
Evolving Cyclic Control for a Hexapod Robot Performing Area Coverage Gary B. Parker Department of Computer Science Connecticut College New London, CT 06320 parker@conncoll.edu Abstract For a robot to search
More informationReal-Time & Embedded Systems
Real-Time & Embedded Systems Agenda Safety Critical Systems Project 6 continued Safety Critical Systems Safe enough looks different at 35,000 feet. Bruce Powell Douglass The Air Force has a perfect operating
More informationSTPA Systems Theoretic Process Analysis John Thomas and Nancy Leveson. All rights reserved.
STPA Systems Theoretic Process Analysis 1 Agenda Quick review of hazard analysis Quick review of STAMP Intro to STPA hazard analysis 2 Hazard Analysis vs. Accident Model Dates back to Hazard Analysis Method
More informationTHE CANDU 9 DISTRffiUTED CONTROL SYSTEM DESIGN PROCESS
THE CANDU 9 DISTRffiUTED CONTROL SYSTEM DESIGN PROCESS J.E. HARBER, M.K. KATTAN Atomic Energy of Canada Limited 2251 Speakman Drive, Mississauga, Ont., L5K 1B2 CA9900006 and M.J. MACBETH Institute for
More informationThree Approaches to Safety Engineering. Civil Aviation Nuclear Power Defense
Three Approaches to Safety Engineering Civil Aviation Nuclear Power Defense Civil Aviation Fly-fix-fly: analysis of accidents and feedback of experience to design and operation Fault Hazard Analysis: Trace
More informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before the lecture Report and programming
More informationSpider Robot for Motion with Quasistatic. Force Constraints
Spider Robot for Motion with Quasistatic Force Constraints Shraga Shoval, Elon Rimon and Amir Shapira Technion - Israel Institute of Technology - Haifa, Israel 32000. Abstract In quasistatic motions the
More information4. Hazard Analysis. Limitations of Formal Methods. Need for Hazard Analysis. Limitations of Formal Methods
4. Hazard Analysis We have seen limitations of formal verification of computer systems. Formal methods don t take into consideration hardware aspects. E.g. that the wires in a railway signalling system
More informationAdaptability and Fault Tolerance
Adaptability and Fault Tolerance Rogério de Lemos University of Kent, UK Context: self-* and dependability; Focus: adaptability and fault tolerance; State of the art; Conclusions; Rogério de Lemos ICSE
More informationPlanning. CS 510: Intro to AI October 19 th 2017
Planning CS 510: Intro to AI October 19 th 2017 By: Janith Weerasinghe (bnw37@drexel.edu) Content based on slides from: Rachel Greenstadt & Chris Geib My Background Using planning and plan recognition
More informationG53CLP Constraint Logic Programming
G53CLP Constraint Logic Programming Dr Rong Qu Basic Search Strategies CP Techniques Constraint propagation* Basic search strategies Look back, look ahead Search orders B & B *So far what we ve seen is
More informationRescue Rover. Robotics Unit Lesson 1. Overview
Robotics Unit Lesson 1 Overview In this challenge students will be presented with a real world rescue scenario. The students will need to design and build a prototype of an autonomous vehicle to drive
More informationArtificial Intelligence for the EChO Mission Scheduler
Artificial Intelligence for the EChO Mission Scheduler Álvaro García Piquer Ignasi Ribas Josep Colomé Institute of Space Sciences (CSIC/IEEC), Barcelona, Spain SCIOPS 2013 September 10 13, 2013 Introduction
More informationThe system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.
Computer Algorithms in Systems Engineering Spring 2010 Problem Set 6: Building ventilation design (dynamic programming) Due: 12 noon, Wednesday, April 21, 2010 Problem statement Buildings require exhaust
More informationDevelopment and Application of Transit Signal Priority Implementation Guidelines - A Proven Process
Development and Application of Transit Signal Priority Implementation Guidelines - A Proven Process Ron Stewart, P. Eng. Associate Director IBI Group, 230 Richmond Street West, 5 th Floor Toronto, ON M5V
More informationWARM GAS PROPULSION FOR SMALL SATELLITES. J. R. French Propulsion Development Associates, Inc. ~1AlN HOUSING CATALY5THOUSP.\G C AT.
The purpose of this activity is to quickly develop miniature warm gas thruster technology for application to next generation micro satellite systems and to provide an industrial source for this technology.
More informationTransformer fault diagnosis using Dissolved Gas Analysis technology and Bayesian networks
Proceedings of the 4th International Conference on Systems and Control, Sousse, Tunisia, April 28-30, 2015 TuCA.2 Transformer fault diagnosis using Dissolved Gas Analysis technology and Bayesian networks
More informationTennis Plots: Game, Set, and Match
Tennis Plots: Game, Set, and Match Michael Burch and Daniel Weiskopf Visualization Research Center, University of Stuttgart, Allmandring 19, 70569 Stuttgart {michael.burch,daniel.weiskopf}@visus.uni-stuttgart.de
More informationPetacat: Applying ideas from Copycat to image understanding
Petacat: Applying ideas from Copycat to image understanding How Streetscenes Works (Bileschi, 2006) 1. Densely tile the image with windows of different sizes. 2. HMAX C2 features are computed in each window.
More informationunsignalized signalized isolated coordinated Intersections roundabouts Highway Capacity Manual level of service control delay
Whether unsignalized or signalized, isolated or coordinated, you can use TransModeler to simulate intersections with greater detail and accuracy than any other microsimulation software. TransModeler allows
More information