Searcharxiv⌕ Search

arXiv subjects

Jorge Cortes

Publications and source records attributed to Jorge Cortes.

At least 37 records · Page 2Linked to original sources

Distributionally Robust Policy and Lyapunov-Certificate Learning

This article presents novel methods for synthesizing distributionally robust stabilizing neural controllers and certificates for control systems under model uncertainty. A key challenge in designing controllers with stability guarantees for uncertain systems is the accurate determination of and adaptation to shifts in model parametric uncertainty during online deployment. We tackle this with a novel distributionally robust formulation of the Lyapunov derivative chance constraint ensuring a monotonic decrease of the Lyapunov certificate. To avoid the computational complexity involved in dealing with the space of probability measures, we identify a sufficient condition in the form of deterministic convex constraints that ensures the Lyapunov derivative constraint is satisfied. We integrate this condition into a loss function for training a neural network-based controller and show that, for the resulting closed-loop system, the global asymptotic stability of its equilibrium can be certified with high confidence, even with Out-of-Distribution (OoD) model uncertainties. To demonstrate the efficacy and efficiency of the proposed methodology, we compare it with an uncertainty-agnostic baseline approach and several reinforcement learning approaches in two control problems in simulation.

eess.SY↗

Data-driven mode detection and stabilization of unknown switched linear systems

This paper considers the stabilization of unknown switched linear systems using data. Instead of a full system model, we have access to a finite number of trajectories of each of the different modes prior to the online operation of the system. On the basis of informative enough measurements, formally characterized in terms of linear matrix inequalities, we design an online switched controller that alternates between a mode detection phase and a stabilization phase. Since the specific currently-active mode is unknown, the controller employs the most recent online measurements to determine it by implementing computationally efficient tests that check compatibility with the set of systems consistent with the pre-collected measurements. The stabilization phase applies the stabilizing feedback gain corresponding to the identified active mode and monitors the evolution of the associated Lyapunov function to detect switches. When a switch is detected, the controller returns to the mode-detection phase. Under average dwell- and activation-time assumptions on the switching signal, we show that the proposed controller guarantees a practical stability property of the closed-loop switched system. Various simulations illustrate our results.

math.OC↗

Cautious optimization via data informativity

This paper deals with the problem of accurately determining guaranteed suboptimal values of an unknown cost function on the basis of noisy measurements. We consider a set-valued variant to regression where, instead of finding a best estimate of the cost function, we reason over all functions compatible with the measurements and apply robust methods explicitly in terms of the data. Our treatment provides data-based conditions under which closed-forms expressions of upper bounds of the unknown function can be obtained, and regularity properties like convexity and Lipschitzness can be established. These results allow us to provide tests for point- and set-wise verification of suboptimality, and tackle the cautious optimization of the unknown function in both one-shot and online scenarios. We showcase the versatility of the proposed methods in two control-relevant problems: data-driven contraction analysis of unknown nonlinear systems and suboptimal regulation with unknown dynamics and cost. Simulations illustrate our results.

math.OC↗

Distributionally Robust Lyapunov Function Search Under Uncertainty

This paper develops methods for proving Lyapunov stability of dynamical systems subject to disturbances with an unknown distribution. We assume only a finite set of disturbance samples is available and that the true online disturbance realization may be drawn from a different distribution than the given samples. We formulate an optimization problem to search for a sum-of-squares (SOS) Lyapunov function and introduce a distributionally robust version of the Lyapunov function derivative constraint. We show that this constraint may be reformulated as several SOS constraints, ensuring that the search for a Lyapunov function remains in the class of SOS polynomial optimization problems. For general systems, we provide a distributionally robust chance-constrained formulation for neural network Lyapunov function search. Simulations demonstrate the validity and efficiency of either formulation on non-linear uncertain dynamical systems.

math.OC↗

When sampling works in data-driven control: Informativity for stabilization in continuous time

This paper introduces a notion of data informativity for stabilization tailored to continuous-time signals and systems. We establish results comparable to those known for discrete-time systems with sampled data. We justify that additional assumptions on the properties of the noise signals are needed to understand when sampled versions of continuous-time signals are informative for stabilization, thereby introducing the notions of square Lipschitzness and total bounded variation. This allows us to connect the continuous and discrete domains, yielding sufficient conditions to synthesize a stabilizing controller for the true continuous-time system on the basis of sampled data. Simulations illustrate our results.

math.OC↗

Reinforcement Learning for Distributed Transient Frequency Control with Stability and Safety Guarantees

