Presentation is loading. Please wait.

Presentation is loading. Please wait.

Ames Research Center Incremental Contingency Planning Richard Dearden, Nicolas Meuleau, Sailesh Ramakrishnan, David E. Smith, Rich Washington window [10,14:30]

Published byVivien Whitehead Modified over 8 years ago

Similar presentations

Presentation on theme: "Ames Research Center Incremental Contingency Planning Richard Dearden, Nicolas Meuleau, Sailesh Ramakrishnan, David E. Smith, Rich Washington window [10,14:30]"— Presentation transcript:

1 Ames Research Center Incremental Contingency Planning Richard Dearden, Nicolas Meuleau, Sailesh Ramakrishnan, David E. Smith, Rich Washington window [10,14:30] power Workspace pan data Drive (-1)Dig(5)Visual servo (.2, -.15)NIR Lo resRock finderHi resCarbonate [10,14:30] XXXX ?

2 Ames Research Center Limited onboard processing CPU, memory, time Safety sequence checking Anticipation setup steps Why Contingency Planning ??

3 Ames Research Center The Planning Problem Visual servo (.2, -.15) Warmup NIR Dig(5)Drive(-1)NIR ……… Compress Drive(2) Maximize (Expected) Scientific Return Given: start time pose energy available actions with uncertain: durations resource usage Possible science objectives images samples

4 Ames Research Center Technical Challenges Continuous time (& resources) Continuous outcomes Time (& resource) constraints Concurrency Goal selection & optimization g 1, g 2, g 3, g 4 … Visual servo (.2, -.15) Warmup NIR Lo resRock finderNIR ∆p = ∆t = NIR E > 2 Ah t  [10:00, 14:00] Time PowerStorage

5 Ames Research Center Just in Case (JIC) Scheduling 1. Seed schedule 2.Identify most likely failure 3.Generate a contingency branch 4.Integrate the branch Advantages: Tractability Simple plans Anytime.4.2.1

6 Ames Research Center Just in Case (JIC) Planning 1. Seed plan 2.Identify most likely failure 3.Generate a contingency branch 4.Integrate the branch.4.2.1

7 Ames Research Center Limits of JIC Scheduling Heuristics Dig(60)Visual servo (.2, -.15) Lo resRock finderLIB  = 120s  = 60s  = 300s  = 5s  = 1000s  = 500s t  [9:00, 16:00]  = 5s  = 1s  = 120s  = 20s V = 50 HiRes V = 10 t  [10:00, 13:50]  = 600s  = 60s t  [9:00, 14:30]  = 5s  = 1s V = 5 Warmup LIB  = 1200s  = 20s Most probable failure points may not be the best branch-points: It is often too late to attempt other goals when the plan is about to fail.  : most probable failures $ : most interesting branch point Expected Utility Power Start time 10 15 20 5 13:20 14:40 14:20 14:00 13:40 True for all initial states in the grey box.   Drive (-2)NIR  V = 100 t  [10:00, 14:00]  = 600s  = 60s $

8 Ames Research Center Just in Case (JIC) Planning 1. Seed plan 2.Identify best branch point 3.Generate a contingency branch 5. Evaluate & Integrate the branch ? ? ? Construct plangraph Back-propagate value tables Compute gain Select branch condition & goals ? r VbVb VmVm

9 Ames Research Center Construct Plangraph g1g1 g2g2 g3g3 g4g4

10 Ames Research Center Value Tables g1g1 g2g2 g3g3 g4g4 V1V1 V2V2 V3V3 V4V4 r r r r

11 Ames Research Center Example A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1

12 Ames Research Center Simple Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15

13 Ames Research Center Simple Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25

14 Ames Research Center Simple Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2

15 Ames Research Center Conjunctions A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2 1 2 r 1 2 t

16 Ames Research Center Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2 1 2 r 1 2 t 5 1 r

17 Ames Research Center Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2 1 2 r 1 2 t 5 1 r 1 5 t 1 15 t

