Outline Deep Space One and Remote Agent Model-based Execution OpSat and the ITMS Model-based Reactive Planning Space Robotics.

Slides:



Advertisements
Similar presentations
Reinforcement Learning
Advertisements

© Charles Pecheur 1 Dagstuhl 5-9 Nov 2001 Symbolic Model Checking of Domain Models for Autonomous Spacecrafts Charles Pecheur (RIACS / NASA Ames)
Dynamic Scheduling of Network Updates Xin Jin Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, Roger Wattenhofer.
Adopt Algorithm for Distributed Constraint Optimization
MBD and CSP Meir Kalech Partially based on slides of Jia You and Brian Williams.
Lecture 8: Three-Level Architectures CS 344R: Robotics Benjamin Kuipers.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Dynamic Domain Architectures for Model Based Autonomy MoBIES Embedded Software Working Group Meeting April B. Williams, B. Laddaga, H. Shrobe,
CS 484. Discrete Optimization Problems A discrete optimization problem can be expressed as (S, f) S is the set of all feasible solutions f is the cost.
MBD in real-world system… Self-Configuring Systems Meir Kalech Partially based on slides of Brian Williams.
Approved for Public Release, Distribution Unlimited Pervasive Self-Regeneration through Concurrent Model-Based Execution Brian Williams (PI) Paul Robertson.
Vector Processing. Vector Processors Combine vector operands (inputs) element by element to produce an output vector. Typical array-oriented operations.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
© Charles Pecheur 1 SAS 2001 Verification and Validation of Model-Based Autonomous Systems Charles Pecheur, RIACS (ARC)
Implementation of RRT based Path planner and conversion into Temporal Plan Network By: Aisha Walcott Final Project Presentation Dec. 10, J.
Modeling and Planning with Robust Hybrid Automata Cooperative Control of Distributed Autonomous Vehicles in Adversarial Environments 2001 MURI: UCLA, CalTech,
Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?
Integrating POMDP and RL for a Two Layer Simulated Robot Architecture Presented by Alp Sardağ.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Solving problems by searching
The Need of Unmanned Systems
Ant Colony Optimization: an introduction
Maria-Cristina Marinescu Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology A Synthesis Algorithm for Modular Design of.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
CMSC 345 Fall 2000 Unit Testing. The testing process.
A Hierarchical Approach to Model-based Reactive Planning in Large State Spaces Artificial Intelligence & Space Systems Laboratories Massachusetts Institute.
The Role of Optimization and Deduction in Reactive Systems P. Pandurang Nayak NASA Ames Research Center Brian.
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Scientific Computing By: Fatima Hallak To: Dr. Guy Tel-Zur.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Tekin Bicer Gagan Agrawal 1.
1 Solving problems by searching This Lecture Chapters 3.1 to 3.4 Next Lecture Chapter 3.5 to 3.7 (Please read lecture topic material before and after each.
Frankfurt (Germany), 6-9 June 2011 Smart Grid Protection in China Wu Guopei Guangzhou Power Supply Bureau Guangdong Power Grid, China.
MIT Dept of Aeronautics and Astronautics March 21, 2003 Graduate Open House Aero/Astro Open House MERS Research Group Model-based Embedded and Robotic.
Improved Human-Robot Team performance using Chaski Proceeding: HRI '11HRI '11 Proceedings of the 6th international conference on Human-robot interaction.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Aero/Astro Open House MERS Research Group Model-based Embedded and Robotic Systems Group Space Systems Laboratory Massachusetts Institute of Technology.
Robotic Space Explorers Brian C. Williams Space Systems Lab & Artificial Intelligence Lab, MIT.
CAS 721 Course Project Implementing Branch and Bound, and Tabu search for combinatorial computing problem By Ho Fai Ko ( )
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Modeling Mobile-Agent-based Collaborative Processing in Sensor Networks Using Generalized Stochastic Petri Nets Hongtao Du, Hairong Qi, Gregory Peterson.
Massachusetts Institute of Technology September 7, 2005 A Tractable Approach to Probabilistically Accurate Mode Estimation Oliver B. Martin Seung H. Chung.
1 Model Checking of Robotic Control Systems Presenting: Sebastian Scherer Authors: Sebastian Scherer, Flavio Lerda, and Edmund M. Clarke.
Basic Problem Solving Search strategy  Problem can be solved by searching for a solution. An attempt is to transform initial state of a problem into some.
Model-based Programming of Cooperative Explorers Prof. Brian C. Williams Dept. of Aeronautics and Astronautics Artificial Intelligence Labs And Space Systems.
Programming Sensor Networks Andrew Chien CSE291 Spring 2003 May 6, 2003.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Outline for 4/23 Logistics Planning Review of last week Incorporating Dynamics Model-Based Reactive Planning.
Robotic Space Explorers: To Boldly Go Where No AI System Has Gone Before A Story of Survival J/6.834J September 19, 2001.
Breadth First Search and Depth First Search. Greatest problem in Computer Science Has lead to a lot of new ideas and data structures Search engines before.
PnP Networks Self-Aware Networks Self-Aware Networks Self-Healing and Self-Defense via Aware and Vigilant Networks PnP Networks, Inc. August, 2002.
Space Systems Laboratory Massachusetts Institute of Technology AUTONOMY MIT Graduate Student Open House March 24, 2000.
Solving problems by searching A I C h a p t e r 3.
Copyright B. Williams J/6.834J, Fall 02 Lecture 3: Immobile Robots and Space Explorers Prof. Brian Williams Rm Wednesday, September 11 th,
RADHA-KRISHNA BALLA 19 FEBRUARY, 2009 UCT for Tactical Assault Battles in Real-Time Strategy Games.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Autonomous Interface Agents Henry Lieberman Media Laboratory, MIT Presented by Sumit Taank Vishal Mishra.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Artificial Intelligence In Power System Author Doshi Pratik H.Darakh Bharat P.
Monitoring Dynamical Systems: Combining Hidden Markov Models and Logic
Reading B. Williams and P. Nayak, “A Reactive Planner for a Model-based Executive,” International Joint Conference on Artificial Intelligence, 1997.
Automation as the Subject of Mechanical Engineer’s interest
CIS 488/588 Bruce R. Maxim UM-Dearborn
Solving problems by searching
UNINFORMED SEARCH -BFS -DFS -DFIS - Bidirectional
Behavior Based Systems
Solving problems by searching
Depth-First Searches.
Presentation transcript:

Outline Deep Space One and Remote Agent Model-based Execution OpSat and the ITMS Model-based Reactive Planning Space Robotics

Modes Controlled Through Interactions driver computer bus control remote terminal driver remote terminal How do we open a valve?

Modes Controlled Through Interactions driver computer bus control remote terminal driver remote terminal MRMI Command Configuration goals Model goal statecurrent state Reactive Planner

computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops  goals are serializable Solution: Work goals from outputs to inputs. Achieve goals serially.

computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops  goals are serializable Solution: Work goals from outputs to inputs. Achieve goals serially.

computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops  goals are serializable Solution: Work goals from outputs to inputs. Achieve goals serially.

Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops. Solution: Work goals from outputs to inputs. Achieve goals serially. Compile devices into distributed policies –prime implicate generation –strongly connected components computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions vlv = closed & vcmdin = open  next (vlv = open) vlv = open & flowin = pos  flowout = pos Closed Open Stuck open Stuck closed vcmdin = openvcmdin = close

Indirect controllability inflow = outflow Closed Open cmd = opencmd = close cmd =off On Off cmd= oncmd = off cmd = reset vcmd in = vcmd out vcmd out (Driver) = cmd(Valve) Device states are not directly controllable

Compilation rt = on driver = on vcmd in (cu) = open rt = on driver = on vcmd in (cu) = close inflow = outflow Closed Open cu = on dcmd =off On Off rt = on dcmd= on rt = on dcmd = off rt = on dcmd(cu) = reset vcmd in = vcmd out vcmd out (Driver) = cmd(Valve) Remove intermediate variables using implicate generation –becomes a STRIPS-like problem –implicate generation done using conflict directed best first search

Compilation driver = on cmd= open driver = on cmd = close inflow = outflow Closed Open cmd =off On Off cmd= oncmd = off cmd= reset vcmd in = vcmd out vcmd out (Driver) = cmd(Valve) Remove intermediate variables using implicate generation –becomes a STRIPS-like problem –implicate generation done using conflict directed best first search

Concurrent policies rt = on driver = on vcmd in (cu) = open rt = on driver = on vcmd in (cu) = close Closed Open fail Goal fail rt = on driver = on cmd = open idle rt = on driver = on cmd = close Current Open Closed Stuck Open Closed Convert resulting transition system into a local policy  Encoding is extremely compact Ensure only reversible transitions are taken

Concurrent policies driver = on cmd = open driver = on cmd = close Closed Open fail Goal fail driver = on cmd = open idle driver = on cmd = close Current Open Closed Stuck Open Closed Convert resulting transition system into a local policy  Encoding is extremely compact Ensure only reversible transitions are taken

Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops. Solution: Work goals from outputs to inputs. Achieve goals serially. Compile devices into distributed policies –prime implicate generation –strongly connected components computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions Closed Open Stuck open Stuck closed dr = on, dcmdin = open dr=on vcmdin = close

Irreversible actions should be avoided by reactive planners. Component schematics tend not to have loops. Solution: Work goals from outputs to inputs. Achieve goals serially. Compile devices into distributed policies –prime implicate generation –strongly connected components computer bus control remote terminal remote terminal driver Modes Controlled Through Interactions Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal:

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal:

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = on

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = on

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = close

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: Driver Fails! cmd = close

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = reset

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = close

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: cmd = off

Goal Current open closed open closed stuckfail idle dr = on cmd=open dr = on cmd=close Goal Current onoff on off reset failure cmd=reset idle cmd = on cmd = off cmd=reset off Cmd closed Goal: Success! cmd = off

Complexity of Reactive Planning Worst Case per action: Depth * Sub-goal branch factor Average Cost per action:Sub-goal branch factor Valve 1 = openValve 2 = openDrv 1 = offDrv 2 = off Drv 1 = on CU = on Drv 2 = on CU = on

Complexity Analysis Details Average Cost per action:Subgoal branch factor –Avg cost = compute time / plan length –Each edge of the goal/subgoal tree is traversed twice. Compute time = 2 * E * B. –Each node of the goal / subgoal tree generates one action. plan length = N –Avg cost = O(E/N) –In the worst case E < = 2 * N. –Average Cost per action = O(B* N/N) = O(B) Subgoals

Outline Deep Space One and Remote Agent Model-based Execution OpSat and the ITMS Model-based Reactive Planning Space Robotics

Current Livingstone Testbeds

TechSat21 & Gflops Testbed MIT SSL Spheres MIT SSL Portable Satellite Assistant Ames

Capabilities Demonstration Space Station Module Oxygen: % Nitrogen: % Carbon Dioxide:....05% Other: % Temperature: F Pressure: lbs Humidity: % courtesy Yuri Gawdiak, NASA Ames

Conclusions Space is opening its doorway to a new generation of agile, highly independent explorers. To survive decades of operation they must orchestrate complex regulatory and immune systems. Model-based autonomy supports rapid prototyping through model-based programming and executives. A model-based executive is a kind of stochastic optimal controller that makes extensive use of deduction to observe and control on the fly. The core is OPSAT, a real-time, combinatorial optimization algorithm with logical feasibility constraints. Fast, model-based reactive planning is achieved through knowledge compilation and by exploiting structural and safety constraints.