Search

We propose a system theoretic approach to select and stabilize the endemic equilibrium of an SIRS epidemic model in which the decisions of a population of strategically interacting agents determine the transmission rate. Specifically, the population's agents recurrently revise their choices out of a set of strategies that impact to varying levels the transmission rate. A payoff vector quantifying the incentives provided by a planner for each strategy, after deducting the strategies' intrinsic costs, influences the revision process. An evolutionary dynamics model captures the population's preferences in the revision process by specifying as a function of the payoff vector the rates at which the agents' choices flow toward strategies with higher payoffs. Our main result is a dynamic payoff mechanism that is guaranteed to steer the epidemic variables (via incentives to the population) to the endemic equilibrium with the smallest infectious fraction, subject to cost constraints. We use a Lyapunov function not only to establish convergence but also to obtain an (anytime) upper bound for the peak size of the population's infectious portion., Comment: 12 pages, 3 figures

Motivated by the goal of learning controllers for complex systems whose dynamics change over time, we consider the problem of designing control laws for systems that switch among a finite set of unknown discrete-time linear subsystems under unknown switching signals. To this end, we propose a method that uses data to directly design a control mechanism without any explicit identification step. Our approach is online, meaning that the data are collected over time while the system is evolving in closed-loop, and are directly used to iteratively update the controller. A major benefit of the proposed online implementation is therefore the ability of the controller to automatically adjust to changes in the operating mode of the system. We show that the proposed control mechanism guarantees stability of the closed-loop switched linear system provided that the switching is slow enough. Effectiveness of the proposed design technique is illustrated for two aerospace applications.

We consider the optimal control problem of steering an agent population to a desired distribution over an infinite horizon. This is an optimal transport problem over dynamical systems, which is challenging due to its high computational cost. In this paper, by using entropy regularization, we propose Sinkhorn MPC, which is a dynamical transport algorithm integrating model predictive control (MPC) and the so-called Sinkhorn algorithm. The notable feature of the proposed method is that it achieves cost-effective transport in real time by performing control and transport planning simultaneously, which is illustrated in numerical examples. Moreover, under some assumption on iterations of the Sinkhorn algorithm integrated in MPC, we reveal the global convergence property for Sinkhorn MPC thanks to the entropy regularization. Furthermore, focusing on a quadratic control cost, without the aforementioned assumption we show the ultimate boundedness and the local asymptotic stability for Sinkhorn MPC., Accepted to Automatica. arXiv admin note: text overlap with arXiv:2203.08415

We study a diagnosis scheme to reliably detect the active mode of discrete-time, switched affine systems in the presence of measurement noise and asynchronous switching. The proposed scheme consists of two parts: (i) the construction of a bank of filters, and (ii) the introduction of a residual/threshold-based diagnosis rule. We develop an exact finite optimization-based framework to numerically solve an optimal bank of filters in which the contribution of measurement noise to the residual is minimized. The design problem is safely approximated through linear matrix inequalities and thus becomes tractable. We further propose a thresholding policy along with probabilistic false-alarm guarantees to estimate the active system mode in real-time. In comparison with the existing results, the guarantees improve from a polynomial dependency in the probability of false alarm to a logarithmic form. This improvement is achieved under the additional assumption of sub-Gaussianity, which is expected in many applications. The performance of the proposed approach is validated through a numerical example and an application of the building radiant system., Comment: 25 pages, 15 figures

This paper is concerned with data-driven optimal control of nonlinear systems. We present a convex formulation to the optimal control problem (OCP) with a discounted cost function. We consider OCP with both positive and negative discount factor. The convex approach relies on lifting nonlinear system dynamics in the space of densities using the linear Perron-Frobenius (P-F) operator. This lifting leads to an infinite-dimensional convex optimization formulation of the optimal control problem. The data-driven approximation of the optimization problem relies on the approximation of the Koopman operator using the polynomial basis function. We write the approximate finite-dimensional optimization problem as a polynomial optimization which is then solved efficiently using a sum-of-squares-based optimization framework. Simulation results are presented to demonstrate the efficacy of the developed data-driven optimal control framework.

The notion of reproducing kernel Hilbert space (RKHS) has emerged in system identification during the past decade. In the resulting framework, the impulse response estimation problem is formulated as a regularized optimization defined on an infinite-dimensional RKHS consisting of stable impulse responses. The consequent estimation problem is well-defined under the central assumption that the convolution operators restricted to the RKHS are continuous linear functionals. Moreover, according to this assumption, the representer theorem hold, and therefore, the impulse response can be estimated by solving a finite-dimensional program. Thus, the continuity feature plays a significant role in kernel-based system identification. We show that this central assumption is guaranteed to be satisfied in considerably general situations, namely when the input signal is bounded, the kernel is an integrable function, and in the case of continuous-time dynamics, continuous. Furthermore, the strong convexity of the optimization problem and the continuity property of the convolution operators imply that the kernel-based system identification admits a unique solution. Consequently, it follows that kernel-based system identification is a well-defined approach. ISSN:0005-1098

