Temporal Brittleness Analysis of Task Networks for Planetary Rovers

Abstract

We propose a new method to analyze the temporal brittleness of task networks, which allows the detection and enumeration of activities that, with modest task execution duration variation make the execution of the task network dynamically uncontrollable. In this method, we introduce a metric for measuring an activity brittleness – defined as the degree of acceptable deviation of its nominal duration – and describe how that measurement is mapped to task network structure. Complementary to existing work on plan robustness analysis which informs how likely a task network is to succeed or not, the proposed analysis and metric go deeper to pinpoint the sources of potential brittleness due to temporal constraints and to focus either human designers and/or automated task network generators (e.g. scheduler/planners) to address sources of undesirable brittleness. We apply the approach to a set of task networks (called sol types) in development for NASA’s next planetary rover and present common patterns that are sources of brittleness. These techniques are currently under evaluation for potential use supporting operations of the Mars 2020 rover.

DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling

“…It would be interesting to see how DREAM would perform in this context in comparison to DREA. Finally, testing with physics-based or real-world simulations currently considering the use of -aware PSTN techniques (e.g., Vaquero et al (2019)) would yield results more directly relevant to practical situations. These further empirical explorations would create a stronger basis for justifying the value of SC and AR, and defining the trade-off between success rate and communication.…”

Dynamical Immunization of Data Network Controllability Processes Against Centrality Attacks on Temporal Networks

“…In temporal networks, the betweenness centrality of a link is equal to the ratio of the number of shortest paths of which that link is a part of those paths to the total number of shortest paths between all network nodes. This value is obtained as (8): (8) where:…”

“…… , 𝑒 𝐿 }. These links are activated or deactivated over time [8]. If time is considered discrete in temporal networks, then network dynamics are formulated as (1) [1].…”