arXiv subjects

Amir Modares

Publications and source records attributed to Amir Modares.

6 recordsLinked to original sources

arXiv2026

Reachability Analysis With Probabilistic Zonotopes: Learning Realized Disturbances and Refining Aleatory Uncertainty

This paper develops a data-driven reachability framework for linear systems whose disturbances are modeled by probabilistic zonotopes (PZs), combining bounded deterministic and Gaussian stochastic components. In contrast to methods that require a precisely known disturbance model (either purely deterministic or purely stochastic), we assume only a conservative prior PZ and refine it from data. The framework separates two uncertainty sources: realized disturbances, which act along the collected trajectory and govern the size of the data-consistent model set, and aleatory disturbances, which enter as future additive uncertainty during reachable-set propagation; both shape the reachable sets, but through different mechanisms. Refinement exploits prior system knowledge together with trajectory-consistency constraints induced by the data, which impose affine couplings between deterministic and Gaussian latent variables. We accordingly develop a constrained-PZ calculus that absorbs the stochastic part of these constraints into an equivalent representation, removes infeasible latent directions, and reduces stochastic covariance, together with identification-aware fusion rules for combining heterogeneous constrained-PZ descriptions. The refined realized-disturbance proxies then serve as scenarios in a linear program that learns the smallest translated and scaled copy of the prior disturbance set that contains all proxy confidence sets while remaining nested in the prior. The resulting deterministic, high-probability reachable sets carry formal containment guarantees with substantially reduced conservatism, and numerical examples confirm that the pipeline tightens both the data-consistent model set and the propagated reachable sets.

eess.SY↗

arXiv2026

Data-based Low-conservative Nonlinear Safe Control Learning

This paper develops a data-driven safe control framework for nonlinear discrete-time systems with parametric uncertainty and additive disturbances. The proposed approach constructs a data-consistent closed-loop representation that enables controller synthesis and safety certification directly from data. Unlike existing methods that treat unmodeled nonlinearities as global worst-case uncertainties using Lipschitz bounds, the proposed approach embeds nonlinear terms directly into the invariance conditions via a geometry-aware difference-of-convex formulation. This enables facet- and direction-specific convexification, avoiding both nonlinearity cancellation and the excessive conservatism induced by uniform global bounds. We further propose a vertex-dependent controller construction that enforces convexity and contractivity conditions locally on the active facets associated with each vertex, thereby enlarging the class of certifiable invariant sets. For systems subject to additive disturbances, disturbance effects are embedded directly into the verification conditions through optimized, geometry-dependent bounds, rather than via uniform margin inflation, yielding less conservative robust safety guarantees. As a result, the proposed methods can certify substantially larger safe sets, naturally accommodate joint state and input constraints, and provide data-driven safety guarantees. The simulation results show a significant improvement in both nonlinearity tolerance and the size of the certified safe set.

eess.SY↗

arXiv2025

Non-Conservative Data-driven Safe Control Design for Nonlinear Systems with Polyhedral Safe Sets

This paper presents a data-driven nonlinear safe control design approach for discrete-time systems under parametric uncertainties and additive disturbances. We first characterize a new control structure from which a data-based representation of closed-loop systems is obtained. This data-based closed-loop system is composed of two parts: 1) a parametrized linear closed-loop part and a parametrized nonlinear remainder closed-loop part. We show that using the standard practice or learning a robust controller to ensure safety while treating the remaining nonlinearities as disturbances brings about significant challenges in terms of computational complexity and conservatism. To overcome these challenges, we develop a novel nonlinear safe control design approach in which the closed-loop nonlinear remainders are learned, rather than canceled, in a control-oriented fashion while preserving the computational efficiency. To this end, a primal-dual optimization framework is leveraged in which the control gains are learned to enforce the second-order optimality on the closed-loop nonlinear remainders. This allows us to account for nonlinearities in the design for the sake of safety rather than treating them as disturbances. This new controller parameterization and design approach reduces the computational complexity and the conservatism of designing a safe nonlinear controller. A simulation example is then provided to show the effectiveness of the proposed data-driven controller.

eess.SY↗

arXiv2025

Unifying Direct and Indirect Learning for Safe Control of Linear Systems

This paper develops learning-enabled safe controllers for linear systems subject to system uncertainties and bounded disturbances. Given the disturbance zonotope, the databased closed-loop dynamics (CLDs) are first characterized using a matrix zonotope (MZ), and refined through several steps to yield a constrained matrix zonotope (CMZ). This refinement is achieved by introducing conformal equality constraints that eliminate incompatible disturbance realizations. More precisely, prior knowledge and observed data are used separately to construct CMZ representations of disturbance sequences that conform to both data and prior knowledge, and are intersected by the initial MZ of the disturbance sequence, producing a refined CMZ. This approach reduces conservatism. To further reduce the conservativeness, we unify open-loop learning with closed-loop learning by presenting a novel set-membership identification method that models open-loop dynamics as a CMZ. The prior knowledge serves as an initial feasible open-loop model set (FOLMS) of this CMZ, which is refined into a posterior set whenever new informative online data becomes available. This posterior FOLMS then adaptively replaces the prior knowledge set employed in the disturbance elimination of the closed-loop learning process. The resulting refined parameterized set of CLD is subsequently leveraged to directly and adaptively learn a controller that robustly enforces safety. Toward this goal, we formulate a linear programming problem that guarantees {\lambda}contractiveness of a polyhedral safe set. A simulation example is provided to validate the effectiveness of the proposed approach and support the theoretical results.

eess.SY↗

arXiv2025

Integration of Prior Knowledge into Direct Learning for Safe Control of Linear Systems

This paper integrates prior knowledge into direct learning of safe controllers for linear uncertain systems under disturbances. To this end, we characterize the set of all closed-loop systems that can be explained by available prior knowledge of the system model and the disturbances. We leverage matrix zonotopes for data-based characterization of closed-loop systems and show that the explainability of closed-loop systems by prior knowledge can be formalized by adding an equality conformity constraint to the matrix zonotope. We then leverage the resulting constraint matrix zonotope and design safe controllers that conform with both data and prior knowledge. This is achieved by ensuring the inclusion of a constrained zonotope of all possible next states in a {\lambda}-scaled level set of the safe set. We consider both polytope and zonotope safe sets and provide set inclusion conditions using linear programming.

eess.SY↗

arXiv2022

Data Driven Safe Gain-Scheduling Control

Data-based safe gain-scheduling controllers are presented for discrete-time linear parameter-varying systems (LPV) with polytopic models. First, $\lambda$-contractivity conditions are provided under which safety and stability of the LPV systems are unified through Minkowski functions of the safe sets. Then, to bypass the requirement to identify the system dynamics, a data-based representation of the closed-loop LPV system is provided to directly exploit collected data and construct a safe controller. It is shown that weaker data richness requirements are needed to directly learn a closed-loop safe control policy than to identify the LPV system. The closed-loop data-based representation is leveraged to directly design data-driven gain-scheduling controllers that guarantee $\lambda$-contractiveness, and, thus, invariance of the safe sets. It is also shown that the problem of designing a data-driven gain-scheduling controller for a polyhedral (ellipsoidal) safe set amounts to a linear program (a semi-definite program). A simulation example is provided to show the effectiveness of the presented approach.

eess.SY↗