18 Ames Research Center Combining Tables A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2 1 2 r 1 2 t 5 1 r 1 5 t 1 15 t 1 5 t

19 Ames Research Center Discharging Assumptions A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 2 r 1 2 t 5 1 r 1 5 t 1 15 t 1 5 t 1 5 1 5

20 Ames Research Center Propagation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 5 25 1 5 1 5 1 6

21 Ames Research Center Combining Tables A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 11 8 5 2515

22 Ames Research Center Combining Tables A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 1 5 2515 5 258 1 8

23 Ames Research Center Ordering A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 1 5 2515 5 258 DCE CDE AB 1 8

24 Ames Research Center Achieving Multiple Goals A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 1 5 2515 5 258 1 8 30 g+g’ g g’ +

25 Ames Research Center Achieving Multiple Goals A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 11 8 5 251530 g+g’ g g’ 5 g+g’ g g’ 25830

26 Ames Research Center Goal Annotation A E B e 5 (1, 5) (3, 3) (10, 15) (2, 2) C D st r q p g g’ e 1 5 15 1 5 1 5 6 11 8 g g g’ 5 251530 g+g’ g g’ 5 g+g’ g g’ 25830

27 Ames Research Center Just in Case (JIC) Planning 1. Seed plan 2.Identify best branch point 3.Generate a contingency branch 5. Evaluate & Integrate the branch ? ? ? Construct plangraph Back-propagate value tables Compute gain Select branch condition & goals ? r VbVb VmVm

28 Ames Research Center Estimating Branch Value V1V1 V2V2 V3V3 V4V4 V r V r V r Max V r

29 Ames Research Center Plan Statistics r V1V1 V2V2 V3V3 V4V4 P r plan value function resource probability VmVm VbVb r

30 Ames Research Center Expected Branch Gain V1V1 V2V2 V3V3 V4V4 P r Gain = ∫ P(r) max{0,V b (r) - V m (r)} dr ∞ 0 VbVb r r VbVb VmVm

31 Ames Research Center Selecting the Branch Condition V1V1 V2V2 V3V3 V4V4 P r branch condition r VbVb VmVm VbVb r branch condition

32 Ames Research Center Selecting Branch Goals r V1V1 V2V2 V3V3 V4V4 P r branch goals g1g1 g3g3 g3g3 g1g1 VbVb r r VbVb VmVm

33 Ames Research Center Evaluating the Branch 1. Seed plan 2.Identify best branch point 3.Generate a contingency branch 4.Evaluate & integrate the branch ? ? ? ? r VbVb VmVm Compute value function Compute actual gain

34 Ames Research Center Actual Branch Gain r VbVb P r Gain = ∫ P(r) max{0,V b (r) - V m (r)} dr ∞ 0 VmVm r VbVb Branch value function actual branch condition

35 Ames Research Center Remarks: Single Plangraph 1. Seed plan 2.Identify best branch point 3.Generate a contingency branch 5. Evaluate & Integrate the branch ? ? ? Construct plangraph Back-propagate value tables Compute gain Select branch condition & goals ? r VbVb VmVm

36 Ames Research Center Plan Graph g1g1 g2g2 g3g3 g4g4 V1V1 V2V2 V3V3 V4V4 r r r r

37 Ames Research Center Branch Initial Conditions g1g1 g2g2 g3g3 g4g4 V1V1 V2V2 V3V3 V4V4 r r r r v r v r v r v r v r {p} {q,r} {p,r}

38 Ames Research Center Single Plangraph 1. Seed plan 2.Identify best branch point 3.Generate a contingency branch 4.Evaluate & integrate the branch ? ? ? ? r VbVb VmVm Discharge conditions Compute gain Select branch condition & goals Construct single plangraph Back-propagate value tables