This paper proposes a reinforcement learning-based approach for optimal transient frequency control in power systems with stability and safety guarantees. Building on Lyapunov stability theory and safety-critical control, we derive sufficient conditions on the distributed controller design that ensure the stability and transient frequency safety of the closed-loop system. Our idea of distributed dynamic budget assignment makes these conditions less conservative than those in recent literature, so that they can impose less stringent restrictions on the search space of control policies. We construct neural network controllers that parameterize such control policies and use reinforcement learning to train an optimal one. Simulations on the IEEE 39-bus network illustrate the guaranteed stability and safety properties of the controller along with its significantly improved optimality.

eess.SY↗

Online Regulation of Dynamical Systems to Solutions of Constrained Optimization Problems

This paper considers the problem of regulating a dynamical system to equilibria that are defined as solutions of an input- and state-constrained optimization problem. To solve this regulation task, we design a state feedback controller based on a continuous approximation of the projected gradient flow. We first show that the equilibria of the interconnection between the plant and the proposed controller correspond to critical points of the constrained optimization problem. We then derive sufficient conditions to ensure that, for the closed-loop system, isolated locally optimal solutions of the optimization problem are locally exponentially stable and show that input constraints are satisfied at all times by identifying an appropriate forward-invariant set.

eess.SY↗

Data-Driven Optimal Control of Bilinear Systems

This paper develops a method to learn optimal controls from data for bilinear systems without a priori knowledge of the system dynamics. Given an unknown bilinear system, we first characterize when the available data is suitable to solve the optimal control problem. This characterization leads us to propose an online control experiment design procedure that guarantees that any input/state trajectory can be represented as a linear combination of collected input/state data matrices. Leveraging this data-based representation, we transform the original optimal control problem into an equivalent data-based optimization problem with bilinear constraints. We solve the latter by iteratively employing a convex-concave procedure to convexify it and find a locally optimal control sequence. Simulations show that the performance of the proposed data-based approach is comparable with model-based methods.

math.OC↗

Efficient Reconstruction of Neural Mass Dynamics Modeled by Linear-Threshold Networks

This paper studies the data-driven reconstruction of firing rate dynamics of brain activity described by linear-threshold network models. Identifying the system parameters directly leads to a large number of variables and a highly non-convex objective function. Instead, our approach introduces a novel reformulation that incorporates biological organizational features and turns the identification problem into a scalar variable optimization of a discontinuous, non-convex objective function. We prove that the minimizer of the objective function is unique and establish that the solution of the optimization problem leads to the identification of all the desired system parameters. These results are the basis to introduce an algorithm to find the optimizer by searching the different regions corresponding to the domain of definition of the objective function. To deal with measurement noise in sampled data, we propose a modification of the original algorithm whose identification error is linearly bounded by the magnitude of the measurement noise. We demonstrate the effectiveness of the proposed algorithms through simulations on synthetic and experimental data.

eess.SY↗

Nonsmooth Control Barrier Function Design of Continuous Constraints for Network Connectivity Maintenance

This paper considers the problem of maintaining global connectivity of a multi-robot system while executing a desired coordination task. Our approach builds on optimization-based feedback design formulations, where the nominal cost function and constraints encode desirable control objectives for the resulting input. Our solution uses the algebraic connectivity of the multi-robot interconnection topology as a control barrier function and critically embraces its nonsmooth nature. We take advantage of the understanding of how Laplacian eigenvalues behave as their multiplicities change, in combination with the flexibility provided by the concept of control barrier function, to carefully design additional constraints that guarantee the resulting optimization-based controller is continuous and maintains network connectivity. The technical treatment combines elements from set-valued theory, nonsmooth analysis, and algebraic graph theory to imbue the proposed constraints with regularity properties so that they can be smoothly combined with other control constraints. We provide simulations and experimental results illustrating the effectiveness and continuity of the proposed approach in a resource gathering problem.

math.OC↗

Continuity and Boundedness of Minimum-Norm CBF-Safe Controllers

The existence of a Control Barrier Function (CBF) for a control-affine system provides a powerful design tool to ensure safety. Any controller that satisfies the CBF condition and ensures that the trajectories of the closed-loop system are well defined makes the zero superlevel set forward invariant. Such a controller is referred to as safe. This paper studies the regularity properties of the minimum-norm safe controller as a stepping stone towards the design of general continuous safe feedback controllers. We characterize the set of points where the minimum-norm safe controller is discontinuous and show that it depends solely on the safe set and not on the particular CBF that describes it. Our analysis of the controller behavior as we approach a point of discontinuity allows us to identify sufficient conditions to ensure it grows unbounded or it remains bounded. Examples illustrate our results, providing insight into the conditions that lead to (un)bounded discontinuous minimum-norm controllers.

math.OC↗

Safe and Stable Control Synthesis for Uncertain System Models via Distributionally Robust Optimization

