Robust Task Execution: Procedural and Model-based. Outline. Desiderata: Robust Task-level Execution
|
|
- Shannon Tate
- 6 years ago
- Views:
Transcription
1 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 and Task Dispatch Task Dispatch Modes Goals Brian C. Williams.J/.J March th, 00 Model-based Executive Observations Commands Robust Task Expansion Desiderata: Robust Task-level Execution Outline Create Languages that are: Suspicious Monitor intentions and plans Self-Adaptive Exploits and generates contingencies Anticipatory Predicts, plans and verifies into future State Aware Commanded with desired state Fault Aware Reasons about and responds to failure Obs Model-based Embedded Programs S Model Continuous Continuous Mode/State Reactive Estimation Commanding S Plant Cntrl Safe Procedural Execution Model-Predictive Dispatch Model-based Reactive Planning Robust Task Execution: RAPS [Firby PhD] RAPS Monitors Success Against Spec (define-rap (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 t)) (t (pickup thing)((truck -HOLDING thing) for t) ((TRUCK -HOLDING thing) for t)) (t (goto place) ((TRUCK-LOCATION place) for t)) (t (putdown thing)))) (method (context (LOCATION thing UNKNOWN)) (task-net (t0 (goto WAREHOUSE))))) Robust Task Execution: RAPS [Firby PhD] RAPS Exploits contingencies by performing functionally redundant method selection (define-rap (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 t)) (t (pickup thing)((truck -HOLDING thing) for t) ((TRUCK -HOLDING thing) for t)) (t (goto place) ((TRUCK-LOCATION place) for t)) (t (putdown thing)))) (method (context (LOCATION thing UNKNOWN)) (task-net (t0 (goto WAREHOUSE)))))
2 HOME Landing Site: ABC Landing Site: XYZ T O W N O E COLLECTION POINT Enroute SCIENCE AREA RENDEZVOUS SCIENCE AREA Diverge SCIENCE AREA Robust Task Execution: RAPS [Firby PhD] 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 to deal with contingencies and opportunities. Methods selected reactively Model -predictive dispatch Goals explicitly observable and controllable Model -based execution RMPL Model-based Program Kirk Model-based Executive Control Program Selects consistent Executes concurrently threads of activity Preempts non -deterministic choice Control from redundant Sequencer methods A[l,u ] timing Schedules and Dispatches A at l location Activities Dynamically Environment Model location estimates location goals Tracks Estimation location Executive pre-plans activities Observations pre-plans paths dynamically schedules [Tsmardinos et al.] Finds least Reconfiguration cost paths Mode Mode Deductive Controller Plant Commands Outline Safe Procedural Execution Model-Predictive Dispatch Model-based Programming Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning Model-based Reactive Planning Example: Cooperative Mars Exploration How do we coordinate heterogeneous teams of orbiters, rovers and air vehicles to perform globally optimal science exploration? Example: Cooperative Mars Exploration Reactive Model-based Programming HOME Landing Site: ABC Landing Site: XYZ TWO ONE COLLECTION POINTEnroute SCIENCE AREA RENDEZVOUS Diverge SCIENCE AREA 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 Properties: SCIENCE AREA 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. Selected contingencies must respect timing constraints. Add temporal constraints: A [l,u] Timing Add choice (non-deterministic or decision-theoretic): Choose A, B Contingency
3 Example Enroute Activity: Rendezvous Enroute Corridor Corridor Rescue Area RMPL for Group-Enroute choose Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED RMPL for Group-Enroute RMPL for Group-Enroute Activities: choose Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED Conditionality and Preemption: choose Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED RMPL for Group-Enroute Sequentiality: choose Concurrency : Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED RMPL for Group-Enroute Temporal Constraints: choose Group-Fly-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Fly-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED
4 RMPL for Group-Enroute Non-deterministic choice: choose Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK, Group-Traverse-Path(PATH_,PATH_,PATH_,RE_POS)[l*90%,u*90%]; maintaining PATH_OK ; Group-Transmit(OPS,ARRIVED)[0,], Group-Wait(HOLD,HOLD)[0,u*0%] watching PROCEED Model-Predictive Dispatch for RMPL How do we provide fast, temporally flexible planning for contingent method selection? Graph-based planners support fast planning. but plans are totally order. Desire flexible plans based on simple temporal networks (e.g., Constrain-based Interval Planning). How do we create temporally flexible plan graphs? Augment simple temporal networks with activities & choice. temporal plan network TPN). Model-Predictive Dispatch for RMPL Outline Reactive Model -based Programming Language RMPL Compiler Temporal Plan Network (TPN) with STN Reactive Temporal Planner Concurrent Plan Represents all RMPL executions Selects schedulable execution threads of TPN Plan = Execution threads related by Simple Temporal Net Safe Procedural Execution Model-Predictive Dispatch Model-based Programming Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning Model-based Reactive Planning Enroute Activity: with flexible plan representation Enroute Activity: with flexible plan representation Enroute Enroute [0,0] 9 0 [0, ] [0, ] Group Transmit Group Transmit [0, ] [0, ] Activity (or sub-activity) Activity (or sub-activity) Duration (temporal constraint)
5 Enroute Activity: Add conditional nodes Enroute Activity: Add temporally extended, symbolic constraints Enroute [0,0] Enroute [0,0] [0, ] [0, ] [0, ] [0, ] 9 0 Ask( PATH = OK) Ask( EXPLORE = OK) Group Transmit [0, ] Group Transmit [0, ] [0, ] [0, ] [0, ] [0, ] Ask( PATH = OK) Activity (or sub-activity) Duration (temporal constraint) Conditional node Activity (or sub-activity) Duration (temporal constraint) Conditional node Symbolic constraint (Ask,Tell) Outline Safe Procedural Execution Model-Predictive Dispatch Model-based Programming Temporal Plan Networks (TPN) Activity Planning (Kirk) Unifying Activity and Path Planning Model-based Reactive Planning Planning Group-Enroute Group-Enroute [0,0] Ask(PATH=OK) Ask(PROCEED) [0,] Ask(PATH=OK) [0,] 9 0 [0,] Group Transmit [0, ] [0,] To Plan: Instantiate Group-Enroute Planning Group-Enroute Generates Schedulable Plan Group-Enroute [00,00] s [0, ] [0, ] [0,0] Ask(PATH=OK) Ask(PROCEED) [0,] Ask(PATH=OK) [0,] 9 0 [0,] Group Transmit [0, ] [0,] e Ask(PATH=OK) [0,] Ask(PATH=OK) [0,] Group-Enroute [00,00] s [0, ] [0, ] [0,0] Ask(PROCEED) 9 0 [0,] Group Transmit [0,] [0, ] e Tell(PATH=OK) Tell(PROCEED) [0,0] [0, ] [00,00] [0,0] To Plan: Instantiate Group-Enroute Add External Constraints (Tells) Tell(PATH=OK) Tell(PROCEED) [0,0] [0, ] [0,0] [00,00] To Plan: Instantiate Group-Enroute Add External Constraints Check Schedulability Satisfy and Protect Asks
6 Find paths from start-node to end-node Not a decision-node: Follow all outarcs Not a decision-node: Follow all outarcs Not a decision-node: Follow all outarcs Decision-node: Select a single outarc Not a decision-node: Follow all outarcs
7 Continue Not a decision-node: Follow all outarcs Continue Check Schedulability Don t test consistency at each step. Only when a path induces a cycle, check for negative cycle in the STN distance graph Example: Inconsistent Check Schedulability [,0] [,0] [,] [ 0,0] [,] [ 0,0] [ 0,0] [ 0,0] [,] [,] [,] [ 0,0] [ 0,0] [ 0,0] [,] [,] [0, ] [,] [,] [0, ] [,]
8 Trace Alternative Trajectories Backtrack to choice Complete paths Trace Alternative Trajectories [,0] [,] [,] [,] [,] [,] [0, ] [,] [,0] [,] [,] [,] [,] [,] [0, ] [,] How Do We Handle Asks? Group-Enroute [00,00] s e [0, ] [0, ] [0,0] Ask(PATH=OK) Ask(PROCEED) [0,] Ask(PATH=OK) [0,] 9 0 [0,] Group Transmit [0, ] [0,] Tell(PATH=OK) Tell(PROCEED) [0,0] [0, ] [0,0] [00,00] Unconditional planning approach: Guarantee satisfaction of asks 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. [,] [,] [,] ask(c) [,] [,] tell(c) [,] [,9] [,0] Avoiding Threats Identify overlapping Inconsistent activities. Symbolic Constraint Consistency Promote or demote [,] [,] [,] tell(c) [,] [,] [,9] tell(c) [0,inf] [,] [,] [,] [,] [,] tell( c) [,9] [,0] [,] tell( c) [,9] [,0]
9 How do we optimally select activities and paths? Enroute Activity: Closer look at sub-activity Enroute [0,0] Background: Can perform global path planning using Rapidly -exploring Random Trees (RRTs) (la Valle). Approach:. Search for globally optimal activity and path plan by unifying TPN & RRT graphs, and by searching hybrid graph best first.. Refine plan using receding horizon control. [0, ] [0, ] 9 Ask( PATH = OK) Ask( PROCEED) 0 Group Transmit [0, ] [0, ] [0, ] Ask( PATH = OK) Traverse to sub-activity: Traverse through way points to science target [0, ] sub-activity: One obstacle between nodes and Two Obstacles between nodes and Obstacle Ask( PATH = OK) Obstacle Obstacle [0, ] Ask( PATH = OK) sub-activity: Non-explicit representations of obstacles obtained from an increment al collision detection algorithm Path Path 9
10 Planner considers rovers taking Path : Path Path x goal Path Path Path Path Path 0
11 RRT:Example RRT:Example Path Path Common Node RRT:Example RRT:Example Path Path RRT:Example Path Model-Predictive Dispatch Goal: Fast, robust, temporal execution with contingencies, in an uncertain environments. Solution: Model-predictive Dispatch, a middle ground between non-deterministic programming 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.
Prof. Brian C. Williams February 23 rd, /6.834 Cognitive Robotics. based on [Kim,Williams & Abramson, IJCAI01] Outline
Executing Model-based Programs Using Graph-based Temporal Planning Prof. Brian C. Williams February 23 rd, 2004 16.412/6.834 Cognitive Robotics based on [Kim,Williams & Abramson, IJCAI01] Outline Model-based
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework 1 Access through the course web page http://www.cs.pitt.edu/~milos/courses/cs2710/ Two
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 informationUninformed search methods II.
CS 2710 Foundations of AI Lecture 4 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before
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 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 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 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 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 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 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 informationUninformed search methods II.
CS 1571 Introduction to AI Lecture 5 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Uninformed methods Uninformed search methods use only information available in
More informationA Proof-Producing CSP Solver 1
A Proof-Producing CSP Solver 1 Michael Veksler Ofer Strichman Technion - Israel Institute of Technology CSP SAT June 18, 2011 1 Originally presented at AAAI 10 Introduction CSP proofs It is easy to validate
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 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 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 informationUninformed Search Strategies
Uninformed Search Strategies Instructor: Dr. Wei Ding Fall 2010 1 Uninformed Search Strategies Also called blind search. Have no additional information about states beyond that provided in the problem
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 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 informationFlutter Testing. Wind Tunnel Testing (excerpts from Reference 1)
Flutter Testing In the early years of aviation, no formal flutter testing of aircraft was performed. Flutter was usually discovered by accident during flight of the aircraft. The pilot flew the aircraft
More informationAllocation of referees, hours and pistes User manual of Engarde - August, 2013
Allocation of referees, hours and pistes User manual of Engarde - August, 2013 Introduction 1. Launching the advanced allocation of referees 1.1. Poules 1.2. Tableaux 2. The advanced allocation window
More informationCSE 3401: Intro to AI & LP Uninformed Search II
CSE 3401: Intro to AI & LP Uninformed Search II Required Readings: R & N Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea }, {Zerind,
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 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 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 informationHazard Identification
Hazard Identification Most important stage of Risk Assessment Process 35+ Techniques Quantitative / Qualitative Failure Modes and Effects Analysis FMEA Energy Analysis Hazard and Operability Studies HAZOP
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 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 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 informationLECTUR 10 CHARACTERISTICS OF THE DRIVER, THE PEDESTRIAN, THE VEHICLE AND THE ROAD. One problem that faces traffic and transportation engineers is:
LECTUR 10 CHARACTERISTICS OF THE DRIVER, THE PEDESTRIAN, THE VEHICLE AND THE ROAD 3.1 DRIVER CHARACTERISTICS Physiological Measurable and Usually Quantifiable Psychological Much more difficult to measure
More informationFraglets: Chemical Programming with a Packet Prefix Language
Fraglets: Chemical Programming with a Packet Prefix Language Thomas Meyer and Christian Tschudin Computer Science Department, University of Basel, Switzerland 15. Kolloquium Programmiersprachen und Grundlagen
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 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 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 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 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 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 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 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 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 informationCHAPTER 1 INTRODUCTION TO RELIABILITY
i CHAPTER 1 INTRODUCTION TO RELIABILITY ii CHAPTER-1 INTRODUCTION 1.1 Introduction: In the present scenario of global competition and liberalization, it is imperative that Indian industries become fully
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 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 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 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 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 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 informationRepresentation. Representation. Representation. Representation. 8 puzzle.
You have a 3-liter jug and a 4-liter jug, and need to measure out exactly two liters of water. the jugs do not have any measurement lines you don't have any additional containers 8 puzzle. Measuring water.
More informationLaunch Vehicle Performance Estimation:
Launch Vehicle Performance Estimation: John Schilling john.schilling@alumni.usc.edu (661) 718-0955 3 December 2009 Precise determination of launch vehicle performance typically requires the use of three-
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 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 informationMaximum CPU utilization is obtained by multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait
Chapter 5: CPU Scheduling Basic Concepts Maximum CPU utilization is obtained by multiprogramming CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait Burst access CPU
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 informationEastern PA Trail Summit October 1, 2018
Eastern PA Trail Summit October 1, 2018 WHO WE ARE + WHY + WE RE * HERE * * * * * * Session Goals: Discuss how to coordinate planning and design in small, urbanized towns Consider how to develop alternative
More informationCSE 3402: Intro to Artificial Intelligence Uninformed Search II
CSE 3402: Intro to Artificial Intelligence Uninformed Search II Required Readings: Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea },
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 informationGenerating None-Plans in Order to Find Plans 1
Generating None-Plans in Order to Find Plans 1 Wojciech Penczek a joint work with Michał Knapik and Artur Niewiadomski Institute of Computer Sciences, PAS, Warsaw, and Siedlce University, Poland MINI PW,
More informationIntelligent Decision Making Framework for Ship Collision Avoidance based on COLREGs
Intelligent Decision Making Framework for Ship Collision Avoidance based on COLREGs Seminar Trondheim June 15th 2017 Nordic Institute of Navigation Norwegian Forum for Autonomous Ships SINTEF Ocean, Trondheim
More informationDepth-bounded Discrepancy Search
Depth-bounded Discrepancy Search Toby Walsh* APES Group, Department of Computer Science University of Strathclyde, Glasgow Gl 1XL. Scotland tw@cs.strath.ac.uk Abstract Many search trees are impractically
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 informationCEPA Initiative: Response Time Guideline 2015 EMERGENCY SECURITY MANAGEMENT WORK GROUP
CEPA Initiative: Response Time Guideline 2015 EMERGENCY SECURITY MANAGEMENT WORK GROUP Response Time Guideline aboutpipelines.com 1 of 8 Contents Table of Contents 1.0 Background 3 Purpose 3 Scope 3 Definitions
More informationCycling and risk. Cycle facilities and risk management
Cycling and risk Cycle facilities and risk management Failure to recognize possibilities is the most dangerous and common mistake one can make. Mae Jemison, astronaut 6/11/2010 York Regional Council Cycling
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 informationMathematics of Planet Earth Managing Traffic Flow On Urban Road Networks
Mathematics of Planet Earth Managing Traffic Flow On Urban Road Networks Adrian George Manager Network Improvements Anthony Fitts Manager Signal Design Melbourne s transport demands are growing 5m people
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 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 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 informationBulgarian Olympiad in Informatics: Excellence over a Long Period of Time
Olympiads in Informatics, 2017, Vol. 11, 151 158 2017 IOI, Vilnius University DOI: 10.15388/ioi.2017.12 151 Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time Emil KELEVEDJIEV 1,
More informationTechnical note. 1. Introduction
Project: A428 study - Phase 2 To: Adrian Shepherd Subject: Park & Ride site locations From: Atkins Date: Jun 3, 2016 cc: Ashley Heller 1. Introduction 1.1. Purpose of Technical Note The purpose of this
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 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 informationUNIVERSITY OF WATERLOO
UNIVERSITY OF WATERLOO Department of Chemical Engineering ChE 524 Process Control Laboratory Instruction Manual January, 2001 Revised: May, 2009 1 Experiment # 2 - Double Pipe Heat Exchanger Experimental
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 informationBasic CPM Calculations
Overview Core Scheduling Papers: #7 Basic CPM Calculations Time Analysis calculations in a Precedence Diagramming Method (PDM) Critical Path Method (CPM) network can be done in a number of different ways.
More informationWalking Gait Generation with Foot Placement Control for the HOAP-3 Humanoid Robot
Walking Gait Generation with Foot Placement Control for the HOAP-3 Humanoid Robot Yazhou Huang, Robert Backman and Marcelo Kallmann UCM School of Engineering Technical Report TR-2011-002 University of
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 informationBasketball Agent 101 Syllabus
Basketball Agent 101 Syllabus Course Description Examines the skills, tools and techniques needed to become a NBA sports agent; as well as an overview of the interconnected positions associated with the
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 information1.2 Example 1: A simple hydraulic system
Note: It is possible to use more than one fluid in the Hydraulic library. This is important because you can model combined cooling and lubrication systems of a library. The hydraulic library assumes a
More informationHAZARD ANALYSIS PROCESS FOR AUTONOMOUS VESSELS. AUTHORS: Osiris A. Valdez Banda Aalto University, Department of Applied Mechanics (Marine Technology)
HAZARD ANALYSIS PROCESS FOR AUTONOMOUS VESSELS AUTHORS: Osiris A. Valdez Banda Aalto University, Department of Applied Mechanics (Marine Technology) Sirpa Kannos NOVIA University of Applied Science Table
More informationSystem Operating Limit Definition and Exceedance Clarification
System Operating Limit Definition and Exceedance Clarification The NERC-defined term System Operating Limit (SOL) is used extensively in the NERC Reliability Standards; however, there is much confusion
More informationIndiana Traffic Signal Hi Resolution Data Logger Enumerations
Purdue University Purdue e-pubs JTRP Data Papers 11-2012 Indiana Traffic Signal Hi Resolution Data Logger Enumerations James R. Sturdevant INDOT, jsturdevant@indot.in.gov Timothy Overman INDOT Eric Raamot
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 informationHazard Operability Analysis
Hazard Operability Analysis Politecnico di Milano Dipartimento di Energia HAZOP Qualitative Deductive (search for causes) Inductive (consequence analysis) AIM: Identification of possible process anomalies
More information