39 Ames Research Center Issues Sensor costs Setup steps Utility updates Floating contingencies Drive (-1)Dig(5)Visual servo (.2, -.15)Hi res Warm NIR Lo resRock finderNIR [11,14:00] Visual servoHi resVisual servoNIR V = 100 V’ = 30 Lo resRock finderNIR Drive (-1)Dig(5)Visual servo (.2, -.15)Hi res?

40 Ames Research Center The End.

Download ppt "Ames Research Center Incremental Contingency Planning Richard Dearden, Nicolas Meuleau, Sailesh Ramakrishnan, David E. Smith, Rich Washington window [10,14:30]"

Similar presentations

Chapter 7 Managing Risk.

Chapter 7 Managing Risk.
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Fragment-Based Conformant Planning James Kurien Palo Alto Research Center Pandu NayakStratify, Inc. David E. SmithNASA Ames Research Center.

Fragment-Based Conformant Planning James Kurien Palo Alto Research Center Pandu NayakStratify, Inc. David E. SmithNASA Ames Research Center.
Multi‑Criteria Decision Making

Multi‑Criteria Decision Making
Generating Plans in Concurrent, Probabilistic, Oversubscribed Domains Li Li and Nilufer Onder Department of Computer Science Michigan Technological University.

Generating Plans in Concurrent, Probabilistic, Oversubscribed Domains Li Li and Nilufer Onder Department of Computer Science Michigan Technological University.
Probabilistic Planning (goal-oriented) Action Probabilistic Outcome Time 1 Time 2 Goal State 1 Action State Maximize Goal Achievement Dead End A1A2 I A1.

Probabilistic Planning (goal-oriented) Action Probabilistic Outcome Time 1 Time 2 Goal State 1 Action State Maximize Goal Achievement Dead End A1A2 I A1.
Resource Management Chapter 12.

Resource Management Chapter 12.
Chapter 7: Managing Risk

Chapter 7: Managing Risk
Static Optimization of Conjunctive Queries with Sliding Windows over Infinite Streams Presented by: Andy Mason and Sheng Zhong Ahmed M.Ayad and Jeffrey.

Static Optimization of Conjunctive Queries with Sliding Windows over Infinite Streams Presented by: Andy Mason and Sheng Zhong Ahmed M.Ayad and Jeffrey.
 An object-oriented program’s structure often bears little resemblance to its code structure.  The code structure is frozen at compile-time; it consists.

 An object-oriented program’s structure often bears little resemblance to its code structure.  The code structure is frozen at compile-time; it consists.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.

Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.

Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.
Over-subscription Planning with Numeric Goals J. Benton Computer Sci. & Eng. Dept. Arizona State University Tempe, AZ Minh Do Palo Alto Research Center.

Over-subscription Planning with Numeric Goals J. Benton Computer Sci. & Eng. Dept. Arizona State University Tempe, AZ Minh Do Palo Alto Research Center.
Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.

Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.
3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.

3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.
These courseware materials are to be used in conjunction with Software Engineering: A Practitioner’s Approach, 6/e and are provided with permission by.

These courseware materials are to be used in conjunction with Software Engineering: A Practitioner’s Approach, 6/e and are provided with permission by.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.

Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Business Analytics, Part I Introduction Presented by Scott Koegler Editor, ec-bp.org.

Business Analytics, Part I Introduction Presented by Scott Koegler Editor, ec-bp.org.
Resource Management in Data-Intensive Systems Bernie Acs, Magda Balazinska, John Ford, Karthik Kambatla, Alex Labrinidis, Carlos Maltzahn, Rami Melhem,

Resource Management in Data-Intensive Systems Bernie Acs, Magda Balazinska, John Ford, Karthik Kambatla, Alex Labrinidis, Carlos Maltzahn, Rami Melhem,
A Framework for Planning in Continuous-time Stochastic Domains Håkan L. S. Younes Carnegie Mellon University David J. MuslinerReid G. Simmons Honeywell.

A Framework for Planning in Continuous-time Stochastic Domains Håkan L. S. Younes Carnegie Mellon University David J. MuslinerReid G. Simmons Honeywell.

Similar presentations

Ads by Google