The inverse linear-quadratic optimal control problem is a system identification problem whose aim is to recover the quadratic cost function and hence the closed-loop system matrices based on observations of optimal trajectories. In this paper, the discrete-time, finite-horizon case is considered, where the agents are also assumed to be homogeneous and indistinguishable. The latter means that the agents all have the same dynamics and objective functions and the observations are in terms of "snap shots" of all agents at different time instants, but what is not known is "which agent moved where" for consecutive observations. This absence of linked optimal trajectories makes the problem challenging. We first show that this problem is globally identifiable. Then, for the case of noiseless observations, we show that the true cost matrix, and hence the closed-loop system matrices, can be recovered as the unique global optimal solution to a convex optimization problem. Next, for the case of noisy observations, we formulate an estimator as the unique global optimal solution to a modified convex optimization problem. Moreover, the statistical consistency of this estimator is shown. Finally, the performance of the proposed method is demonstrated by a number of numerical examples., 16 pages, 3 figures. Revision; in particular, somewhat larger updates to sections 3 and 6

The task of inducing, via continuous static state-feedback control, an asymptotically stable heteroclinic orbit in a nonlinear control system is considered in this paper. The main motivation comes from the problem of ensuring convergence to a so-called point-to-point maneuver in an underactuated mechanical system. Namely, to a smooth curve in its state--control space, which is consistent with the system dynamics and connects two (linearly) stabilizable equilibrium points. The proposed method uses a particular parameterization, together with a state projection onto the maneuver as to combine two linearization techniques for this purpose: the Jacobian linearization at the equilibria on the boundaries and a transverse linearization along the orbit. This allows for the computation of stabilizing control gains offline by solving a semidefinite programming problem. The resulting nonlinear controller, which simultaneously asymptotically stabilizes both the orbit and the final equilibrium, is time-invariant, locally Lipschitz continuous, requires no switching, and has a familiar feedforward plus feedback--like structure. The method is also complemented by synchronization function--based arguments for planning such maneuvers for mechanical systems with one degree of underactuation. Numerical simulations of the non-prehensile manipulation task of a ball rolling between two points upon the "butterfly" robot demonstrates the efficacy of the synthesis., Comment: Accepted for publication in Automatica

We address the problem of designing a stabilizing closed-loop control law directly from input and state measurements collected in an experiment. In the presence of a process disturbance in data, we have that a set of dynamics could have generated the collected data and we need the designed controller to stabilize such set of data-consistent dynamics robustly. For this problem of data-driven control with noisy data, we advocate the use of a popular tool from robust control, Petersen’s lemma. In the cases of data generated by linear and polynomial systems, we conveniently express the uncertainty captured in the set of data-consistent dynamics through a matrix ellipsoid, and we show that a specific form of this matrix ellipsoid makes it possible to apply Petersen’s lemma to all of the mentioned cases. In this way, we obtain necessary and sufficient conditions for data-driven stabilization of linear systems through a linear matrix inequality. The matrix ellipsoid representation enables insights and interpretations of the designed control laws. In the same way, we also obtain sufficient conditions for data-driven stabilization of polynomial systems through alternate (convex) sum-of-squares programs. The findings are illustrated numerically.

This paper addresses the derivation of generic and tractable sufficient conditions ensuring the stability of a coupled system composed of a reaction-diffusion partial differential equation (PDE) and a finite-dimensional linear time invariant ordinary differential equation (ODE). The coupling of the PDE with the ODE is located either at the boundaries or in the domain of the reaction-diffusion equation and takes the form of the input and output of the ODE. We investigate boundary Dirichlet/Neumann/Robin couplings, as well as in-domain Dirichlet/Neumann couplings. The adopted approach relies on the spectral reduction of the problem by projecting the trajectory of the PDE into a Hilbert basis composed of the eigenvectors of the underlying Sturm-Liouville operator and yields a set of sufficient stability conditions taking the form of LMIs. We propose numerical examples, consisting of an unstable reaction-diffusion equation and an unstable ODE, such that the application of the derived stability conditions ensure the stability of the resulting coupled PDE-ODE system.

In this paper we consider distributed adaptive stabilization for uncertain multivariable linear systems with a time-varying diagonal matrix gain. We show that uncertain multivariable linear systems are stabilizable by diagonal matrix high gains if the system matrix is an H-matrix with positive diagonal entries. Based on matrix measure and stability theory for diagonally dominant systems, we consider two classes of uncertain linear systems, and derive a threshold condition to ensure their exponential stability by a monotonically increasing diagonal gain matrix. When each individual gain function in the matrix gain is updated by state-dependent functions using only local state information, the boundedness and convergence of both system states and adaptive matrix gains are guaranteed. We apply the adaptive distributed stabilization approach to adaptive synchronization control for large-scale complex networks consisting of nonlinear node dynamics and time-varying coupling weights. A unified framework for adaptive synchronization is proposed that includes several general design approaches for adaptive coupling weights to guarantee network synchronization., Comment: 16 Pages and 7 figures

