To improve the predictive capacity of system models in the input–output sense, this paper presents a framework for model updating via learning of modeling uncertainties in locally and globally Lipschitz nonlinear systems. First, we introduce a method to extend an existing known model with an uncertainty model so that stability of the extended model is guaranteed in the sense of set invariance and input-to-state stability. To achieve this, we provide two tractable semi-definite programs. These programs allow obtaining optimal uncertainty model parameters for both locally and globally Lipschitz nonlinear models, given uncertainty and state trajectories. Subsequently, in order to extract this data from the available input–output trajectories, we introduce a filter that incorporates an approximated internal model of the uncertainty and asymptotically estimates uncertainty and state realizations. This filter is also synthesized using semi-definite programs with guaranteed robustness with respect to uncertainty model mismatches, disturbances, and noise. Numerical simulations for a large data-set of a roll plane model of a vehicle illustrate the effectiveness and practicality of the proposed methodology in improving model accuracy, while guaranteeing stability.

This survey reviews recent developments in fault diagnosis for both linear and nonlinear dynamical systems, covering model-based and data-driven approaches as well as passive and active detection and estimation methods. A central focus is placed on the geometric interpretation of diagnosis filters and their connection to the concept of behavioral sets, providing an intuitive view of their performance. We also review optimization-based techniques that enhance the robustness of linear filters when applied to nonlinear or uncertain systems. Furthermore, we point out recent progress in active fault diagnosis, where input design plays a key role in improving detectability and estimation accuracy. To bridge theory and practice, we include a set of real-world industrial applications that demonstrate the implementation and effectiveness of these methods in realistic settings.

Inspired by the recent successes of Inverse Optimization (IO) across various application domains, we propose a novel offline Reinforcement Learning (ORL) algorithm for continuous state and action spaces, leveraging the convex loss function called “sub-optimality loss” from the IO literature. To mitigate the distribution shift commonly observed in ORL problems, we further employ a robust and non-causal Model Predictive Control (MPC) expert steering a nominal model of the dynamics using in-hindsight information stemming from the model mismatch. Unlike the existing literature, our robust MPC expert enjoys an exact and tractable convex reformulation. In the second part of this study, we show that the IO hypothesis class, trained by the proposed convex loss function, enjoys ample expressiveness and reliably recovers teacher behavior in MuJoCo benchmarks. The method achieves competitive results compared to widely-used baselines in sample-constrained settings, despite using orders of magnitude fewer parameters. To facilitate the reproducibility of our results, we provide an open-source package implementing the proposed algorithms and the experiments.

This paper studies the problem of fault detection and estimation (FDE) for linear time-invariant (LTI) systems with a particular focus on frequency content information of faults, possibly as multiple disjoint continuum ranges, and under both disturbances and stochastic noise. To ensure the worst-case fault sensitivity in the considered frequency ranges and mitigate the effects of disturbances and noise, an optimization framework incorporating a mixed H_{_}/H₂ performance index is developed to compute the optimal detection filter. Moreover, a thresholding rule is proposed to guarantee both the false alarm rate (FAR) and the fault detection rate (FDR). Next, shifting attention to fault estimation in specific frequency ranges, an exact reformulation of the optimal estimation filter design using the restricted H_∞ performance index is derived, which is inherently non-convex. However, focusing on finite frequency samples and fixed poles, a lower bound is established via a highly tractable quadratic programming (QP) problem. This lower bound together with an alternating optimization (AO) approach to the original estimation problem leads to a suboptimality gap for the overall estimation filter design. The effectiveness of the proposed approaches is validated through applications of a non-minimum phase hydraulic turbine system and a multi-area power system.

In inverse optimization (IO), an expert agent solves an optimization problem parametric in an exogenous signal. From a learning perspective, the goal is to learn the expert’s cost function given a data set of signals and corresponding optimal actions. Motivated by the geometry of the IO set of consistent cost vectors, we introduce the “incenter” concept, a new notion akin to the recently proposed circumcenter concept. Discussing the geometric and robustness interpretation of the incenter cost vector, we develop corresponding tractable convex reformulations that are in contrast with the circumcenter, which we show is equivalent to an intractable optimization program. We further propose a novel loss function called augmented suboptimality loss (ASL), a relaxation of the incenter concept for problems with inconsistent data. Exploiting the structure of the ASL, we propose a novel first-order algorithm, which we name stochastic approximate mirror descent. This algorithm combines stochastic and approximate subgradient evaluations, together with mirror descent update steps, which are provably efficient for the IO problems with discrete feasible sets with high cardinality. We implement the IO approaches developed in this paper as a Python package called InvOpt. Our numerical experiments are reproducible, and the underlying source code is available as examples in the InvOpt package.

