SearcharxivSearch

arXiv subjects

Martina Mammarella

Publications and source records attributed to Martina Mammarella.

18 recordsLinked to original sources

Directional Conformal Uncertainty Quantification from Learned Model Discrepancy

We propose a conformal prediction framework for quantifying the error of physics-based predictors used in control, where simple models are preferred for synthesis, certification, and real-time use. Because these models are selected for compatibility with the intended application rather than for maximal predictive accuracy, their error combines process noise with a state-dependent discrepancy. A data-driven discrepancy estimate defines an asymmetric nonconformity score: errors consistent with the learned discrepancy are penalized less than equally large in the opposite direction. The sets remain in the nominal model's error coordinates and are physics-consistent, i.e., they contain a ball at the origin. The construction is agnostic to the discrepancy model (kernel, neural-network, or other), preserves finite-sample marginal validity under exchangeability, and provably narrows the interval over a characterizable state-input region. We further show that, for RKHS models, the power function provides a local confidence measure for adaptive score design and we extend the construction to the multivariate case via a Minkowski-gauge score yielding a jointly calibrated disturbance set.

eess.SY

MPC-based motion planning for non-holonomic systems in non-convex domains

Motivated by the application of using model predictive control (MPC) for motion planning of autonomous mobile robots, a form of output tracking MPC for non-holonomic systems and with non-convex constraints is studied. Although the advantages of using MPC for motion planning have been demonstrated in several papers, in most of the available fundamental literature on output tracking MPC it is assumed, often implicitly, that the model is holonomic and generally the state or output constraints must be convex. Thus, in application-oriented publications, empirical results dominate and the topic of proving completeness, in particular under which assumptions the target is always reached, has received comparatively little attention. To address this gap, we present a novel MPC formulation that guarantees convergence to the desired target under realistic assumptions, which can be verified in relevant real-world scenarios.

cs.RO

A kernel-based approach to physics-informed nonlinear system identification

This paper presents a kernel-based framework for physics-informed nonlinear system identification. The key contribution is a structured methodology that extends kernel-based techniques to seamlessly embed partially known physics-based models, improving parameter estimation and overall model accuracy. The proposed method enhances traditional modeling approaches by embedding a parametric model, which provides physical interpretability, with a kernel-based function, which accounts for unmodeled dynamics. The two models' components are identified from the data simultaneously, thereby minimizing a suitable cost that balances the relative importance of the physical and the black-box parts of the model. Additionally, nonlinear state smoothing is employed to address scenarios involving state-space models with not fully measurable states. Numerical simulations on an experimental benchmark system demonstrate the effectiveness of the proposed approach, achieving up to 51% reduction in simulation root mean square error compared to physics-only models and 31% performance improvement over state-of-the-art identification techniques.

eess.SY

Recursive feasibility for stochastic MPC and the rationale behind fixing flat tires

In this paper, we address the problem of designing stochastic model predictive control (SMPC) schemes for linear systems affected by unbounded disturbances. The contribution of the paper is rooted in a measured-state initialization strategy. First, due to the nonzero probability of violating chance-constraints in the case of unbounded noise, we introduce ellipsoidal-based probabilistic reachable sets and we include constraint relaxations to recover recursive feasibility conditioned to the measured state. Second, we prove that the solution of this novel SMPC scheme guarantees closed-loop chance constraints satisfaction under minimum relaxation. Last, we demonstrate that, in expectation, the need of relaxing the constraints vanishes over time, which leads the closed-loop trajectories steered towards the unconstrained LQR invariant region. This novel SMPC scheme is proven to satisfy the recursive feasibility conditioned to the state realization, and its superiority with respect to open-loop initialization schemes is shown through numerical examples.

math.OC

A scalable, gradient-stable approach to multi-step, nonlinear system identification using first-order methods

