52 research outputs found
A Tractable Fault Detection and Isolation Approach for Nonlinear Systems with Probabilistic Performance
This article presents a novel perspective along with a scalable methodology
to design a fault detection and isolation (FDI) filter for high dimensional
nonlinear systems. Previous approaches on FDI problems are either confined to
linear systems or they are only applicable to low dimensional dynamics with
specific structures. In contrast, shifting attention from the system dynamics
to the disturbance inputs, we propose a relaxed design perspective to train a
linear residual generator given some statistical information about the
disturbance patterns. That is, we propose an optimization-based approach to
robustify the filter with respect to finitely many signatures of the
nonlinearity. We then invoke recent results in randomized optimization to
provide theoretical guarantees for the performance of the proposed filer.
Finally, motivated by a cyber-physical attack emanating from the
vulnerabilities introduced by the interaction between IT infrastructure and
power system, we deploy the developed theoretical results to detect such an
intrusion before the functionality of the power system is disrupted
Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations
We consider stochastic programs where the distribution of the uncertain
parameters is only observable through a finite training dataset. Using the
Wasserstein metric, we construct a ball in the space of (multivariate and
non-discrete) probability distributions centered at the uniform distribution on
the training samples, and we seek decisions that perform best in view of the
worst-case distribution within this Wasserstein ball. The state-of-the-art
methods for solving the resulting distributionally robust optimization problems
rely on global optimization techniques, which quickly become computationally
excruciating. In this paper we demonstrate that, under mild assumptions, the
distributionally robust optimization problems over Wasserstein balls can in
fact be reformulated as finite convex programs---in many interesting cases even
as tractable linear programs. Leveraging recent measure concentration results,
we also show that their solutions enjoy powerful finite-sample performance
guarantees. Our theoretical results are exemplified in mean-risk portfolio
optimization as well as uncertainty quantification.Comment: 42 pages, 10 figure
- …