Skip to content
DraconiticResearch
Search Sources API
182,544 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

Optimal Decay Matrix Control Barrier Functions: Soundness and Completeness for Matrix Safety Constraints

Abstract

Many safety requirements, such as keeping a manipulator away from kinematic singularities, a network connected, or a system observable, amount to keeping a state-dependent matrix positive definite. Matrix control barrier functions (MCBFs) enforce such requirements with a semidefinite program that minimally modifies a nominal control input. The MCBF constraint bounds how fast the safety margin, the smallest eigenvalue of the matrix, may decay. Yet a fixed decay rule is conservative, rejecting safe controls that drive the state quickly toward, but never across, the boundary of the safe set. Scalar optimal decay (SOD) addresses this issue by scaling the decay term by a scalar weight that is optimized together with the control. For scalar barrier functions, SOD then rejects a control at the boundary only if the control would decrease the margin. For MCBFs, however, SOD can reject controls that leave the margin unchanged, and near the safety boundary SOD accepts such controls only at a high cost. We introduce matrix optimal decay (MOD), which replaces the scalar weight with a matrix multiplier while keeping the semidefinite program convex. MOD is provably sound and complete, certifying at the boundary exactly the controls that do not decrease the margin. If some control can strictly increase the margin at every boundary point, the MOD-MCBF filtered controller is continuous and renders the safe set forward invariant. We also add an optional recovery condition that drives the system toward the safe set after a violation without affecting soundness or completeness. On a planar two-link arm avoiding singularities, MOD-MCBF certifies safe motions that both a fixed decay rule and SOD reject, and tracks an end-effector target more closely than SOD.

Related

  1. Internal Languages for Thin Epsilon-Hyperdoctrines: Soundness, Completeness, and Rocq Formalization
    Zoltán Gábor Molnár, Csaba Tóth
    arXivPreprintarXiv licenceFull textAlgebra & number theoryLogic & foundationsarXiv
  2. Optimal Control of a Class of Reaction-Diffusion Systems with Pointwise State Constraints
    Eduardo Casas, Konstantinos Chrysafinos, Mariano Mateos
    arXivPreprintarXiv licenceFull textAnalysis & PDEsOptimisation & controlarXiv
  3. Optimal Control Under Signal Temporal Logic Constraints: A Robust Reformulation via Augmented Dynamics
    En Lai, Riccardo Bonalli, Antoine Girard +1
    AutomaticaPeer-reviewedCC BY 4.0Full textOptimisation & controlHAL
  4. Preconditioned Latent Variable Proximal Point Method for Optimal Control Problems with Control Constraints
    Nico Haaf, Roland Herzog
    arXivPreprintCC BY-SA 4.0Full textNumerical analysis & scientific computingOptimisation & controlarXiv
  5. Inverse Optimal Control with Convex Features and Box Constraints
    Jiguang Yu, Louis Shuo Wang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{gessow2026optimal,
  title = {{Optimal Decay Matrix Control Barrier Functions: Soundness and Completeness for Matrix Safety Constraints}},
  author = {Samuel G. Gessow and Albert Wu and Aaron D. Ames and Brett T. Lopez},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.18675},
  eprint = {2610.18675},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.18675},
}
RIS
TY  - UNPB
TI  - Optimal Decay Matrix Control Barrier Functions: Soundness and Completeness for Matrix Safety Constraints
AU  - Samuel G. Gessow
AU  - Albert Wu
AU  - Aaron D. Ames
AU  - Brett T. Lopez
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.18675
UR  - https://arxiv.org/abs/2610.18675
AB  - Many safety requirements, such as keeping a manipulator away from kinematic singularities, a network connected, or a system observable, amount to keeping a state-dependent matrix positive definite. Matrix control barrier functions (MCBFs) enforce such requirements with a semidefinite program that minimally modifies a nominal control input. The MCBF constraint bounds how fast the safety margin, the smallest eigenvalue of the matrix, may decay. Yet a fixed decay rule is conservative, rejecting safe controls that drive the state quickly toward, but never across, the boundary of the safe set. Scalar optimal decay (SOD) addresses this issue by scaling the decay term by a scalar weight that is optimized together with the control. For scalar barrier functions, SOD then rejects a control at the boundary only if the control would decrease the margin. For MCBFs, however, SOD can reject controls that leave the margin unchanged, and near the safety boundary SOD accepts such controls only at a high cost. We introduce matrix optimal decay (MOD), which replaces the scalar weight with a matrix multiplier while keeping the semidefinite program convex. MOD is provably sound and complete, certifying at the boundary exactly the controls that do not decrease the margin. If some control can strictly increase the margin at every boundary point, the MOD-MCBF filtered controller is continuous and renders the safe set forward invariant. We also add an optional recovery condition that drives the system toward the safe set after a violation without affecting soundness or completeness. On a planar two-link arm avoiding singularities, MOD-MCBF certifies safe motions that both a fixed decay rule and SOD reject, and tracks an end-effector target more closely than SOD.
ER  -