This paper presents three main contributions to the field of multi-step system identification. First, drawing inspiration from Neural Network (NN) training, it introduces a tool for solving identification problems by leveraging first-order optimization and Automatic Differentiation (AD). The proposed method exploits gradients with respect to the parameters to be identified and leverages Linear Parameter-Varying (LPV) sensitivity equations to model gradient evolution. Second, it demonstrates that the computational complexity of the proposed method is linear in both the multi-step horizon length and the parameter size, ensuring scalability for large identification problems. Third, it formally addresses the "exploding gradient" issue: via a stability analysis of the LPV equations, it derives conditions for a reliable and efficient optimization and identification process for dynamical systems. Simulation results indicate that the proposed method is both effective and efficient, making it a promising tool for future research and applications in nonlinear system identification and non-convex optimization.

eess.SY

Recovering nonlinear dynamics from non-uniform observations: A physics-based identification approach with practical case studies

Uniform and smooth data collection is often infeasible in real-world scenarios. In this paper, we propose an identification framework to effectively handle the so-called non-uniform observations, i.e., data scenarios that include missing measurements, multiple runs, or aggregated observations. The goal is to provide a general approach for accurately recovering the overall dynamics of possibly nonlinear systems, allowing the capture of the system behavior over time from non-uniform observations. The proposed approach exploits prior knowledge by integrating domain-specific, interpretable, physical principles with black-box approximators, proving significant flexibility and adaptability in handling different types of non-uniform measurements, and addressing the limitations of traditional linear and black-box methods. The description of this novel framework is supported by a theoretical study on the effect of non-uniform observations on the accuracy of parameter estimation. Specifically, we demonstrate the existence of upper bounds on the parametric error resulting from missing measurements and aggregated observations. Then, the effectiveness of the approach is demonstrated through two case studies. These include a practical application with missing samples, i.e., the identification of a continuous stirred-tank reactor using real data, and a simulated Lotka-Volterra system under aggregated observations. The results highlight the ability of the framework to robustly estimate the system parameters and to accurately reconstruct the model dynamics despite the availability of non-uniform measurements.

eess.SY

Combining Off-White and Sparse Black Models in Multi-step Physics-based Systems Identification -- EXTENDED VERSION

In this paper, we propose a unified framework for identifying interpretable nonlinear dynamical models that preserve physical properties. The proposed approach integrates physical principles with black-box basis functions to compensate for unmodeled dynamics, ensuring accuracy over long prediction horizons and computational efficiency. Additionally, we introduce penalty terms to enforce physical consistency and stability during training. We provide a comprehensive analysis of theoretical properties related to multi-step nonlinear system identification, establishing bounds on parameter estimation errors and conditions for gradient stability and sparsity recovery. The proposed framework demonstrates significant potential for improving model accuracy and reliability in various engineering applications, making a substantial step towards the effective use of combined off-white and sparse black models in system identification. The effectiveness of the proposed approach is demonstrated on a nonlinear system identification benchmark.

eess.SY

Measured-state conditioned recursive feasibility for stochastic model predictive control

In this paper, we address the problem of designing stochastic model predictive control (MPC) schemes for linear systems affected by unbounded disturbances. The contribution of the paper is twofold. First, motivated by the difficulty of guaranteeing recursive feasibility in this framework, due to the nonzero probability of violating chance-constraints in the case of unbounded noise, we introduce the novel definition of measured-state conditioned recursive feasibility in expectation. Second, we construct a stochastic MPC scheme, based on the introduction of ellipsoidal probabilistic reachable sets, which implements a closed-loop initialization strategy, i.e., the current measured-state is employed for initializing the optimization problem. This new scheme is proven to satisfy the novel definition of recursive feasibility, and its superiority with respect to open-loop initialization schemes, arising from the fact that one never neglects the information brought by the current measurement, is shown through numerical examples.

eess.SY

One-shot backpropagation for multi-step prediction in physics-based system identification -- EXTENDED VERSION

The aim of this paper is to present a novel physics-based framework for the identification of dynamical systems, in which the physical and structural insights are reflected directly into a backpropagation-based learning algorithm. The main result is a method to compute in closed form the gradient of a multi-step loss function, while enforcing physical properties and constraints. The derived algorithm has been exploited to identify the unknown inertia matrix of a space debris, and the results show the reliability of the method in capturing the physical adherence of the estimated parameters.

