No Arabic abstract
We study the synthesis of optimal control policies for large-scale multi-agent systems. The optimal control design induces a parsimonious control intervention by means of l-1, sparsity-promoting control penalizations. We study instantaneous and infinite horizon sparse optimal feedback controllers. In order to circumvent the dimensionality issues associated to the control of large-scale agent-based models, we follow a Boltzmann approach. We generate (sub)optimal controls signals for the kinetic limit of the multi-agent dynamics, by sampling of the optimal solution of the associated two-agent dynamics. Numerical experiments assess the performance of the proposed sparse design.
We consider nonlinear transport equations with non-local velocity, describing the time-evolution of a measure, which in practice may represent the density of a crowd. Such equations often appear by taking the mean-field limit of finite-dimensional systems modelling collective dynamics. We first give a sense to dissipativity of these mean-field equations in terms of Lie derivatives of a Lyapunov function depending on the measure. Then, we address the problem of controlling such equations by means of a time-varying bounded control action localized on a time-varying control subset with bounded Lebesgue measure (sparsity space constraint). Finite-dimension
We study a multiscale approach for the control of agent-based, two-population models. The control variable acts over one population of leaders, which influence the population of followers via the coupling generated by their interaction. We cast a quadratic optimal control problem for the large-scale microscale model, which is approximated via a Boltzmann approach. By sampling solutions of the optimal control problem associated to binary two-population dynamics, we generate sub-optimal control laws for the kinetic limit of the multi-population model. We present numerical experiments related to opinion dynamics assessing the performance of the proposed control design.
In this paper, we propose an optimization-based sparse learning approach to identify the set of most influential reactions in a chemical reaction network. This reduced set of reactions is then employed to construct a reduced chemical reaction mechanism, which is relevant to chemical interaction network modeling. The problem of identifying influential reactions is first formulated as a mixed-integer quadratic program, and then a relaxation method is leveraged to reduce the computational complexity of our approach. Qualitative and quantitative validation of the sparse encoding approach demonstrates that the model captures important network structural properties with moderate computational load.
A new class of cost functionals for optimal control of quantum systems which produces controls which are sparse in frequency and smooth in time is proposed. This is achieved by penalizing a suitable time-frequency representation of the control field, rather than the control field itself, and by employing norms which are of $L^1$ or measure form with respect to frequency but smooth with respect to time. We prove existence of optimal controls for the resulting nonsmooth optimization problem, derive necessary optimality conditions, and rigorously establish the frequency-sparsity of the optimizers. More precisely, we show that the time-frequency representation of the control field, which a priori admits a continuum of frequencies, is supported on only textit{ finitely many} frequencies. These results cover important systems of physical interest, including (infinite-dimensional) Schrodinger dynamics on multiple potential energy surfaces as arising in laser control of chemical reactions. Numerical simulations confirm that the optimal controls, unlike those obtained with the usual $L^2$ costs, concentrate on just a few frequencies, even in the infinite-dimensional case of laser-controlled chemical reactions.
This paper deals with suboptimal distributed H2 control by dynamic output feedback for homogeneous linear multi-agent systems. Given a linear multi-agent system, together with an associated H2 cost functional, the objective is to design dynamic output feedback protocols that guarantee the associated cost to be smaller than an a priori given upper bound while synchronizing the controlled network. A design method is provided to compute such protocols. The computation of the two local gains in these protocols involves two Riccati inequalities, each of dimension equal to the dimension of the state space of the agents. The largest and smallest nonzero eigenvalue of the Laplacian matrix of the network graph are also used in the computation of one of the two local gains.A simulation example is provided to illustrate the performance of the proposed protocols.