Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability
summary
The gist
Safe, real-time active model discrimination and fault diagnosis for uncertain nonlinear systems with process and measurement disturbances is presented through a safe…
In short
The paper presents a safe, real-time algorithm for active fault diagnosis and model discrimination in uncertain nonlinear systems. It uses differentiable reachability approximations to enforce safety constraints while optimizing a policy that drives the system toward measurements consistent with at most one candidate fault model. This allows for fast, deterministic diagnosis under process and measurement disturbances.
Key concepts
- Differentiable Reachability
- This technique computes safe, over-approximated sets of all possible states and outputs reachable from a given starting point under system dynamics, input constraints, and noise. By making these computations differentiable using JAX, the method can optimize policies that respect safety limits while simultaneously tracking model consistency.
- Output-Anticipating Refinement
- This is a strategy used during optimization where the algorithm focuses on 'ambiguity-relevant states' when computing future control steps. By refining the state set based on which models are most likely to be correct, it reduces conservatism and allows for faster discrimination between different fault scenarios.
- Model Discrimination Objective
- This is a differentiable objective function designed to measure how much two possible system models overlap in their reachable output sets. Minimizing this overlap forces the optimized control policy to steer the system's actual outputs away from the regions predicted by incorrect fault models, thereby isolating the true model.
- Interval Over-approximations
- Since exact reachability computation for nonlinear systems is too complex, this method uses interval analysis to create conservative bounds (over-approximations) for state and output sets. These bounds guarantee that the true reachable set is entirely contained within the computed interval, ensuring safety guarantees even with uncertainty.
Terminology used across episodes
This episode discusses
- Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability · Paper Radio
- VISION-SLS: Safe Perception-Based Control from Learned Visual Representations via System Level Synthesis
The paper
Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability · Read on arXiv
Institute of Robotics and Intelligent Machines, Georgia Institute of Technology · Department of Aerospace Engineering, University of Illinois Urbana-Champaign
We present a safe, real-time algorithm for active fault diagnosis and model discrimination for uncertain continuous-time nonlinear systems with process and measurement disturbances. Given a finite set of candidate models representing nominal and faulty modes, including actuator and sensor faults, we formulate an output-feedback, time-varying policy optimization problem that (i) robustly enforces state-input safety constraints over a finite horizon and (ii) drives the system to produce sampled measurements consistent with at most one model, enabling deterministic diagnosis. To solve this problem in real time, we develop a tractable approximation using interval over-approximations of reachable state and output sets, and encode diagnosability via a differentiable objective that penalizes overlap between the reachable output sets of possible models. The resulting optimization is solved efficiently online with gradient-based methods using JAX and differentiable reachability primitives. We evaluate our method on sensor and actuator fault diagnosis (up to 11 fault modes) in several high-dimensional nonlinear robotic systems, including a simulated quadrotor and fighter-jet model, a hardware differential-drive robot, and quadrupedal navigation. Across these case studies, our approach achieves reliable model discrimination in under 50 ms, outperforming baselines in discrimination success rate and speed while providing formal safety guarantees.
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: We're looking at the paper: "Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability".
Paper summary: Rosa: So we're looking at this paper, "Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability," and essentially what it claims is a safe way to figure out which model of a system you are actually running in real time, even when things are uncertain.
Dev: Right. The core thesis here is formulating this as an output-feedback, time-varying policy optimization problem that has two main goals: first, robustly enforcing state input safety constraints over a finite time horizon, and second, driving the system to produce sampled measurements that are consistent with only one of the possible models.
Taro: That sounds really ambitious for continuous time nonlinear systems where you have process and measurement disturbances involved. So why is this necessary?
Rosa: Because in these safety-critical settings, if you rely on a controller that trusts a biased measurement or commands a degraded actuator, things can go wrong very quickly. You don't just want to detect that something's broken; you need to isolate which specific fault mode is active fast enough to allow for reconfiguration or fail-safe behavior.
Dev: Exactly. The problem gets tricky because many different candidate models can look very similar when they produce the same measurement signals, like a degraded leg appearing just like a healthy one when it's walking straight. So, you need a way to deliberately excite the system to make those signals distinct and therefore diagnose the fault.
Taro: So the naive question for someone listening is, how do you actually achieve this discrimination in real time without getting bogged down by impossibly complex calculations?
Rosa: That's where they tackle the intractability of exact reachable-set computation for nonlinear systems, which usually makes set-based fault diagnosis methods restricted to linear or affine dynamics, or requiring expensive offline computation. This paper addresses that by using interval over-approximations of reachable state and output sets to make things tractable.
Dev: They use mixed monotonicity in interval analysis to efficiently compute these over-approximations, which is a clever way to get sound bounds on the functions even when you have noise and uncertainty involved. They define an interval approximation of the output reachable set using the state reachable set and some input and measurement noise intervals.
Paper summary: Taro: So if we're talking about what they claim they can compute, it sounds like they are approximating the true reachable sets to make the problem solvable within a real-time framework. What is their main objective for this approximation?
Rosa: The objective is to encode model discrimination as a differentiable objective that penalizes the overlap between the reachable output sets of all possible models. They define this using a quantity called Jq, which involves finding the minimum time interval over which there's an overlap between two models' output reachable sets.
Dev: That overlap penalty is then used in an optimization problem where they seek a policy that minimizes this objective while respecting the safety constraints and the consistency requirement for at most one model. They solve this online using gradient-based methods powered by JAX and differentiable reachability primitives.
Taro: That sounds like a complex, multistep optimization process running on a loop. How do they handle the fact that exact reachable-set computation is NP-hard for general functions?
Rosa: They introduce an output-anticipating refinement scheme to reduce conservatism by conditioning future computations on ambiguity-relevant states. This involves refining the state set used for forward propagation by focusing only on those states that are most relevant to distinguishing between models when computing a control sequence.
Dev: That refinement leads to a multistep optimization problem where they maintain separate intervals for each model pair, which lets them focus their computational effort where it matters most for the diagnosis. It integrates the interval reachability set propagation, the overlap-volume discrimination objective, and those robust safety constraints all into one formulation.
Taro: So if I were driving a robot and needed to diagnose a fault quickly, this approach sounds like it could provide formal guarantees on safety while simultaneously trying to pinpoint exactly which fault is occurring. But what about testing it out in the real world?
Paper summary: Rosa: They've validated this approach on high-dimensional robotic case studies, including a simulated quadrotor, a hardware differential-drive robot, and even quadrupedal navigation systems like the Go2. The results show they achieve reliable model discrimination in under fifty milliseconds for these complex systems.
Dev: And they showed that for the ADMIRE fighter jet model specifically, that output-anticipating refinement discriminates models faster than the uninformed method, and on the Go2 quadrupedal navigation, solving that optimization with a collision avoidance constraint yields a controller with guaranteed obstacle avoidance in forty point two milliseconds plus or minus twenty-five point two microseconds.
Taro: Forty point two milliseconds sounds fast enough for real-time control loops, especially when you're dealing with complex systems. So what's the big picture implication for autonomous systems?
Rosa: It means that we can move toward having controllers that are not just reacting to immediate sensor readings, but actively designing inputs or policies to probe the system in a way that forces it to reveal which model is true, all while keeping safety constraints firmly in place.
Dev: The paper also points out a limitation they acknowledge: for general functions h, computing the inverse of that function's reachable set is NP-hard. So, they suggest that developing fast set inversion algorithms might be an open research topic if we want to push this further.
Taro: So it's a promising framework for handling uncertainty in nonlinear systems where you need both safety and accurate fault isolation at high speed. What are the implications for how we design these real-time diagnostic tools?
Rosa: It suggests that future work could look at assigning a different controller to each model pair, instead of optimizing one shared control law across all pairs, which would be a natural next step to reduce conservatism further.
Dev: I think the main implication is proving that formal safety guarantees can coexist with the need for active, real-time model discrimination in environments where you have process and measurement disturbances.
Taro: So we've covered the summary, why it matters, and what it means for future work in this paper on Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability.
Conclusion: Rosa: So we’re wrapping up our look at this paper, "Safe, Real-Time Active Model Discrimination and Fault Diagnosis for Nonlinear Systems via Differentiable Reachability." Basically, they’ve put together a safe way to figure out which model of a system you're running in real time.
Dev: Yeah, it’s about taking those complex nonlinear systems and process disturbances and giving us a real-time algorithm that handles both safety constraints and fault diagnosis simultaneously.
Taro: What I find interesting is how they tackle the difficulty of exactly calculating reachable sets for nonlinear systems, which usually just takes forever on a computer.
Rosa: They use interval over-approximations, which means they create bounds around where the system could possibly be at any given time and input setting.
Dev: That lets them use JAX and differentiable reachability primitives to solve a policy optimization problem online, which is key for real-time performance.
Taro: And they introduce this output-anticipating refinement strategy, which really helps shrink the uncertainty when they're looking for the right model.
Rosa: So, the authors show that this approach works on high-dimensional systems like simulated quadrotors and even hardware robots, achieving discrimination in under fifty milliseconds.
Dev: The safety case here is strong because it enforces state input constraints robustly while trying to drive the system toward measurements consistent with only one model.
Taro: It’s a big step because it moves beyond just detecting a fault to actively designing control inputs that force the system to reveal which fault mode it’s in.
Rosa: And they also pointed out that for general functions, calculating the inverse of those reachable sets is NP-hard, suggesting that we still have some hard problems left to solve.
Dev: So what this means for us on the ground is a framework where you can actively probe a system’s faults with formal safety guarantees without waiting days for offline analysis.
Taro: It opens up possibilities for autonomous systems that need to react instantly and safely when things go wrong in unpredictable ways.
More episodes
- 2608.13438-ContactGuard: Pre-Contact Execution Monitoring with Action-Conditioned Latent World Models
- 2610.34593-Future Prediction as Training-Only Video Supervision for Pretrained VLA Policies
- 2610.35385-EmbodiedLab: Beyond Manipulation, Benchmarking Embodied Agents That Act to Know
- 2610.36378-Data-Driven Hamiltonian for Neural Optimal Control
- 2610.37275-A Heuristic for Scheduling Autonomous Vehicles at Intersections
- 2610.37288-Dynamic Coordination of Autonomous Vehicles at Intersections
- 2610.37632-Real-Time Coordination of Autonomous Vehicles at Intersections
- 2611.13779-Softness is something you also need! Why compliance helps control: information metrics of a passive walker with compliant ankle
- 2611.13411-Residual-Corrected Physics-Informed Neural Network KKL Observers with Input-to-State Stability Guarantees
- 2611.14488-Is Your Robot's Memory Just a Clock? Temporal Shortcuts in Memory-Augmented VLA Policies