SearcharxivSearch

arXiv subjects

Diego Regruto

Publications and source records attributed to Diego Regruto.

16 recordsLinked to original sources

Online sparse observers for cyber-physical systems under sensor bias

The design of state observers for cyber-physical systems under sparse sensor biases, faults, or attacks has drawn substantial attention in recent years. While sparsity-based batch approaches, which collect multiple measurements and run offline, are relatively mature, online secure state estimation, for real-time state/attack recovery, is still an open problem. Although some algorithms have been proposed, convergence guarantees remain limited, even for the case of constant attacks. As a first step toward addressing this gap, we focus on constant attacks. We analyze the observability of this setting and we study several online sparse observers, derived from different methodological frameworks such as online sparse optimization and block Bregman methods. Some of the proposed observers are adaptations of existing algorithms to the secure state-estimation setting, while others constitute novel algorithmic contributions. The goal of this paper is to provide a unified overview of practically implementable, online sparse observers, discuss their convergence properties, and compare their performance through numerical experiments.

eess.SY

Thermal management optimization of Battery Electric Vehicles via hierarchical NMPC with CMO-trained Neural Models

This paper addresses the problem of energy-efficient thermal management in Battery Electric Vehicles (BEVs), with the goal of extending driving range while ensuring passenger comfort and battery thermal safety. A hierarchical Nonlinear Model Predictive Control (NMPC) framework is proposed, in which the supervisory layer explicitly balances energy consumption and cabin temperature reference tracking over a long horizon and translates this trade-off into optimal actuator command sequences for the integrated heating, ventilation, and air conditioning (HVAC) system and the battery thermal management (BTM) system. These command sequences are then enforced by a lower-layer NMPC, which introduces local corrections to compensate disturbances and modeling uncertainty while tracking an externally specified cabin temperature reference trajectory. To enable predictive control of the highly nonlinear and strongly coupled thermal dynamics, data-driven neural network models are employed as prediction models within both control layers. The proposed approach is developed and validated using a high-fidelity BEV thermal simulator developed at Politecnico di Torino in collaboration with Stellantis N.V., and benchmarked against an industrial rule-based (RB) control strategy over the WLTC driving cycle. Simulation results demonstrate a significant reduction in energy consumption compared to the baseline strategy, while satisfying comfort and battery temperature constraints.

math.OC

Global Convergence of Control-Based Lagrangian Flows for Non-Convex Optimization

This paper studies the continuous-time dynamics generated by control-theoretic Lagrangian methods for equality-constrained optimization. In particular, we consider dynamics induced by proportional-integral and feedback linearization controllers, which have recently been proposed as alternatives to primal-dual gradient methods. Unlike global convergence results for these dynamics, which rely on strong convexity of the objective function or boundedness assumptions, we exploit the geometric structure induced by the constraints. Specifically, we show global exponential convergence for non-convex problems that satisfy a suitable convexity property when restricted to the constraint manifold.

math.OC

A Fully Analog Implementation of Model Predictive Control with Application to Buck Converters

This paper proposes a novel approach to design analog electronic circuits that implement Model Predictive Control (MPC) policies for dynamical systems described by affine models. Effective approaches to define a reduced-complexity Explicit MPC form are combined and applied to realize an analog circuit comprising a limited set of low-latency, commercially available components. The practical feasibility and effectiveness of the proposed approach are demonstrated through its application in the design of a novel MPC-based controller for DC-DC Buck converters. We formally analyze the stability of the resulting system and conduct extensive numerical simulations to demonstrate the control system's performance in rejecting line and load disturbances.

eess.SY

A constrained optimization approach to nonlinear system identification through simulation error minimization

This paper introduces a novel approach to system identification for nonlinear input-output models that minimizes the simulation error and frames the problem as a constrained optimization task. The proposed method addresses vanishing gradient issues, enabling faster convergence than traditional gradient-based techniques. We present an algorithm based on feedback linearization control of Lagrange multipliers and conduct a theoretical analysis of its performance. We prove that the algorithm converges to a local minimum, and it enhances computational efficiency by exploiting the problem's structure. Numerical experiments demonstrate that our approach outperforms gradient-based methods in both computational effort and estimation accuracy.

