Searcharxiv⌕ Search

arXiv · 2610.04733

Safe Leader-Follower Density Control via Higher-Order Mean-Field Control Barrier Functions

Abstract

Safety filters for large-scale multi-agent systems can be formulated at the population level through mean-field control barrier functions (MF-CBFs). Most existing formulations are first-order, requiring the control input to appear explicitly in the first time derivative of the safety functional; higher-order extensions have only very recently been proposed for a single, directly actuated population. We consider instead the case in which the population to be kept safe is not directly actuated, but is transported by a field generated by a second, controlled population. For this setting, we develop a higher-order MF-CBF framework for density dynamics with safety constraints of relative degree larger than one. Our main result is that indirect actuation of this kind does not destroy the control-affine structure of the safety condition: the control-dependent part of the second time derivative of the safety functional is obtained in closed form and is linear in the control velocity field, with a kernel given by the actuated density times the spatial gradient of a first variation. Relative-degree-two safety constraints can therefore still be enforced through a convex quadratic program. We then specialize the framework to a leader-follower density control problem in the presence of dangerous regions, where safety is ensured by keeping the overlap of each population with those regions below a prescribed threshold. We show that the follower safety functional has relative degree two with respect to the leader control field, while the leader safety functional has relative degree one. We further characterize exactly when the two simultaneous constraints are infeasible, introduce an adaptive-gain mechanism to mitigate potential conflicts, and bound the tracking errors induced by the safety correction. Numerical simulations in cluttered environments illustrate the resulting safety-performance trade-off.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cinzia Tomaselli, Mario di Bernardo. 2026-10-03. Safe Leader-Follower Density Control via Higher-Order Mean-Field Control Barrier Functions. https://arxiv.org/abs/2610.04733

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Diagonally forced systems and the spectral signature of matrix cycles

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which are multiplied by a variable, $σ$, we wish to find the minimal $σ$ such that the eigenvalue of $\mathbf{M}_σ$ is exactly zero. By Gershgorin, we know that $\mathbf{M}_σ$ can be made stable by making $σ$ large enough. We prove a relation which analytically determines when and how we are able to find the value of $σ$ such that the maximal eigenvalue is exactly zero. In so doing, we prove the equivalence of the roots of the characteristic polynomial of $\mathbf{M}_σ$ and the eigenvalues that arise from a scaling operation on $\mathbf{M}$. Further, through the characteristic polynomial, we are able to isolate the dominant feedback cycles comprising the elements of the matrix which, under the action of $σ$, ensures the stability of the system. We then explore, using the stabilising and destabilising cycles within the coefficients of the characteristic polynomial, an intrinsic spectral signature associated with any square matrix based on the sign (or zero) of its respective elements.

math.OC↗

Nonlinear Control Allocation: A Polynomial Approach

Control allocation maps the virtual control inputs requested by a high-level control law onto the physical actuators of a system. When the actuator authority is strongly nonlinear, existing methods rely on local linearization, on incremental updates, or on general nonlinear programming, and may be inaccurate, slow, or trapped in local optima. This paper introduces Polynomial Control Allocation, in which the cost and constraints of the allocation problem are polynomial or rational functions of the states and inputs; radical, trigonometric and tabulated nonlinearities are accommodated by lifting. The first order optimality conditions then form a parametric system of polynomial equations. Its Gr{ö}bner basis and the associated multiplication matrices are computed once, offline. Online, the matrices are evaluated at the current state and all solutions are recovered from the eigenvectors of a random linear combination of them, so that the globally optimal allocation is selected at a predictable computational cost. The framework is illustrated on thrust control of a variable-pitch propeller and on multicopter force allocation, and its computational cost is quantified in terms of polynomial evaluation and eigenvector computation. The method is validated experimentally on a Quanser helicopter model at a 500 Hz control rate, where a two-layer allocation scheme combined with linear model predictive control decouples travel and elevation over multiple full rotations. Monte Carlo comparisons with nonlinear programming and incremental nonlinear control allocation show that Polynomial Control Allocation achieves the lowest allocation error together with the shortest computation time.

math.OC↗

Notes on the discretization of TV-NORM regularized inverse potential problems

We describe a method to discretize optimization problems arising in the regularization of linear inverse problem having compact forward operator defined on 3-D valued measures, compactly supported on a fixed set. The criterion is a quadratic residual attached to the data, with an additive penalization of the total variation of the measure.

math.OC↗