eess.SY

3D Map Reconstruction of an Orchard using an Angle-Aware Covering Control Strategy

In the last years, unmanned aerial vehicles are becoming a reality in the context of precision agriculture, mainly for monitoring, patrolling and remote sensing tasks, but also for 3D map reconstruction. In this paper, we present an innovative approach where a fleet of unmanned aerial vehicles is exploited to perform remote sensing tasks over an apple orchard for reconstructing a 3D map of the field, formulating the covering control problem to combine the position of a monitoring target and the viewing angle. Moreover, the objective function of the controller is defined by an importance index, which has been computed from a multi-spectral map of the field, obtained by a preliminary flight, using a semantic interpretation scheme based on a convolutional neural network. This objective function is then updated according to the history of the past coverage states, thus allowing the drones to take situation-adaptive actions. The effectiveness of the proposed covering control strategy has been validated through simulations on a Robot Operating System.

eess.SY

Prediction error quantification through probabilistic scaling -- EXTENDED VERSION

In this paper, we address the probabilistic error quantification of a general class of prediction methods. We consider a given prediction model and show how to obtain, through a sample-based approach, a probabilistic upper bound on the absolute value of the prediction error. The proposed scheme is based on a probabilistic scaling methodology in which the number of required randomized samples is independent of the complexity of the prediction model. The methodology is extended to address the case in which the probabilistic uncertain quantification is required to be valid for every member of a finite family of predictors. We illustrate the results of the paper by means of a numerical example.

math.ST

Chance constrained sets approximation: A probabilistic scaling approach -- EXTENDED VERSION

In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of simple-approximating sets of given complexity. A probabilistic scaling procedure then allows to rescale these sets to obtain the desired probabilistic guarantees. The proposed approach is shown to be applicable in several problem in systems and control, such as the design of Stochastic Model Predictive Control schemes or the solution of probabilistic set membership estimation problems.

eess.SY

Computationally efficient stochastic MPC: a probabilistic scaling approach

In recent years, the increasing interest in Stochastic model predictive control (SMPC) schemes has highlighted the limitation arising from their inherent computational demand, which has restricted their applicability to slow-dynamics and high-performing systems. To reduce the computational burden, in this paper we extend the probabilistic scaling approach to obtain low-complexity inner approximation of chance-constrained sets. This approach provides probabilistic guarantees at a lower computational cost than other schemes for which the sample complexity depends on the design space dimension. To design candidate simple approximating sets, which approximate the shape of the probabilistic set, we introduce two possibilities: i) fixed-complexity polytopes, and ii) $\ell_p$-norm based sets. Once the candidate approximating set is obtained, it is scaled around its center so to enforce the expected probabilistic guarantees. The resulting scaled set is then exploited to enforce constraints in the classical SMPC framework. The computational gain obtained with the proposed approach with respect to the scenario one is demonstrated via simulations, where the objective is the control of a fixed-wing UAV performing a monitoring mission over a sloped vineyard.

eess.SY

Open Data Resources for Fighting COVID-19

We provide an insight into the open data resources pertinent to the study of the spread of Covid-19 pandemic and its control. We identify the variables required to analyze fundamental aspects like seasonal behaviour, regional mortality rates, and effectiveness of government measures. Open data resources, along with data-driven methodologies, provide many opportunities to improve the response of the different administrations to the virus. We describe the present limitations and difficulties encountered in most of the open-data resources. To facilitate the access to the main open-data portals and resources, we identify the most relevant institutions, at a world scale, providing Covid-19 information and/or auxiliary variables (demographics, mobility, etc.). We also describe several open resources to access Covid-19 data-sets at a country-wide level (i.e. China, Italy, Spain, France, Germany, U.S., etc.). In an attempt to facilitate the rapid response to the study of the seasonal behaviour of Covid-19, we enumerate the main open resources in terms of weather and climate variables. CONCO-Team: The authors of this paper belong to the CONtrol COvid-19 Team, which is composed of different researches from universities of Spain, Italy, France, Germany, United Kingdom and Argentina. The main goal of CONCO-Team is to develop data-driven methods for the better understanding and control of the pandemic.

