Transferable Neural CBFs via Generalized Closure

Classical control barrier functions (CBFs) provide safety constraints for controllers, but designing them by hand is difficult for underactuated vehicles and the resulting safe sets can be overly conservative. Neural CBFs can learn more informative barriers from data, yet a learned barrier is usually verified only for one fixed obstacle configuration. We study whether one neural barrier can be reused across environments by expressing the state relative to each obstacle. The key gap is that these relative coordinates may discard information needed to predict their own evolution. We give a generalized closure condition that represents this missing information as a residual and a lifting theorem that transfers a verified relative-coordinate barrier to every obstacle in a family. A rank test also identifies when symmetry alone cannot justify the transfer. We validate the conditions on a double integrator, a planar aircraft, and a 12-state quadrotor. Coordinates that fail the test lead to obstacle penetration or to a barrier condition that fails near hover, whereas body-frame coordinates close exactly for the quadrotor. The resulting barrier transfers to new maps without retraining and is effective in the reported deployment and fast-start experiments.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20929
Primary Topic
Formal Methods in Verification
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Transferable Neural CBFs via Generalized Closure

Parthib Khound, Nishant Jayesh Bhave
arXiv (Cornell University)
Formal Methods in Verification
preprint

Transferable Neural CBFs via Generalized Closure

Parthib Khound, Nishant Jayesh Bhave
preprint en

Abstract

Classical control barrier functions (CBFs) provide safety constraints for controllers, but designing them by hand is difficult for underactuated vehicles and the resulting safe sets can be overly conservative. Neural CBFs can learn more informative barriers from data, yet a learned barrier is usually verified only for one fixed obstacle configuration. We study whether one neural barrier can be reused across environments by expressing the state relative to each obstacle. The key gap is that these relative coordinates may discard information needed to predict their own evolution. We give a generalized closure condition that represents this missing information as a residual and a lifting theorem that transfers a verified relative-coordinate barrier to every obstacle in a family. A rank test also identifies when symmetry alone cannot justify the transfer. We validate the conditions on a double integrator, a planar aircraft, and a 12-state quadrotor. Coordinates that fail the test lead to obstacle penetration or to a barrier condition that fails near hover, whereas body-frame coordinates close exactly for the quadrotor. The resulting barrier transfers to new maps without retraining and is effective in the reported deployment and fast-start experiments.

arXiv (Cornell University)
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon