Pith. sign in

REVIEW 2 major objections 1 minor 25 references

A sufficient condition on switching control barrier functions ensures finite switches and forward invariance for non-convex safe sets.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-27 20:46 UTC pith:I6MXIREX

load-bearing objection Union-CBF switching gives finite-switch safety guarantees and SOS checks for non-convex sets, but only when dynamics are polynomial. the 2 major comments →

arxiv 2606.07892 v1 pith:I6MXIREX submitted 2026-06-05 math.OC

Verification Framework for the Union of Control Barrier Functions

Chuanrui Jiang , Andrew Clark This is my paper
classification math.OC
keywords control barrier functionsunion of setssum of squaresswitching controllersforward invariancesafety verificationpolynomial systems
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a verification framework called union-CBFs that represents complex non-convex safe regions as unions of tractable sets. It proposes conditions for switching between CBF-QP controllers that guarantee only a finite number of switches occur in any finite time and that the system remains forward invariant between switches. Sum-of-squares algorithms verify these conditions for polynomial dynamics, and experiments demonstrate that this yields larger safe regions than using high-degree single polynomial CBFs.

Core claim

Considering switching CBF-QP controllers, a sufficient condition is proposed that ensures the system undergoes a finite number of switches in any finite time interval and the forward invariance of the closed-loop system in between switches. Two types of switching strategies are considered with union-CBF conditions for each, formulated and verified using sum-of-squares algorithms for polynomial systems.

What carries the argument

The sufficient condition for finite switching and forward invariance in union-CBFs, verified via sum-of-squares for polynomial dynamics.

Load-bearing premise

The system dynamics are polynomial, allowing the use of sum-of-squares algorithms to verify the union-CBF conditions.

What would settle it

A polynomial system satisfying the proposed union-CBF conditions but exhibiting either infinitely many switches in finite time or leaving the safe set would falsify the sufficient condition.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • The closed-loop system maintains forward invariance under the switching policy.
  • The conditions can be verified using sum-of-squares programming on polynomial models.
  • The certified safe region is larger than that obtained from a single high-degree polynomial CBF.
  • Only finitely many switches occur in any finite time interval.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach could extend to verification methods other than sum-of-squares for non-polynomial dynamics.
  • Similar union-based certificates might apply to stability analysis in hybrid control systems.
  • Hardware experiments on robotic platforms could test whether the larger safe regions translate to improved task performance.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces a union-CBFs framework to represent complex non-convex safe regions as unions of tractable sets via switching CBF-QP controllers. It proposes sufficient conditions ensuring a finite number of switches in any finite time interval and forward invariance of the closed-loop system between switches. Two switching strategies are considered with corresponding union-CBF conditions, and Sum-of-Squares (SOS) algorithms are formulated to verify the conditions. Experiments on a polynomial system model show that the framework yields a larger safe region than high-degree polynomial CBFs and demonstrate the efficiency of the verification algorithms.

Significance. If the sufficient conditions hold and the SOS verification is correct, the work supplies a method to certify safety over unions of sets for polynomial dynamics, expanding the class of safe regions that can be handled with CBFs while providing a computational verification pathway. The explicit SOS formulation for the switching conditions is a concrete strength that enables reproducible checks on polynomial models.

major comments (2)
  1. [Abstract and Experiments] Abstract and Experiments: the verification framework rests on the assumption that the closed-loop vector field is polynomial so that SOS algorithms can be applied; this modeling restriction is load-bearing for the central claim that the framework supplies a verifiable union-CBF controller, because the verification step cannot be executed for non-polynomial dynamics and the experiments are performed exclusively on a polynomial system model.
  2. [Abstract] The sufficient condition guaranteeing finite switches and forward invariance is stated as a contribution, but without an explicit statement of the condition (presumably in §3 or §4) or a sketch of its derivation, it is difficult to confirm that the condition is non-circular and independent of the SOS check.