We present a novel user-centric vehicle-to-grid (V2G) framework that enables electric vehicle (EV) users to balance the trade-off between financial benefits from V2G and battery health degradation based on individual preference signals. Specifically, we introduce a game-theoretic model that treats the conflicting objectives of maximizing revenue from V2G participation and minimizing battery health degradation as two self-interested players. Via an enhanced semi-empirical battery health degradation model, we propose a finite-horizon smart charging strategy based on a horizon-splitting approach. Our method determines an appropriate allocation of time slots to each player according to the user's preferences, allowing for a flexible, personalized trade-off between V2G revenue and battery longevity. We conduct a comparative study between our approach and a multi-objective optimization formulation by evaluating the robustness of the charging schedules under parameter uncertainty and providing empirical estimates of regret and sensitivity. We validate our approach using realistic datasets through extensive trade-off studies that explore the impact of factors such as ambient temperature, charger type, and battery capacity, offering key insights to guide EV users in making informed decisions about V2G participation.

We propose a data-driven, user-centric vehicle-to-grid (V2G) methodology based on multi-objective optimization to balance battery degradation and V2G revenue according to EV user preference. Given the lack of accurate and generalizable battery degradation models, we leverage input convex neural networks (ICNNs) to develop a data-driven degradation model trained on extensive experimental datasets. This approach enables our model to capture nonconvex dependencies on battery temperature and time while maintaining convexity with respect to the charging rate. Such a partial convexity property ensures that the second stage of our methodology remains computationally efficient. In the second stage, we integrate our data-driven degradation model into a multi-objective optimization framework to generate an optimal smart charging profile for each EV. This profile effectively balances the trade-off between financial benefits from V2G participation and battery degradation, controlled by a hyperparameter reflecting the user prioritization of battery health. Numerical simulations show the high accuracy of the ICNN model in predicting battery degradation for unseen data. Finally, we present a trade-off curve illustrating financial benefits from V2G versus losses from battery health degradation based on user preferences and showcase smart charging strategies under realistic scenarios.

Ground fault detection in inverter-based microgrid (IBM) systems is challenging, particularly in a real-time setting, as the fault current deviates slightly from the nominal value. This difficulty is reinforced when there are partially decoupled disturbances and modeling uncertainties. The conventional solution of installing more relays to obtain additional measurements is costly and also increases the complexity of the system. In this brief, we propose a data-assisted diagnosis scheme based on an optimization-based fault detection filter with the output current as the only measurement. Modeling the microgrid dynamics and the diagnosis filter, we formulate the filter design as a quadratic programming (QP) problem that accounts for decoupling partial disturbances, robustness to nondecoupled disturbances and modeling uncertainties by training with data, and ensuring fault sensitivity simultaneously. To ease the computational effort, we also provide an approximate but analytical solution to this QP. Additionally, we use classical statistical results to provide a thresholding mechanism that enjoys probabilistic false-alarm guarantees. Finally, we implement the IBM system with Simulink and real-time digital simulator (RTDS) to verify the effectiveness of the proposed method through simulations.

To increase system robustness and autonomy, in this article, we propose a nonlinear fault estimation filter for a class of linear dynamical systems, subject to structured uncertainty, measurement noise, and system delays, in the presence of additive and multiplicative faults. The proposed filter architecture combines tools from model-based control approaches, regression techniques, and convex optimization. The proposed method estimates the additive and multiplicative faults using a linear residual generator combined with nonlinear regression. An offline simulator allows us to numerically characterize the mismatch between an assumed linear model and a range of alternative linear models that exhibit different levels of structured uncertainty. Moreover, we show how the performance bounds of the estimator, valid in the absence of uncertainty, can be used to determine appropriate countermeasures for measurement noise. In the scope of this work, we focus particularly on a fault estimation problem for Society of Automotive Engineers (SAEs) level 4 automated vehicles, which must remain operational in various cases and cannot rely on the driver. The proposed approach is demonstrated in simulations and in an experimental setting, where it is shown that additive and multiplicative faults can be estimated in a real vehicle under the influence of model uncertainty, measurement noise, and delay.

