Pith. sign in

REVIEW 7 cited by

CP-NCBF: A Conformal Prediction-based Approach to Synthesize Verified Neural Control Barrier Functions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.17395 v2 pith:SXGWJPZ7 submitted 2025-03-18 eess.SY cs.AIcs.ROcs.SY

classification eess.SYcs.AIcs.ROcs.SY
keywords neuralapproachcbfsbarrierconservativecontrolcp-ncbfframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Control Barrier Functions (CBFs) are a practical approach for designing safety-critical controllers, but constructing them for arbitrary nonlinear dynamical systems remains a challenge. Recent efforts have explored learning-based methods, such as neural CBFs (NCBFs), to address this issue. However, ensuring the validity of NCBFs is difficult due to potential learning errors. In this letter, we propose a novel framework that leverages split-conformal prediction to generate formally verified neural CBFs with probabilistic guarantees based on a user-defined error rate, referred to as CP-NCBF. Unlike existing methods that impose Lipschitz constraints on neural CBF-leading to scalability limitations and overly conservative safe sets--our approach is sample-efficient, scalable, and results in less restrictive safety regions. We validate our framework through case studies on obstacle avoidance in autonomous driving and geo-fencing of aerial vehicles, demonstrating its ability to generate larger and less conservative safe sets compared to conventional techniques.

Discussion (0). Sign in to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust Conformal CBF and CLF Controllers via Iterative Policy Updates

    eess.SY 2026-06 conditional novelty 6.0 of 10

    An iterative conformal-prediction update rule transfers probabilistic safety/stability guarantees across changing robust CBF/CLF policies despite policy-induced distribution shift.

  2. MAD-PINN: A Decentralized Physics-Informed Machine Learning Framework for Safe and Optimal Multi-Agent Control

    cs.RO 2025-09 conditional novelty 5.0 of 10

    MAD-PINN learns a decentralized safety-optimal policy from a physics-informed HJB value function and reports near-collision-free multi-agent navigation up to 256 agents in simulation.

  3. Fixed time convergence guarantees for Higher Order Control Barrier Functions

    eess.SY 2025-07 conditional novelty 5.0 of 10

    A repeated-root differential constraint for higher-order control barrier functions is proposed to guarantee reaching a safe set within a user-specified fixed time, with second-order formulas and robot simulations.

  4. CPED-NCBFs: A Conformal Prediction for Expert Demonstration-based Neural Control Barrier Functions

    cs.RO 2025-07 reject novelty 4.0 of 10

    CPED-NCBF uses split-conformal prediction to set safety margins in neural CBFs learned from expert demonstrations, improving simulated safety rates, but the guarantee is weakened by retraining after calibration.

  5. Safe and Performant Controller Synthesis using Gradient-based Model Predictive Control and Control Barrier Functions

    eess.SY 2025-07 reject novelty 4.0 of 10

    A two-stage controller that uses L-BFGS gradient-based MPC for performance and a CBF-QP filter for hard safety constraints is demonstrated on simulated unicycle and planar quadrotor navigation.

  6. Safety Certification in the Latent space using Control Barrier Functions and World Models

    cs.RO 2025-07 reject novelty 4.0 of 10

    A semi-supervised framework learns a control barrier certificate in the latent space of a DINO-v2-based world model for safe visuomotor control.

  7. A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity

    cs.DS 2025-07 reject novelty 2.0 of 10

    A Python implementation of a standard vertex-cover branching algorithm is benchmarked against SageMath, but the claimed O(n·1.71^k) complexity is only empirically fitted and the experiments are under-specified.

Pith tools