minor comments (1)
  1. [Abstract] The abstract refers to 'two types of switching strategies' without naming them; adding the names would improve immediate clarity for readers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major comment below, clarifying the scope of the results and proposing targeted revisions to improve presentation without altering the core contributions.

read point-by-point responses

  1. Referee: [Abstract and Experiments] Abstract and Experiments: the verification framework rests on the assumption that the closed-loop vector field is polynomial so that SOS algorithms can be applied; this modeling restriction is load-bearing for the central claim that the framework supplies a verifiable union-CBF controller, because the verification step cannot be executed for non-polynomial dynamics and the experiments are performed exclusively on a polynomial system model.

    Authors: The sufficient conditions for finite switches and forward invariance (detailed in Section 3) are derived for general nonlinear dynamics and do not require polynomial vector fields. The SOS verification algorithms (Section 4) are a computational tool applicable specifically when the closed-loop dynamics are polynomial, enabling exact certification via semidefinite programming. The experiments use a polynomial model to demonstrate both the enlarged safe region achievable via union-CBFs and the practical efficiency of the SOS checks. We agree the abstract should explicitly delineate this scope and will revise it to state that the verification framework targets polynomial systems while the switching conditions apply more broadly. revision: yes

  2. Referee: [Abstract] The sufficient condition guaranteeing finite switches and forward invariance is stated as a contribution, but without an explicit statement of the condition (presumably in §3 or §4) or a sketch of its derivation, it is difficult to confirm that the condition is non-circular and independent of the SOS check.

    Authors: The condition is stated explicitly in Section 3 (as a collection of inequalities involving the individual CBFs, their Lie derivatives, and the switching rule) together with a self-contained proof that finite switches follow from a strict decrease in a Lyapunov-like function across switches and that forward invariance holds between switches. The derivation relies solely on the CBF definition and the switching logic; the SOS programs appear only later as a verification method and play no role in the proof. The condition is therefore independent and non-circular. To address the concern about the abstract, we will insert a parenthetical reference to the relevant theorem. revision: partial

Circularity Check

0 steps flagged

No circularity; sufficient conditions and SOS verification are independent

full rationale

The paper proposes a sufficient condition ensuring finite switches and forward invariance for switching CBF-QP controllers, then defines union-CBF conditions for two strategies and formulates separate SOS algorithms to verify those conditions on polynomial dynamics. No step reduces to a self-definition, fitted input renamed as prediction, or load-bearing self-citation; the conditions are stated as sufficient and checked via standard, externally applicable SOS methods without the central claim depending on its own outputs or prior author work by construction. The polynomial restriction is an explicit scope limit for the verification technique rather than a circular dependency.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The framework rests on the assumption that polynomial dynamics allow SOS verification of the proposed conditions; no free parameters or new physical entities are introduced in the abstract.

axioms (1)
  • domain assumption Sum-of-squares positivity certificates can verify the proposed switching and invariance conditions for polynomial systems
    The paper formulates SOS algorithms to verify the union-CBF conditions, relying on this standard algebraic technique for polynomial systems.
invented entities (1)
  • union-CBFs framework no independent evidence
    purpose: Represent complex non-convex safe regions as unions of tractable sets with switching strategies
    New framework introduced to handle unions of CBFs; no independent evidence outside the paper is provided in the abstract.

pith-pipeline@v0.9.1-grok · 5697 in / 1157 out tokens · 21413 ms · 2026-06-27T20:46:00.233977+00:00 · methodology

0 comments
read the original abstract

Control Barrier Functions (CBFs) have been proposed to ensure safety of autonomous systems. This paper considers control policies that switch between CBF constraints. Under this approach, we represent a complex non-convex safe region as a union of sets that are computationally tractable to verify. We denote this framework as union-CBFs and make the following contributions. First, considering switching CBF-QP controllers, we propose a sufficient condition that ensures (i) the system undergoes a finite number of switches in any finite time interval and ensures (ii) the forward invariance of the closed-loop system in between switches. Second, we consider two types of switching strategies and propose union-CBFs conditions for each strategy to satisfy (i) and (ii). Third, we formulate Sum-of-Squares (SOS) algorithms to verify the conditions. The experiments show that our union-CBFs framework results in a larger safe region compared to high-degree polynomial CBFs. We also show the efficiency of the verification algorithms using a polynomial system model.