This paper considers enforcing safety and stability of dynamical systems in the presence of model uncertainty. Safety and stability constraints may be specified using a control barrier function (CBF) and a control Lyapunov function (CLF), respectively. To take model uncertainty into account, robust and chance formulations of the constraints are commonly considered. However, this requires known error bounds or a known distribution for the model uncertainty, and the resulting formulations may suffer from over-conservatism or over-confidence. In this paper, we assume that only a finite set of model parametric uncertainty samples is available and formulate a distributionally robust chance-constrained program (DRCCP) for control synthesis with CBF safety and CLF stability guarantees. To facilitate efficient computation of control inputs during online execution, we present a reformulation of the DRCCP as a second-order cone program (SOCP). Our formulation is evaluated in an adaptive cruise control example in comparison to 1) a baseline CLF-CBF quadratic programming approach, 2) a robust approach that assumes known error bounds of the system uncertainty, and 3) a chance-constrained approach that assumes a known Gaussian Process distribution of the uncertainty.

math.OC↗

Using data informativity for online stabilization of unknown switched linear systems

This work studies data-driven switched controller design for discrete-time switched linear systems. Instead of having access to the full system dynamics, an initialization phase is performed, during which noiseless measurements of the state and the input are collected for each mode. Under certain conditions on these measurements, we develop a stabilizing switched controller for the switched system. To be precise, the controller switches between identifying the active mode of the system and applying a predetermined stabilizing feedback. We prove that if the system switches according to certain specifications, this controller stabilizes the closed-loop system. Simulations on a network example illustrate our approach.

math.OC↗

Informativity for centralized design of distributed controllers for networked systems

Recent work in data-driven control has led to methods that find stabilizing controllers directly from measurements of an unknown system. However, for multi-agent systems we are often interested in finding controllers that take their distributed nature into account. For instance, the full state might not be available for feedback at every agent. In order to deal with such information, we consider the problem of finding a feedback controller with a given block structure based on measured data. Moreover, we provide an algorithm that, if it converges, leads to a maximally sparse controller.

math.OC↗

Learning Invariant Stabilizing Controllers for Frequency Regulation under Variable Inertia

Declines in cost and concerns about the environmental impact of traditional generation have boosted the penetration of renewables and non-conventional distributed energy resources into the power grid. The intermittent availability of these resources causes the inertia of the power system to vary over time. As a result, there is a need to go beyond traditional controllers designed to regulate frequency under the assumption of invariant dynamics. This paper presents a learning-based framework for the design of stable controllers based on imitating datasets obtained from linear-quadratic regulator (LQR) formulations for different switching sequences of inertia modes. The proposed controller is linear and invariant, thereby interpretable, does not require the knowledge of the current operating mode, and is guaranteed to stabilize the switching power dynamics. We also show that it is always possible to stabilize the switched system using a communication-free local controller, whose implementation only requires each node to use its own state. Simulations on a 12-bus 3-region network illustrate our results.

eess.SY↗

Agent-Supervisor Coordination for Decentralized Event-Triggered Optimization

This paper proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions which combine locally evaluable costs with network-wide coupling components. These methods are well suited for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.

eess.SY↗

Time-Varying Optimization of LTI Systems via Projected Primal-Dual Gradient Flows

This paper investigates the problem of regulating in real time a linear dynamical system to the solution trajectory of a time-varying constrained convex optimization problem. The proposed feedback controller is based on an adaptation of the saddle-flow dynamics, modified to take into account projections on constraint sets and output-feedback from the plant. We derive sufficient conditions on the tunable parameters of the controller (inherently related to the time-scale separation between plant and controller dynamics) to guarantee exponential and input-to-state stability of the closed-loop system. The analysis is tailored to the case of time-varying strongly convex cost functions and polytopic output constraints. The theoretical results are further validated in a ramp metering control problem in a network of traffic highways.

math.OC↗

Data-Driven Synthesis of Optimization-Based Controllers for Regulation of Unknown Linear Systems

This paper proposes a data-driven framework to solve time-varying optimization problems associated with unknown linear dynamical systems. Making online control decisions to regulate a dynamical system to the solution of an optimization problem is a central goal in many modern engineering applications. Yet, the available methods critically rely on a precise knowledge of the system dynamics, thus mandating a preliminary system identification phase before a controller can be designed. In this work, we leverage results from behavioral theory to show that the steady-state transfer function of a linear system can be computed from data samples without any knowledge or estimation of the system model. We then use this data-driven representation to design a controller, inspired by a gradient-descent optimization method, that regulates the system to the solution of a convex optimization problem, without requiring any knowledge of the time-varying disturbances affecting the model equation. Results are tailored to cost functions satisfy the Polyak-Łojasiewicz inequality.

math.OC↗