math.OC

Data-Driven Control Of Power Converters

The fundamental role of power converters is to efficiently manage and control the flow of electrical energy, ensuring compatibility between power sources and loads. All these applications of power converters need the design of an appropriate control law. Control of power converters is a challenging problem due to the presence of switching devices which are difficult to handle using traditional control approaches. The objective of this paper is to investigate the use of data-driven techniques, in particular the Virtual References Feedback Tuning (VRFT) method, in the context of power converters feedback control. This study considers a buck \pauline{mode} power converter circuit provided by the OwnTech foundation.

eess.SY

Real-Time Single-Iteration Model Predictive Control for Wave Energy Converters

This paper proposes a novel real-time algorithm for controlling wave energy converters (WECs). We begin with the economic model predictive control (MPC) problem formulation and apply a novel, first-order optimization algorithm inspired by recently developed control-based algorithms for constrained optimization to define the controller dynamics according to the single-iteration MPC approach. We theoretically analyse the convergence of the employed algorithm and the computational complexity of the obtained controller. Results from simulations using a benchmark WEC system indicate that the proposed approach significantly outperforms standard MPC, thanks to the inherent ability to handle faster sampling rates.

eess.SY

Robust Load Disturbance Rejection in PWM DC-DC Buck Converters

This paper presents a novel approach to robust load disturbance rejection in DC-DC Buck converters. We propose a novel control scheme based on the design of two nested feedback loops. First, we design the controller in the outer loop using H infinity optimal control theory, and we show, by means of mu-analysis, that such a controller provides robust stability in the presence of uncertainty affecting the physical parameters of the circuit. Then, we introduce an inner feedback loop to improve the system's response to output load disturbances. As far as the inner loop is considered, we propose a novel load estimation-compensation (LEC) scheme, and we discuss under what conditions the insertion of such an inner loop preserves the robust stability of the entire control system. The LEC scheme is compared with the other two linear structures based on well-established disturbance rejection methods. The advantages of LEC in terms of both complexity of implementation and obtained performances are discussed and demonstrated by means of numerical simulation. Finally, we present experimental results obtained through the implementation of the proposed control scheme on a prototype board to demonstrate that the proposed approach significantly enhances disturbance rejection performances with respect to the approach commonly used in DC-DC buck converters.

eess.SY

Set-membership identification of continuous-time MIMO systems via Tustin discretization

In this paper, we deal with the identification of continuous-time systems from sampled data corrupted by unknown but bounded errors. A significant challenge in continuous-time identification is the estimation of the input and output data derivatives. In this paper, we propose a novel method based on set-membership techniques and Tustin discretization, which overcomes the derivative measurement problem and the presence of bounded errors affecting all the measured signals. First, we derive the proposed method and prove that it becomes an affordable polynomial optimization problem. Then, we present some numerical results based on simulation and experimental data to explore the effectiveness of the proposed method.

eess.SY

Integral action for bilinear systems with application to counter current heat exchanger

In this study, we propose a robust control strategy for a counter-current heat exchanger. The primary objective is to regulate the outlet temperature of one fluid stream by manipulating the flow rate of the second counter-current fluid stream. By leveraging the energy balance equations, we develop a structured bilinear system model derived by using a uniform spatial discretization of each stream into a cascade of homogeneous volumes and by considering the heat transfer and convective phenomena within the exchanger. We introduce two control strategies: (i) an output feedback controller incorporating a state observer and (ii) a purely integral control law. The effectiveness of the proposed control strategy is validated through real experiments on a real heat exchanger.

eess.SY

Fast sparse optimization via adaptive shrinkage