This paper proposes a nonlinear estimator for the robust reconstruction of process and sensor faults for a class of uncertain nonlinear systems. The proposed fault estimation method augments the system dynamics with an ultra-local (in time) internal state–space representation (a finite chain of integrators) of the fault vector. Next, a nonlinear state observer is designed based on the known parts of the augmented dynamics. This nonlinear filter (observer) reconstructs the fault signal as well as the states of the augmented system. We provide sufficient conditions that guarantee stability of the estimation error dynamics: firstly, asymptotic stability (i.e., exact fault estimation) in the absence of perturbations induced by the fault model mismatch (mismatch between internal ultra-local model for the fault and the actual fault dynamics), uncertainty, external disturbances, and measurement noise and, secondly, Input-to-State Stability (ISS) of the estimation error dynamics is guaranteed in the presence of these perturbations. In addition, to support performance-based estimator design, we provide Linear Matrix Inequality (LMI) conditions for L₂-gain and L₂−L_∞ induced norm and cast the synthesis of the estimator gains as a semi-definite program where the effect of model mismatch and external disturbances on the fault estimation error is minimized in the sense of L₂-gain, for an acceptable L₂−L_∞ induced norm with respect to measurement noise. The latter result facilitates a design that explicitly addresses the performance trade-off between noise sensitivity and robustness against model mismatch and external disturbances. Finally, numerical results for a benchmark system illustrate the performance of the proposed methodologies.

We study the problem of fault isolation in linear systems with actuator and sensor faults within a data-driven framework. We propose a nullspace-based filter that uses solely fault-free input-output data collected under process and measurement noises. By reparameterizing the problem within a behavioral framework, we achieve a direct fault isolation filter design that is independent of any explicit system model. The underlying classification problem is approached from a geometric perspective, enabling a characterization of mutual fault discernibility in terms of fundamental system properties given a noise-free setting. In addition, the provided conditions can be evaluated using only the available data. Finally, a simulation study is conducted to demonstrate the effectiveness of the proposed method.

We establish a collection of closed-loop guarantees and propose a scalable optimization algorithm for distributionally robust model predictive control (DRMPC) applied to linear systems, convex constraints, and quadratic costs. Via standard assumptions for the terminal cost and constraint, we establish distributionally robust long-term and stagewise performance guarantees for the closed-loop system. We further demonstrate that a common choice of the terminal cost, i.e., via the discrete-algebraic Riccati equation, renders the origin input-to-state stable for the closed-loop system. This choice also ensures that the exact long-term performance of the closed-loop system is independent of the choice of ambiguity set for the DRMPC formulation. Thus, we establish conditions under which DRMPC does not provide a long-term performance benefit relative to stochastic MPC. To solve the DRMPC optimization problem, we propose a Newton-type algorithm that empirically achieves superlinear convergence and guarantees the feasibility of each iterate. We demonstrate the implications of the closed-loop guarantees and the scalability of the proposed algorithm via two examples. To facilitate the reproducibility of the results, we also provide open-source code to implement the proposed algorithm and generate the figures.

We consider the constrained Linear Inverse Problem (LIP), where a certain atomic norm (like the `₁ norm) is minimized subject to a quadratic constraint. Typically, such cost functions are non-differentiable which makes them not amenable to the fast optimization methods existing in practice. We propose two equivalent reformulations of the constrained LIP with improved convex regularity: (i) a smooth convex minimization problem, and (ii) a strongly convex min-max problem. These problems could be solved by applying existing acceleration-based convex optimization methods which provide better Op¹{k²q theoretical convergence guarantee, improving upon the current best rate of Op¹{kq. We also provide a novel algorithm named the Fast Linear Inverse Problem Solver (FLIPS), which is tailored to maximally exploit the structure of the reformulations. We demonstrate the performance of FLIPS on the classical problems of Binary Selection, Compressed Sensing, and Image Denoising. We also provide open source MATLAB and PYTHON package for these three examples, which can be easily adapted to other LIPs.