q-bio.OT

A probabilistic validation approach for penalty function design in Stochastic Model Predictive Control

In this paper, we consider a stochastic Model Predictive Control able to account for effects of additive stochastic disturbance with unbounded support, and requiring no restrictive assumption on either independence nor Gaussianity. We revisit the rather classical approach based on penalty functions, with the aim of designing a control scheme that meets some given probabilistic specifications. The main difference with previous approaches is that we do not recur to the notion of probabilistic recursive feasibility, and hence we do not consider separately the unfeasible case. In particular, two probabilistic design problems are envisioned. The first randomization problem aims to design \textit{offline} the constraint set tightening, following an approach inherited from tube-based MPC. For the second probabilistic scheme, a specific probabilistic validation approach is exploited for tuning the penalty parameter, to be selected \textit{offline} among a finite-family of possible values. The simple algorithm here proposed allows designing a \textit{single} controller, always guaranteeing feasibility of the online optimization problem. The proposed method is shown to be more computationally tractable than previous schemes. This is due to the fact that the sample complexity for both probabilistic design problems depends on the prediction horizon in a logarithmic way, unlike scenario-based approaches which exhibit linear dependence. The efficacy of the proposed approach is demonstrated with a numerical example.

eess.SY

Sample-based SMPC for tracking control of fixed-wing UAV: multi-scenario mapping

In this paper, a guidance and tracking control strategy for fixed-wing Unmanned Aerial Vehicle (UAV) autopilots is presented. The proposed control exploits recent results on sample-based stochastic Model Predictive Control, which allow coping in a computationally efficient way with both parametric uncertainty and additive random noise. Different application scenarios are discussed, and the implementability of the proposed approach are demonstrated through software-in-the-loop simulations. The capability of guaranteeing probabilistic robust satisfaction of the constraint specifications represents a key-feature of the proposed scheme, allowing real-time tracking of the designed trajectory with guarantees in terms of maximal deviation with respect to the planned one. The presented simulations show the effectiveness of the proposed control scheme.

eess.SY

A Tube-based Robust MPC for a Fixed-wing UAV: an Application for Precision Farming

The techniques of precision agriculture include the possibility to execute crop monitoring tasks through the application of Unmanned Aerial Vehicles (UAVs). These platforms are flexible, easy to use and low-cost, and they are the best candidates for improving the farm efficiency and productivity. In this research, a guidance algorithm and a robust control system are combined to guarantee the robustness of the system to additive noise (i.e. wind disturbance) and uncertainties (i.e. model parameter variations). A small fixed-wing UAV with an autonomy of about $1$ hour is proposed as case study, to reduce the cost of monitoring and increasing the stability performance of the system. A waypoint-grid on a paddy field is verified by hardware-in-the loop tests. The control scheme provides good results with a low computational effort, guaranteeing the repeatability of the monitoring and reduction of the costs.

eess.SY

An Offline-Sampling SMPC Framework with Application to Automated Space Maneuvers

In this paper, a sampling-based Stochastic Model Predictive Control algorithm is proposed for discrete-time linear systems subject to both parametric uncertainties and additive disturbances. One of the main drivers for the development of the proposed control strategy is the need of real-time implementability of guidance and control strategies for automated rendezvous and proximity operations between spacecraft. The paper presents considers the validation of the proposed control algorithm on an experimental testbed, showing how it may indeed be implemented in a realistic framework. Parametric uncertainties due to the mass variations during operations, linearization errors, and disturbances due to external space environment are simultaneously considered. The approach enables to suitably tighten the constraints to guarantee robust recursive feasibility when bounds on the uncertain variables are provided, and under mild assumptions, asymptotic stability in probability of the origin can be established. The offline sampling approach in the control design phase is shown to reduce the computational cost, which usually constitutes the main limit for the adoption of Stochastic Model Predictive Control schemes, especially for low-cost on-board hardware. These characteristics are demonstrated both through simulations and by means of experimental results.

eess.SY