OpenAlex ·
Higher-Order Mean-Field Control Barrier Functions
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.33852
- Original
- Read it at the publisher
- Topics
Abstract
Mean-field control barrier functions (MF-CBFs) enforce swarm safety through constraints on the agents' distribution. Previous formulations, including applications to stochastic coverage and shepherding, use first-order differential inequalities. These cannot directly enforce constraints whose barrier functions yield control-free first derivatives. Thus, we develop the theory of higher-order MF-CBFs, which ensures the positivity of the barrier functionals through higher-order differential inequalities, as in their finite-dimensional analogs. More specifically, we introduce the notion of relative degree for mean-field safety functionals and develop an analytic framework for computing their higher-order derivatives. Moreover, for practical examples of cross-correlation and self-correlation functionals, we show that repeated differentiation along mean-field dynamics is structure-preserving and reduces to kernel recursions. As an illustration, we apply higher-order MF-CBFs to double-integrator swarm tracking and avoidance problems, where position-only constraints lead to MF-CBFs of relative degree two.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
An EPTAS for Offline Temporary Tasks Assignment on Few Machines
Near-Optimal Bounds on the Density of Low-Energy States of $k$-Local Hamiltonians and Faster Quantum Algorithms
The Fully Depolarizing Noise Conjecture for Entangled Physical States: A Twenty-Year Perspective
Depth-Optimal Quantum Compilation
Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.