Figures

Figures reproduced from arXiv: 2606.07892 by Andrew Clark, Chuanrui Jiang.

Figure 1
Figure 1. Figure 1: Comparison between the proposed switching union [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Union of 3 CBFs with different layouts. Fig. (2a) is [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Computation time for Verif-I and Verif-II. Fig. (3a) [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Simulated trajectories of single integrator with con [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 2 canonical work pages

  1. [1]

    Set-theoretic methods in control,

    B. Franco and M. Stefano, “Set-theoretic methods in control,”Systems & control: Foundations & applications, 2008

    2008

  2. [2]

    Control barrier function based quadratic programs for safety critical systems,

    A. D. Ames, X. Xu, J. W. Grizzle, and P. Tabuada, “Control barrier function based quadratic programs for safety critical systems,”IEEE Transactions on Automatic Control, vol. 62, no. 8, pp. 3861–3876, 2016

    2016

  3. [3]

    Control barrier functions: Theory and applications,

    A. D. Ames, S. Coogan, M. Egerstedt, G. Notomista, K. Sreenath, and P. Tabuada, “Control barrier functions: Theory and applications,” in2019 18th European control conference (ECC), pp. 3420–3431, IEEE, 2019

    2019

  4. [4]

    Synthesis of control barrier functions using a supervised machine learning approach,

    M. Srinivasan, A. Dabholkar, S. Coogan, and P. A. Vela, “Synthesis of control barrier functions using a supervised machine learning approach,” in2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 7139–7145, Ieee, 2020

    2020

  5. [5]

    Convex synthesis and verification of control- Lyapunov and barrier functions with input constraints,

    H. Dai and F. Permenter, “Convex synthesis and verification of control- Lyapunov and barrier functions with input constraints,” in2023 American Control Conference (ACC), pp. 4116–4123, IEEE, 2023

    2023

  6. [6]

    Barriernet: Differentiable control barrier functions for learning of safe robot control,

    W. Xiao, T.-H. Wang, R. Hasani, M. Chahine, A. Amini, X. Li, and D. Rus, “Barriernet: Differentiable control barrier functions for learning of safe robot control,”IEEE Transactions on Robotics, vol. 39, no. 3, pp. 2289–2307, 2023

    2023

  7. [7]

    Nonsmooth barrier func- tions with applications to multi-robot systems,

    P. Glotfelter, J. Cort ´es, and M. Egerstedt, “Nonsmooth barrier func- tions with applications to multi-robot systems,”IEEE control systems letters, vol. 1, no. 2, pp. 310–315, 2017

    2017

  8. [8]

    Composing control barrier functions for complex safety specifications,

    T. G. Molnar and A. D. Ames, “Composing control barrier functions for complex safety specifications,”IEEE Control Systems Letters, vol. 7, pp. 3615–3620, 2023

    2023

  9. [9]

    Safe and stable filter design using a relaxed compatibitlity control barrier–lyapunov condition,

    H. Wang, K. Margellos, and A. Papachristodoulou, “Safe and stable filter design using a relaxed compatibitlity control barrier–lyapunov condition,”arXiv preprint arXiv:2407.00414, 2024

    work page arXiv 2024

  10. [10]

    Neural certificates for safe control policies,

    W. Jin, Z. Wang, Z. Yang, and S. Mou, “Neural certificates for safe control policies,”arXiv preprint arXiv:2006.08465, 2020

    work page arXiv 2006

  11. [11]

    Learning control barrier functions from expert demonstrations,

    A. Robey, H. Hu, L. Lindemann, H. Zhang, D. V . Dimarogonas, S. Tu, and N. Matni, “Learning control barrier functions from expert demonstrations,” in2020 59th IEEE Conference on Decision and Control (CDC), pp. 3717–3724, Ieee, 2020

    2020

  12. [12]

    Safe control with learned certificates: A survey of neural lyapunov, barrier, and contraction methods for robotics and control,

    C. Dawson, S. Gao, and C. Fan, “Safe control with learned certificates: A survey of neural lyapunov, barrier, and contraction methods for robotics and control,”IEEE Transactions on Robotics, vol. 39, no. 3, pp. 1749–1767, 2023

    2023

  13. [13]

    Exact verification of relu neural control barrier functions,

    H. Zhang, J. Wu, Y . V orobeychik, and A. Clark, “Exact verification of relu neural control barrier functions,”Advances in neural information processing systems, vol. 36, pp. 5685–5705, 2023

    2023

  14. [14]

    Non-smooth control barrier functions for stochastic dynamical systems,

    M. Vahs and J. Tumova, “Non-smooth control barrier functions for stochastic dynamical systems,” in2024 European Control Conference (ECC), pp. 2200–2205, IEEE, 2024

    2024

  15. [15]

    A nonsmooth approach to controller synthesis for boolean specifications,

    P. Glotfelter, J. Cort ´es, and M. Egerstedt, “A nonsmooth approach to controller synthesis for boolean specifications,”IEEE Transactions on Automatic Control, vol. 66, no. 11, pp. 5160–5174, 2020

    2020

  16. [16]

    Safety control of switched systems via multiple barrier functions,

    L. Long, C. Huang, and Z. Sun, “Safety control of switched systems via multiple barrier functions,”IEEE Transactions on Automatic Control, 2025

    2025

  17. [17]

    Verification and synthesis of control barrier functions,

    A. Clark, “Verification and synthesis of control barrier functions,” in2021 60th IEEE Conference on Decision and Control (CDC), pp. 6105–6112, Ieee, 2021

    2021

  18. [18]

    Regularity properties of optimization-based controllers,

    P. Mestres, A. Allibhoy, and J. Cort ´es, “Regularity properties of optimization-based controllers,”European Journal of Control, vol. 81, p. 101098, 2025

    2025

  19. [19]

    Continuity and smooth- ness properties of nonlinear optimization-based feedback controllers,

    B. J. Morris, M. J. Powell, and A. D. Ames, “Continuity and smooth- ness properties of nonlinear optimization-based feedback controllers,” in2015 54th IEEE Conference on Decision and Control (CDC), pp. 151–158, IEEE, 2015

    2015

  20. [20]

    Characterizing safety: Minimal control barrier functions from scalar comparison systems,

    R. Konda, A. D. Ames, and S. Coogan, “Characterizing safety: Minimal control barrier functions from scalar comparison systems,” IEEE Control Systems Letters, vol. 5, no. 2, pp. 523–528, 2020

    2020

  21. [21]

    Verification and synthesis of compatible control Lyapunov and control barrier functions,

    H. Dai, C. Jiang, H. Zhang, and A. Clark, “Verification and synthesis of compatible control Lyapunov and control barrier functions,” in2024 IEEE Conference on Decision and Control (CDC), pp. 8178–8185, IEEE, 2024

    2024

  22. [22]

    Matousek and B

    J. Matousek and B. G ¨artner,Understanding and Using Linear Pro- gramming. Springer Science & Business Media, 2006

    2006

  23. [23]

    Introducing sostools: A general purpose sum of squares programming solver,

    S. Prajna, A. Papachristodoulou, and P. A. Parrilo, “Introducing sostools: A general purpose sum of squares programming solver,” in Proceedings of the 41st IEEE Conference on Decision and Control, 2002., vol. 1, pp. 741–746, IEEE, 2002

    2002

  24. [24]

    Mosek optimizer api for python,

    M. ApS, “Mosek optimizer api for python,”Version, vol. 9, no. 17, pp. 6–4, 2022

    2022

  25. [25]

    Liberzon,Switching in systems and control, vol

    D. Liberzon,Switching in systems and control, vol. 190. Springer, 2003

    2003