The need for fast sparse optimization is emerging, e.g., to deal with large-dimensional data-driven problems and to track time-varying systems. In the framework of linear sparse optimization, the iterative shrinkage-thresholding algorithm is a valuable method to solve Lasso, which is particularly appreciated for its ease of implementation. Nevertheless, it converges slowly. In this paper, we develop a proximal method, based on logarithmic regularization, which turns out to be an iterative shrinkage-thresholding algorithm with adaptive shrinkage hyperparameter. This adaptivity substantially enhances the trajectory of the algorithm, in a way that yields faster convergence, while keeping the simplicity of the original method. Our contribution is twofold: on the one hand, we derive and analyze the proposed algorithm; on the other hand, we validate its fast convergence via numerical experiments and we discuss the performance with respect to state-of-the-art algorithms.

math.OC

Lasso-based state estimation for cyber-physical systems under sensor attacks

The development of algorithms for secure state estimation in vulnerable cyber-physical systems has been gaining attention in the last years. A consolidated assumption is that an adversary can tamper a relatively small number of sensors. In the literature, block-sparsity methods exploit this prior information to recover the attack locations and the state of the system. In this paper, we propose an alternative, Lasso-based approach and we analyse its effectiveness. In particular, we theoretically derive conditions that guarantee successful attack/state recovery, independently of established time sparsity patterns. Furthermore, we develop a sparse state observer, by starting from the iterative soft thresholding algorithm for Lasso, to perform online estimation. Through several numerical experiments, we compare the proposed methods to the state-of-the-art algorithms.

math.OC

A convex optimization approach to online set-membership EIV identification of LTV systems

This paper addresses the problem of recursive set-membership identification for linear time varying (LTV) systems when both input and output measurements are affected by bounded additive noise. First we formulate the problem of online computation of the parameter uncertainty intervals (PUIs) in terms of nonconvex polynomial optimization. Then, we propose a convex relaxation approach based on McCormick envelopes to solve the formulated problem to the global optimum by means of linear programming. The effectiveness of the proposed identification scheme is demonstrated by means of two simulation examples.

math.OC

Sparse linear regression with compressed and low-precision data via concave quadratic programming

We consider the problem of the recovery of a k-sparse vector from compressed linear measurements when data are corrupted by a quantization noise. When the number of measurements is not sufficiently large, different $k$-sparse solutions may be present in the feasible set, and the classical l1 approach may be unsuccessful. For this motivation, we propose a non-convex quadratic programming method, which exploits prior information on the magnitude of the non-zero parameters. This results in a more efficient support recovery. We provide sufficient conditions for successful recovery and numerical simulations to illustrate the practical feasibility of the proposed method.

math.OC

A linear programming approach to sparse linear regression with quantized data

The sparse linear regression problem is difficult to handle with usual sparse optimization models when both predictors and measurements are either quantized or represented in low-precision, due to non-convexity. In this paper, we provide a novel linear programming approach, which is effective to tackle this problem. In particular, we prove theoretical guarantees of robustness, and we present numerical results that show improved performance with respect to the state-of-the-art methods.

math.OC

A unified framework for solving a general class of conditional and robust set-membership estimation problems

In this paper we present a unified framework for solving a general class of problems arising in the context of set-membership estimation/identification theory. More precisely, the paper aims at providing an original approach for the computation of optimal conditional and robust projection estimates in a nonlinear estimation setting where the operator relating the data and the parameter to be estimated is assumed to be a generic multivariate polynomial function and the uncertainties affecting the data are assumed to belong to semialgebraic sets. By noticing that the computation of both the conditional and the robust projection optimal estimators requires the solution to min-max optimization problems that share the same structure, we propose a unified two-stage approach based on semidefinite-relaxation techniques for solving such estimation problems. The key idea of the proposed procedure is to recognize that the optimal functional of the inner optimization problems can be approximated to any desired precision by a multivariate polynomial function by suitably exploiting recently proposed results in the field of parametric optimization. Two simulation examples are reported to show the effectiveness of the proposed approach.

eess.SY