This paper studies the application of the blended dynamics approach towards distributed optimization problem where the global cost function is given by a sum of local cost functions. The benefits include (i) individual cost function need not be convex as long as the global cost function is strongly convex and (ii) the convergence rate of the distributed algorithm is arbitrarily close to the convergence rate of the centralized one. Two particular continuous-time algorithms are presented using the proportional-integral-type couplings. One has benefit of `initialization-free,' so that agents can join or leave the network during the operation. The other one has the minimal amount of communication information. After presenting a general theorem that can be used for designing distributed algorithms, we particularly present a distributed heavy-ball method and discuss its strength over other methods.

This paper presents a new approach to solve linear and nonlinear model predictive control (MPC) problems that requires small memory footprint and throughput and is particularly suitable when the model and/or controller parameters change at runtime. Typically MPC requires two phases: 1) construct an optimization problem based on the given MPC parameters (prediction model, tuning weights, prediction horizon, and constraints), which results in a quadratic or nonlinear programming problem, and then 2) call an optimization algorithm to solve the resulting problem. In the proposed approach the problem construction step is systematically eliminated, as in the optimization algorithm problem matrices are expressed in terms of abstract functions of the MPC parameters. We present a unifying algorithmic framework based on active-set methods with bounded variables that can cope with linear, nonlinear, and adaptive MPC variants based on a broad class of prediction models and a sum-of-squares cost function. The theoretical and numerical results demonstrate the potential, applicability, and efficiency of the proposed framework for practical real-time embedded MPC.

This paper considers maximum-a-posteriori (MAP) and linear discriminant based MAP detectors to detect changes in the mean and covariance of a stochastic input, driving specific network nodes, using noisy measurements from sensors non-collocated with the input nodes. We explicitly characterize both detectors' performance in terms of the network edge weights and input and sensor nodes' location. In the asymptotic measurement regime, when the input and measurement noise are jointly Gaussian, we show that the detectors' performance can be studied using the input to output gain of the system's transfer function matrix. Using this result, we obtain conditions for which the detection performance associated with the sensors on a given network cut is better (or worse) than that of the sensors associated with the subnetwork induced by the cut and not containing the input nodes. Our results also provide structural insights into the sensor placement from a detection-theoretic viewpoint. We validate our theoretical findings via multiple numerical examples., 14 pages; 6 figures; submitted to Automatica

This article addresses the problem of average consensus in a multi-agent system when the desired consensus quantity is a time varying signal. Recently, the EDCHO protocol leveraged high order sliding modes to achieve exact consensus under a constrained set of initial conditions, limiting its applicability to static networks. In this work, we propose REDCHO, an extension of the previous protocol which is robust to mismatch in the initial conditions, making it suitable to use cases in which connection and disconnection of agents is possible. The convergence properties of the protocol are formally explored. Finally, the effectiveness and advantages of our proposal are shown with concrete simulation examples showing the benefits of REDCHO against other methods in the literature., This is the preprint version of the accepted Manuscript: Rodrigo Aldana-Lopez, Rosario Aragues, Carlos Sagues, REDCHO: Robust Exact Dynamic Consensus of High Order, Automatica, Volume 141, 2022, ISSN 0005-1098

We present a Pontryagin maximum principle for discrete time optimal control problems with (a) pointwise constraints on the control actions and the states, (b) frequency constraints on the control and the state trajectories, and (c) nonsmooth dynamical systems. Pointwise constraints on the states and the control actions represent desired and/or physical limitations on the states and the control values; such constraints are important and are widely present in the optimal control literature. Constraints of the type (b), while less standard in the literature, effectively serve the purpose of describing important spectral properties of inertial actuators and systems. The conjunction of constraints of the type (a) and (b) is a relatively new phenomenon in optimal control but are important for the synthesis control trajectories with a high degree of fidelity. The maximum principle established here provides first order necessary conditions for optimality that serve as a starting point for the synthesis of control trajectories corresponding to a large class of constrained motion planning problems that have high accuracy in a computationally tractable fashion. Moreover, the ability to handle a reasonably large class of nonsmooth dynamical systems that arise in practice ensures broad applicability our theory, and we include several illustrations of our results on standard problems.

The paper provides results for the stabilization of a spatially uniform equilibrium profile for a scalar conservation law that arises in the study of traffic dynamics under variable speed limit control. Two different control problems are studied: the problem with free speed limits at the inlet and the problem with no speed limits at the inlet. Explicit formulas are provided for respective feedback laws that guarantee stabilization of the desired equilibrium profile. For the first problem, global asymptotic stabilization is achieved; while for the second problem, regional exponential stabilization is achieved. Moreover, the solutions for the corresponding closed-loop systems are guaranteed to be classical solutions, i.e., there are no shocks. The obtained results are illustrated by means of a numerical example., Comment: 18 pages, 7 figures, submitted to Automatica for possible publication

For parabolic PDEs, we present a new certainty equivalence-based adaptive boundary control scheme with a least-squares identifier of an event-triggering type, where the triggering is based on the size of the regulation error (as opposed to the identifier updates being triggered by the estimation error, or the control changes being triggered by the regulation error). The scheme guarantees exponential convergence of the state to zero in the L2 norm and a finite-time convergence of the parameter estimates to the true values of the unknown parameters. The scheme is developed for a specific benchmark problem with Dirichlet actuation, where the only unknown parameters are the reaction coefficient and the high-frequency gain. For this specific problem, no existing adaptive scheme can handle the unknown high-frequency gain. An illustrative example allows the comparison with other adaptive control design methodologies., 26 pages, 4 figures, submitted to Automatica for possible publication

The goal of this paper is to assess the robustness of an uncertain linear time-varying (LTV) system on a finite time horizon. The uncertain system is modeled as a connection of a known LTV system and a perturbation. The input/output behavior of the perturbation is described by time-domain, integral quadratic constraints (IQCs). Typical notions of robustness, e.g. nominal stability and gain/phase margins, can be insufficient for finite-horizon analysis. Instead, this paper focuses on robust induced gains and bounds on the reachable set of states. Sufficient conditions to compute robust performance bounds are formulated using dissipation inequalities and IQCs. The analysis conditions are provided in two equivalent forms as Riccati differential equations and differential linear matrix inequalities. A computational approach is provided that leverages both forms of the analysis conditions. The approach is demonstrated with two examples

We study a general class of entropy-regularized multi-variate LQG mean field games (MFGs) in continuous time with $K$ distinct sub-population of agents. We extend the notion of actions to action distributions (exploratory actions), and explicitly derive the optimal action distributions for individual agents in the limiting MFG. We demonstrate that the optimal set of action distributions yields an $\epsilon$-Nash equilibrium for the finite-population entropy-regularized MFG. Furthermore, we compare the resulting solutions with those of classical LQG MFGs and establish the equivalence of their existence., Comment: To appear in Automatica

This paper studies the problem of constructing in-block controllable (IBC) regions for affine systems. That is, we are concerned with constructing regions in the state space of affine systems such that all the states in the interior of the region are mutually accessible through the region's interior by applying uniformly bounded inputs. We first show that existing results for checking in-block controllability on given polytopic regions cannot be easily extended to address the question of constructing IBC regions. We then explore the geometry of the problem to provide a computationally efficient algorithm for constructing IBC regions. We also prove the soundness of the algorithm. We then use the proposed algorithm to construct safe speed profiles for different robotic systems, including fully-actuated robots, ground robots modeled as unicycles with acceleration limits, and unmanned aerial vehicles (UAVs). Finally, we present several experimental results on UAVs to verify the effectiveness of the proposed algorithm. For instance, we use the proposed algorithm for real-time collision avoidance for UAVs., 17 pages, 18 figures, under review for publication in Automatica

We investigate the performance and robustness of distributed averaging integral controllers used in the optimal frequency regulation of power networks. We construct a strict Lyapunov function that allows us to quantify the exponential convergence rate of the closed-loop system. As an application, we study the stability of the system in the presence of disruptions to the controllers' communication network, and investigate how the convergence rate is affected by these disruptions. (C) 2018 Elsevier Ltd. All rights reserved.

The paper addresses large-scale, convex optimization problems that need to be solved in a distributed way by agents communicating according to a random time-varying graph. Specifically, the goal of the network is to minimize the sum of local costs, while satisfying local and coupling constraints. Agents communicate according to a time-varying model in which edges of an underlying connected graph are active at each iteration with certain non-uniform probabilities. By relying on a primal decomposition scheme applied to an equivalent problem reformulation, we propose a novel distributed algorithm in which agents negotiate a local allocation of the total resource only with neighbors with active communication links. The algorithm is studied as a subgradient method with block-wise updates, in which blocks correspond to the graph edges that are active at each iteration. Thanks to this analysis approach, we show almost sure convergence to the optimal cost of the original problem and almost sure asymptotic primal recovery without resorting to averaging mechanisms typically employed in dual decomposition schemes. Explicit sublinear convergence rates are provided under the assumption of diminishing and constant step-sizes. Finally, an extensive numerical study on a plug-in electric vehicle charging problem corroborates the theoretical results.

Input estimation is a signal processing technique associated with deconvolution of measured signals after filtering through a known dynamic system. Kitanidis and others extended this to the simultaneous estimation of the input signal and the state of the intervening system. This is normally posed as a special least-squares estimation problem with unbiasedness. The approach has application in signal analysis and in control. Despite the connection to optimal estimation, the standard algorithms are not necessarily stable, leading to a number of recent papers which present sufficient conditions for stability. In this paper we complete these stability results in two ways in the time-invariant case: for the square case, where the number of measurements equals the number of unknown inputs, we establish exactly the location of the algorithm poles; for the non-square case, we show that the best sufficient conditions are also necessary. We then draw on our previous results interpreting these algorithms, when stable, as singular Kalman filters to advocate a direct, guaranteed stable implementation via Kalman filtering. This has the advantage of clarity and flexibility in addition to stability. En route, we decipher the existing algorithms in terms of system inversion and successive singular filtering. The stability results are extended to the time-varying case directly to recover the earlier sufficient conditions for stability via the Riccati difference equation., Comment: 9 pages, two-column format, one figure of two parts

We develop a data-driven approach to the computation of a-posteriori feasibility certificates to the solution sets of variational inequalities affected by uncertainty. Specifically, we focus on instances of variational inequalities with a deterministic mapping and an uncertain feasibility set, and represent uncertainty by means of scenarios. Building upon recent advances in the scenario approach literature, we quantify the robustness properties of the entire set of solutions of a variational inequality, with feasibility set constructed using the scenario approach, against a new unseen realization of the uncertainty. Our results extend existing results that typically impose an assumption that the solution set is a singleton and require certain non-degeneracy properties, and thereby offer probabilistic feasibility guarantees to any feasible solution. We show that assessing the violation probability of an entire set of solutions, rather than of a singleton, requires enumeration of the support constraints that "shape" this set. Additionally, we propose a general procedure to enumerate the support constraints that does not require a closed form description of the solution set, which is unlikely to be available. We show that robust game theory problems can be modelling via uncertain variational inequalities, and illustrate our theoretical results through extensive numerical simulations on a case study involving an electric vehicle charging coordination problem.

This paper considers the problem of steering the aggregative behavior of a population of noncooperative price-taking agents towards a desired behavior. Different from conventional pricing schemes where the price is fully available for design, we consider the scenario where a system regulator broadcasts a price prediction signal that can be different from the actual price incurred by the agents. The resulting reliability issues are taken into account by including trust dynamics in our model, implying that the agents will not blindly follow the signal sent by the regulator, but rather follow it based on the history of its accuracy, i.e, its deviation from the actual price. We present several nudge mechanisms to generate suitable price prediction signals that are able to steer the aggregative behavior of the agents to stationary as well as temporal desired aggregative behaviors. We provide analytical convergence guarantees for the resulting multi-components models. In particular, we prove that the proposed nudge mechanisms earn and maintain full trust of the agents, and the aggregative behavior converges to the desired one. The analytical results are complemented by a numerical case study of coordinated charging of plug-in electric vehicles.

The takeoff point of this paper is to generalize the existing stock trading results for a class of affine feedback controller to include consideration of a stop-loss order. Using the geometric Brownian motion as the underlying stock price model, our main result is to provide a closed-form expression for the cumulative distribution function for the trading profit or loss. In addition, we show that the affine feedback controller with stop-loss order indeed generalizes the result without stop order in the sense of distribution function. Some simulations and illustrative examples are also provided as supporting evidence of the theory. Moreover, we provide some technical results aimed at addressing the issues about survivability, cash-financing considerations, long-only property, and lower bound of the expected gain or loss., SIAM Journal on Control and Optimization (SICON)

This paper presents a heterogeneously parameterized tube-based model predictive control (MPC) design applicable to linear parameter-varying (LPV) systems. In a heterogeneous tube, the parameterizations of the tube cross sections and the associated control laws are allowed to vary along the prediction horizon. Two extreme cases that can be described in this framework are scenario MPC (high complexity, larger domain of attraction) and homothetic tube MPC with a simple time-invariant control parameterization (low complexity, smaller domain of attraction). In the proposed framework, these extreme parameterizations, as well as other parameterizations of intermediate complexity, can be combined within a single tube. By allowing for more flexibility in the parameterization design, one can influence the trade-off between computational cost and the size of the domain of attraction. Sufficient conditions on the parameterization structure are developed under which recursive feasibility and closed-loop stability are guaranteed. A specific parameterization that combines the principles of scenario and homothetic tube MPC is proposed and it is shown to satisfy the required conditions. The properties of the approach, including its capability of achieving improved complexity/performance trade-offs, are demonstrated using two numerical examples., Final author's version of a paper accepted for publication in Automatica

State convergence is essential in several scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, monotone game theory, multi-agent learning over time-varying networks. This paper is the first on state convergence in both continuous- and discrete-time linear systems affected by polytopic uncertainty. First, we characterize state convergence in linear time invariant systems via equivalent necessary and sufficient conditions. In the presence of uncertainty, we complement the canonical definition of (weak) convergence with a stronger notion of convergence, which requires the existence of a common kernel among the generator matrices of the difference/differential inclusion (strong convergence). We investigate under which conditions the two definitions are equivalent. Then, we characterize weak and strong convergence by means of Lyapunov and LaSalle arguments, (linear) matrix inequalities and separability of the eigenvalues of the generator matrices. We also show that, unlike asymptotic stability, state convergence lacks of duality.

International audience; We study Max-Product and Max-Plus Systems with Markovian Jumps and focus on stochastic stability problems. At first, a Lyapunov function is derived for the asymptotically stable deterministic Max-Product Systems. This Lyapunov function is then adjusted to derive sufficient conditions for the stochastic stability of Max-Product systems with Markovian Jumps. Many step Lyapunov functions are then used to derive necessary and sufficient conditions for stochastic stability. The results for the Max-Product systems are then applied to Max-Plus systems with Markovian Jumps, using an isomorphism and almost sure bounds for the asymptotic behavior of the state are obtained. A numerical example illustrating the application of the stability results on a production system is also given.

A probabilistic framework is proposed for the optimization of efficient switched control strategies for physical systems dominated by stochastic excitation. In this framework, the equation for the state trajectory is replaced with an equivalent equation for its probability distribution function in the constrained optimization setting. This allows for a large class of control rules to be considered, including hysteresis and a mix of continuous and discrete random variables. The problem of steering atmospheric balloons within a stratified flowfield is a motivating application; the same approach can be extended to a variety of mixed-variable stochastic systems and to new classes of control rules., 6 pages, 4 figures

This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication between players is considered to be limited. A generalized communication graph is designed so that players exchange only their required information. An algorithm is designed whereby players, with possibly partially-coupled cost functions, make decisions based on the estimates of other players' actions obtained from local neighbors. It is shown that this choice of communication graph guarantees that all players' information is exchanged after sufficiently many iterations. Using a set of standard assumptions on the cost functions, the interference and the communication graphs, almost sure convergence to a Nash equilibrium is proved for diminishing step sizes. Moreover, the case when the cost functions are not known by the players is investigated and a convergence proof is presented for diminishing step sizes. The effect of the second largest eigenvalue of the expected communication matrix on the convergence rate is quantified. The trade-off between parameters associated with the communication graph and the ones associated with the interference graph is illustrated. Numerical results are presented for a large-scale networked game.

The paper provides results for the application of boundary feedback control with Zero-Order-Hold (ZOH) to 1-D linear parabolic systems on bounded domains. It is shown that the continuous-time boundary feedback applied in a sample-and-hold fashion guarantees closed-loop exponential stability, provided that the sampling period is sufficiently small. Two different continuous-time feedback designs are considered: the reduced model design and the backstepping design. The obtained results provide stability estimates for weighted 2-norms of the state and robustness with respect to perturbations of the sampling schedule is guaranteed., 22 pages, submitted to Automatica for possible publication

Sensor and actuator selection problems (SASPs) are some of the core problems in dynamic systems design and control. These problems correspond to determining the optimal selection of sensors (measurements) or actuators (control nodes) such that certain estimation/control objectives can be achieved. While the literature on SASPs are indeed inveterate, the vast majority of the work focuses on linear(ized) representation of the network dynamics, resulting in the placements of sensors or actuators (SAs) that are valid for confined operating regions. As an alternative, herein we propose a new general framework for addressing SASPs in nonlinear dynamic systems (NDSs), assuming that the inputs and outputs are linearly coupled with the nonlinear dynamics. This is investigated through (i) classifying and parameterizing the NDSs into various nonlinear function sets, (ii) utilizing rich Lyapunov theoretic formulations, and (iii) designing a new customized branch-and-bound (BnB) algorithm that exploits problem structure of the SASPs. The newly designed BnB routines are computationally more attractive than the standard one and also directly applicable to solve SASPs for linear systems. In contrast with contemporary approaches from the literature, our approach is suitable for finding the optimal SAs combination for stable/unstable NDSs that ensures stabilization of estimation error and closed-loop dynamics through a simple linear feedback control policy.

This paper is concerned with the regulation control of a one-dimensional reaction-diffusion equation in the presence of a state-delay in the reaction term. The objective is to achieve the PI regulation of the right Dirichlet trace with a command selected as the left Dirichlet trace. The control design strategy consists of the design of a PI controller on a finite dimensional truncated model obtained by spectral reduction. By an adequate selection of the number of modes of the original infinite-dimensional system, we show that the proposed control design procedure achieves both the exponential stabilization of the original infinite-dimensional system as well as the setpoint regulation of the right Dirichlet trace., Accepted for publication in Automatica

This paper describes an optimization framework to control a distributed parameter system (DPS) using a team of mobile actuators. The framework simultaneously seeks optimal control of the DPS and optimal guidance of the mobile actuators such that a cost function associated with both the DPS and the mobile actuators is minimized subject to the dynamics of each. The cost incurred from controlling the DPS is linear-quadratic, which is transformed into an equivalent form as a quadratic term associated with an operator-valued Riccati equation. This equivalent form reduces the problem to seeking for guidance only because the optimal control can be recovered once the optimal guidance is obtained. We establish conditions for the existence of a solution to the proposed problem. Since computing an optimal solution requires approximation, we also establish the conditions for convergence to the exact optimal solution of the approximate optimal solution. That is, when evaluating these two solutions by the original cost function, the difference becomes arbitrarily small as the approximation gets finer. Two numerical examples demonstrate the performance of the optimal control and guidance obtained from the proposed approach., Comment: Proofs for Lemmas~2.3, 2.5, and D.1 are attached in the supplement at the end

In this paper, we present an interpolation framework for structure-preserving model order reduction of parametric bilinear dynamical systems. We introduce a general setting, covering a broad variety of different structures for parametric bilinear systems, and then provide conditions on projection spaces for the interpolation of structured subsystem transfer functions such that the system structure and parameter dependencies are preserved in the reduced-order model. Two benchmark examples with different parameter dependencies are used to demonstrate the theoretical analysis., Comment: 10 pages, 2 figures

This paper is concerned with coherent quantum linear quadratic Gaussian (CQLQG) control. The problem is to find a stabilizing measurement-free quantum controller for a quantum plant so as to minimize a mean square cost for the fully quantum closed-loop system. The plant and controller are open quantum systems interconnected through bosonic quantum fields. In comparison with the observation–actuation structure of classical controllers, coherent quantum feedback is less invasive to the quantum dynamics. The plant and controller variables satisfy the canonical commutation relations (CCRs) of a quantum harmonic oscillator and are governed by linear quantum stochastic differential equations (QSDEs). In order to correspond to such oscillators, these QSDEs must satisfy physical realizability (PR) conditions in the form of quadratic constraints on the state-space matrices, reflecting the CCR preservation in time. The symmetry of the problem is taken into account by introducing equivalence classes of coherent quantum controllers generated by symplectic similarity transformations. We discuss a modified gradient flow, which is concerned with norm-balanced realizations of controllers. A line-search gradient descent algorithm with adaptive stepsize selection is proposed for the numerical solution of the CQLQG control problem. The algorithm finds a local minimum of the LQG cost over the parameters of the Hamiltonian and coupling operators of a stabilizing coherent quantum controller, thus taking the PR constraints into account. A convergence analysis of the algorithm is presented. Numerical examples of designing locally optimal CQLQG controllers are provided in order to demonstrate the algorithm performance.

We tackle the problem of trajectory planning in an environment comprised of a set of obstacles with uncertain time-varying locations. The uncertainties are modeled using widely accepted Gaussian distributions, resulting in a chance-constrained program. Contrary to previous approaches however, we do not assume perfect knowledge of the moments of the distribution, and instead estimate them through finite samples available from either sensors or past data. We derive tight concentration bounds on the error of these estimates to sufficiently tighten the chance-constraint program. As such, we provide provable guarantees on satisfaction of the chance-constraints corresponding to the nominal yet unknown moments. We illustrate our results with two autonomous vehicle trajectory planning case studies., Automatica, 131, ISSN:0005-1098

This paper investigates the problem of straight-line path following for magnetic helical microswimmers. The control objective is to make the helical microswimmer to converge to a straight line without violating the step-out frequency constraint. The proposed feedback control solution is based on an optimal decision strategy (ODS) that is cast as a trust-region subproblem (TRS), i.e., a quadratic program over a sphere. The ODS-based control strategy minimizes the difference between the microrobot velocity and an integral line-of-sight (ILOS)-based reference vector field while respecting the magnetic saturation constraints and ensuring the absolute continuity of the control input. Due to the embedded integral action in the reference vector field, the microswimmer will follow the desired straight line by compensating for the drift effect of the environmental disturbances as well as the microswimmer weight., Comment: Published in Automatica (March 2021)

This work attempts to approximate a linear Gaussian system with a finite-state hidden Markov model (HMM), which is found useful in solving sophisticated event-based state estimation problems. An indirect modeling approach is developed, wherein a state space model (SSM) is firstly identified for a Gaussian system and the SSM is then used as an emulator for learning an HMM. In the proposed method, the training data for the HMM are obtained from the data generated by the SSM through building a quantization mapping. Parameter learning algorithms are designed to learn the parameters of the HMM, through exploiting the periodical structural characteristics of the HMM. The convergence and asymptotic properties of the proposed algorithms are analyzed. The HMM learned using the proposed algorithms is applied to event-triggered state estimation, and numerical results on model learning and state estimation demonstrate the validity of the proposed algorithms., The manuscript is under review by a journal

We address the multi-agent persistent monitoring problem defined on a set of nodes (targets) interconnected over a network topology. A measure of mean overall node state uncertainty evaluated over a finite period is to be minimized by controlling the motion of a cooperating team of agents. To address this problem, we propose an event-driven receding horizon control approach that is computationally efficient, distributed and on-line. The proposed controller differs from the existing on-line gradient-based parametric controllers and off-line greedy cycle search methods that often lead to either low-performing local optima or computationally intensive centralized solutions. A critical novel element in this controller is that it automatically optimizes its planning horizon length, thus making it parameter-free. We show that explicit globally optimal solutions can be obtained for every distributed optimization problem encountered at each event where the receding horizon controller is invoked. Numerical results are provided showing improvements compared to state of the art distributed on-line parametric control solutions., Comment: Submitted to Automatica

We study a coherent-classical estimation scheme for a class of linear quantum systems, where the estimator is a mixed quantum-classical system that may or may not involve coherent feedback. We show that when the quantum plant or the quantum part of the estimator (coherent controller) is an annihilation operator only system, coherent-classical estimation without coherent feedback can provide no improvement over purely-classical estimation. Otherwise, coherent-classical estimation without feedback can be better than classical-only estimation for certain homodyne detector angles, although the former is inferior to the latter for the best choice of homodyne detector angle. Moreover, we show that coherent-classical estimation with coherent feedback is no better than classical-only estimation, when both the plant and the coherent controller are annihilation operator only systems. Otherwise, coherent-classical estimation with coherent feedback can be superior to purely-classical estimation, and in this case, the former is better than the latter for the optimal choice of homodyne detector angle., Comment: Minor corrections; 10 pages, 13 figures, journal version. arXiv admin note: substantial text overlap with arXiv:1403.5348

International audience; Microgrids have been identified as key components of modern electrical systems to facilitate the integration of renewable distributed generation units. Their analysis and controller design require the development of advanced (typically model-based) techniques naturally posing an interesting challenge to the control community. Although there are widely accepted reduced order models to describe the dynamic behavior of microgrids, they are typically presented without details about the reduction procedure—hampering the understanding of the physical phenomena behind them. Preceded by an introduction to basic notions and definitions in power systems, the present survey reviews key characteristics and main components of a microgrid. We introduce the reader to the basic functionality of DC/AC inverters, as well as to standard operating modes and control schemes of inverter-interfaced power sources in microgrid applications. Based on this exposition and starting from fundamental physics, we present detailed dynamical models of the main microgrid components. Furthermore, we clearly state the underlying assumptions which lead to the standard reduced model with inverters represented by controllable voltage sources, as well as static network and load representations, hence, providing a complete modular model derivation of a three-phase inverter-based microgrid.

In this paper the infinite horizon optimal regulation problem is solved online for a deterministic control-affine nonlinear dynamical system using the state following (StaF) kernel method to approximate the value function. Unlike traditional methods that aim to approximate a function over a large compact set, the StaF kernel method aims to approximate a function in a small neighborhood of a state that travels within a compact set. Simulation results demonstrate that stability and approximate optimality of the control system can be achieved with significantly fewer basis functions than may be required for global approximation methods.

Classical thermodynamics aimed to quantify the efficiency of thermodynamic engines by bounding the maximal amount of mechanical energy produced compared to the amount of heat required. While this was accomplished early on, by Carnot and Clausius, the more practical problem to quantify limits of power that can be delivered, remained elusive due to the fact that quasistatic processes require infinitely slow cycling, resulting in a vanishing power output. Recent insights, drawn from stochastic models, appear to bridge the gap between theory and practice in that they lead to physically meaningful expressions for the dissipation cost in operating a thermodynamic engine over a finite time window. Building on this framework of {\em stochastic thermodynamics} we derive bounds on the maximal power that can be drawn by cycling an overdamped ensemble of particles via a time-varying potential while alternating contact with heat baths of different temperature ($T_c$ cold, and $T_h$ hot). Specifically, assuming a suitable bound $M$ on the spatial gradient of the controlling potential, we show that the maximal achievable power is bounded by $\frac{M}{8}(\frac{T_h}{T_c}-1)$. Moreover, we show that this bound can be reached to within a factor of $(\frac{T_h}{T_c}-1)/(\frac{T_h}{T_c}+1)$ by operating the cyclic thermodynamic process with a quadratic potential., 24 pages, 1 figure, 1 table

The growing complexity of modern Cyber-Physical Systems (CPS) and the frequent communication between their components make them vulnerable to malicious attacks. As a result, secure state estimation is a critical requirement for the control of these systems. Many existing secure state estimation methods suffer from combinatorial complexity which grows with the number of states and sensors in the system. This complexity can be mitigated using optimization-based methods that relax the original state estimation problem, although at the cost of optimality as these methods often identify attack-free sensors as attacked. In this paper, we propose a new optimal graph-search algorithm to correctly identify malicious attacks and to securely estimate the states even in large-scale CPS modeled as linear time-invariant systems. The graph consists of layers, each one containing two nodes capturing a truth assignment of any given sensor, and directed edges connecting adjacent layers only. Then, our algorithm searches the layers of this graph incrementally, favoring directions at higher layers with more attack-free assignments, while actively managing a repository of nodes to be expanded at later iterations. The proposed search bias and the ability to revisit nodes in the repository and self-correct, allow our graph-search algorithm to reach the optimal assignment faster and tackle larger problems. We show that our algorithm is complete and optimal provided that process and measurement noises do not dominate the attack signal. Moreover, we provide numerical simulations that demonstrate the ability of our algorithm to correctly identify attacked sensors and securely reconstruct the state. Our simulations show that our method outperforms existing algorithms both in terms of optimality and execution time., Comment: 16 pages, 10 figures

Many large-scale and distributed optimization problems can be brought into a composite form in which the objective function is given by the sum of a smooth term and a nonsmooth regularizer. Such problems can be solved via a proximal gradient method and its variants, thereby generalizing gradient descent to a nonsmooth setup. In this paper, we view proximal algorithms as dynamical systems and leverage techniques from control theory to study their global properties. In particular, for problems with strongly convex objective functions, we utilize the theory of integral quadratic constraints to prove the global exponential stability of the equilibrium points of the differential equations that govern the evolution of proximal gradient and Douglas-Rachford splitting flows. In our analysis, we use the fact that these algorithms can be interpreted as variable-metric gradient methods on the suitable envelopes and exploit structural properties of the nonlinear terms that arise from the gradient of the smooth part of the objective function and the proximal operator associated with the nonsmooth regularizer. We also demonstrate that these envelopes can be obtained from the augmented Lagrangian associated with the original nonsmooth problem and establish conditions for global exponential convergence even in the absence of strong convexity., 8 pages; 1 figure

For time-invariant (nonimpulsive) systems, it is already well-known that the input-to-state stability (ISS) property is strictly stronger than integral input-to-state stability (iISS). Very recently, we have shown that under suitable uniform boundedness and continuity assumptions on the function defining system dynamics, ISS implies iISS also for time-varying systems. In this paper, we show that this implication remains true for impulsive systems, provided that asymptotic stability is understood in a sense stronger than usual for impulsive systems., Comment: Submitted to Automatica

This article treats two problems dealing with control of linear systems in the presence of a jammer that can sporadically turn off the control signal. The first problem treats the standard reachability problem, and the second treats the standard linear quadratic regulator problem under the above class of jamming signals. We provide necessary and sufficient conditions for optimality based on a nonsmooth Pontryagin maximum principle., 9 pages