Gianluca Bianchin

Given a network of agents, we study the problem of designing a distributed algorithm that computes $k$ independent weighted means of the network's initial conditions (namely, the agents agree on a $k$ -dimensional space). Akin to average consensus, this problem finds applications in distributed computing and sensing, where agents seek to simultaneously evaluate $k$ independent functions at a common point by running a single coordination algorithm. We show that linear algorithms can agree on quantities that are oblique projections of the vector of initial conditions, and we provide techniques to design protocols that are compatible with a pre-specified communication graph. More broadly, our results show that a single agreement algorithm can solve $k$ consensus problems simultaneously at a fraction of the complexity of classical approaches but, in general, it requires higher network connectivity.

Advanced traffic navigation systems, which provide routing recommendations to drivers based on real-time congestion information, are nowadays widely adopted by roadway transportation users. Yet, the emerging effects on the traffic dynamics originating from the widespread adoption of these technologies have remained largely unexplored until now. In this paper, we propose a dynamic model where drivers imitate the path preferences of previous drivers, and we study the properties of its equilibrium points. Our model is a dynamic generalization of the classical traffic assignment framework, and extends it by accounting for dynamics both in the path decision process and in the network's traffic flows. We show that, when travelers learn shortest paths by imitating other travelers, the overall traffic system benefits from this mechanism and transfers the maximum admissible amount of traffic demand. On the other hand, we demonstrate that, when the travel delay functions are not sufficiently steep or the rates at which drivers imitate previous travelers are not adequately chosen, the trajectories of the traffic system may fail to converge to an equilibrium point, thus compromising asymptotic stability. Illustrative numerical simulations combined with empirical data from highway sensors illustrate our findings.

We study the stability properties of a control system composed of a dynamical plant and a feedback controller, the latter generating control signals that can be compromised by a malicious attacker. We consider two classes of feedback controllers: a static output-feedback controller, and a dynamical gradient-flow controller that seeks to steer the output of the plant towards the solution of a convex optimization problem. In both cases, we analyze the stability properties of the closed-loop system under a class of switching attacks that persistently modify the control inputs generated by the controllers. Our stability analysis leverages the framework of hybrid dynamical systems, Lyapunov-based arguments for switching systems with unstable modes, and singular perturbation theory. Our results reveal that, under a suitable time-scale separation between plant and controllers, the stability of the interconnected system can be preserved when the attack occurs with "sufficiently low frequency" in any bounded time interval. We present simulation results in a power-grid example that corroborate the technical findings.

This paper proposes a data-driven control framework to regulate an unknown stochastic linear dynamical system to the solution of a stochastic convex optimization problem. Despite the centrality of this problem, most of the available methods critically rely on a precise knowledge of the system dynamics, thus requiring offline system identification. To solve the control problem, we first show that the steady-state gain of the transfer function of a linear system can be computed directly from historical data generated by the open-loop system, thus overcoming the need to first identify the full system dynamics. We leverage this data-driven representation of the steady-state gain to design a controller, which is inspired by stochastic gradient descent methods, to regulate the system to the solution of the prescribed optimization problem. A distinguishing feature of our method is that it does not require any knowledge of the system dynamics or of the possibly time-varying disturbances affecting them (or their distributions). Our technical analysis combines concepts from behavioral system theory, stochastic optimization with decision-dependent distributions, and Lyapunov stability. We illustrate the applicability of the framework in a case study for mobility-on-demand ride service scheduling in Manhattan.

This paper considers the problem of controlling a dynamical system when the state cannot be directly measured and the control performance metrics are unknown or only partially known. In particular, we focus on the design of data-driven controllers to regulate a dynamical system to the solution of a constrained convex optimization problem where: i) the state must be estimated from nonlinear and possibly high-dimensional data; and ii) the cost of the optimization problem – which models control objectives associated with inputs and states of the system – is not available and must be learned from data. We propose a data-driven feedback controller that is based on adaptations of a projected gradient-flow method; the controller includes neural networks as integral components for the estimation of the unknown functions. Leveraging stability theory for perturbed systems, we derive sufficient conditions to guarantee exponential input-to-state stability (ISS) of the control loop. In particular, we show that the interconnected system is ISS with respect to the approximation errors of the neural network and unknown disturbances affecting the system. The transient bounds combine the universal approximation property of deep neural networks with the ISS characterization. Illustrative numerical results are presented in the context of robotics and control of epidemics.

This paper considers the problem of regulating a linear dynamical system to the solution of a convex optimization problem with an unknown or partially-known cost. We design a data-driven feedback controller - based on gradient flow dynamics - that (i) is augmented with learning methods to estimate the cost function based on infrequent (and possibly noisy) functional evaluations; and, concurrently, (ii) is designed to drive the inputs and outputs of the dynamical system to the optimizer of the problem. We derive sufficient conditions on the learning error and the controller gain to ensure that the error between the optimizer of the problem and the state of the closed-loop system is ultimately bounded; the error bound accounts for the functional estimation errors and the temporal variability of the unknown disturbance affecting the linear dynamical system. Our results directly lead to exponential input-to-state stability of the closed-loop system. The proposed method and the theoretical bounds are validated numerically.

Since early 2020, non-pharmaceutical interventions (NPIs)—implemented at varying levels of severity and based on widely-divergent perspectives of risk tolerance—have been the primary means to control SARS-CoV-2 transmission. This paper aims to identify how risk tolerance and vaccination rates impact the rate at which a population can return to pre-pandemic contact behavior. To this end, we developed a novel mathematical model and we used techniques from feedback control to inform data-driven decision-making. We use this model to identify optimal levels of NPIs across geographical regions in order to guarantee that hospitalizations will not exceed given risk tolerance thresholds. Results are shown for the state of Colorado, United States, and they suggest that: coordination in decision-making across regions is essential to maintain the daily number of hospitalizations below the desired limits; increasing risk tolerance can decrease the number of days required to discontinue NPIs, at the cost of an increased number of deaths; and if vaccination uptake is less than 70%, at most levels of risk tolerance, return to pre-pandemic contact behaviors before the early months of 2022 may newly jeopardize the healthcare system. The sooner we can acquire population-level vaccination of greater than 70%, the sooner we can safely return to pre-pandemic behaviors.

In this work we study the stability properties of the equilibrium points of deterministic epidemic models with nonconstant population size. Models with nonconstant population have been studied in the past only in particular cases, two of which we review and combine. Our main result shows that for simple "matrix epidemic models" introduced in [1], an explicit general formula for the reproduction number and the corresponding "weak stability alternative" still holds, under small modifications, for models with nonconstant population size, and even when the model allows for vaccination and loss of immunity. The importance of this result is clear once we note that the models of [1] include a large number of viral and bacterial models of epidemic propagation, including for example the totality of homogeneous COVID-19 models. To better understand the nature of the result, we emphasize that the models proposed in [1] and considered here are extensions of the SIR-PH model, which is essentially characterized by a phase-type distribution that models transitions between the "disease/infectious compartments". In these cases, the reproduction number and a certain Lyapunov function for the disease free equilibrium are explicitly expressible. Not surprisingly, accounting for varying demography, loss of immunity, and vaccinations lead to several challenges. One of the most important is that a varying population size leads to multiple endemic equilibrium points: this is in contrast with "classic models" which in general admit unique disease-free and endemic equilibria. As a special case of our analysis, we consider a "first approximation" (FA) of our model, which coincides with the constant-demography model often studied in the literature, and for which more explicit results are available. Furthermore, we propose a second heuristic approximation named "intermediate approximation" (IA).