Optimal consensus control of the Cucker-Smale model

Abstract

We study the numerical realisation of optimal consensus control laws for agent-based models. For a nonlinear multi-agent system of Cucker-Smale type, consensus control is cast as a dynamic optimisation problem for which we derive first-order necessary optimality conditions. In the case of a smooth penalization fo the control energy, the optimality system is numerically approximated via a gradient-descent method. For sparsity promoting, non-smooth ${\ell }_1$-norm control penalizations, the optimal controllers are realised by means of heuristic methods. For an increasing number of agents, we discuss the approximation of the consensus control problem by following a mean-field modelling approach.

References in corpus (2)

• Invisible control of self-organizing agents leaving unknown environments
• Infinite horizon sparse optimal control

Cited by in corpus (10)

• Using mobility data in the design of optimal lockdown strategies for the COVID-19 pandemic
• Mathematical models and methods for crowd dynamics control
• Generalized Dynamic Programming Principle and Sparse Mean-Field Control Problems
• Efficient quantitative assessment of robot swarms: coverage and targeting Lévy strategies
• Model predictive control with random batch methods for a guiding problem
• A fast iterative PDE-based algorithm for feedback controls of nonsmooth mean-field control problems
• Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems
• Collisionless and Decentralized Formation Control for Strings
• Uncertainty quantification and control of kinetic models of tumour growth under clinical uncertainties
• PDE-constrained optimal control of a leader-follower opinion formation model