pith. sign in

arxiv: 2603.19119 · v2 · submitted 2026-03-19 · 📡 eess.SY · cs.SY

Exact-Time Safety Recovery using Time-Varying Control Barrier Functions with Optimal Barrier Tracking

Yingqing Chen , Christos G. Cassandras , Wei Xiao , Anni Li This is my paper

Pith reviewed 2026-05-15 08:12 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords control barrier functionssafety recoverytime-varying CBFsautonomous vehiclesexact-time convergencetrajectory optimizationnonlinear systems
0
0 comments X

The pith

Time-varying control barrier functions guarantee safety recovery at an exact prescribed time.

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

This paper presents an exact-time safety recovery method for control-affine nonlinear systems using time-varying control barrier functions. Unlike standard approaches that only bound the recovery time from above, the method forces the barrier function to track a chosen trajectory exactly. The trajectory is designed and optimized to meet performance goals while satisfying input limits and avoiding overly strong corrections. The technique is shown on connected automated vehicles at roundabouts to restore safety constraints before conflicts occur.

Core claim

The framework guarantees recovery to the safe set at a prescribed time by imposing an active barrier tracking condition that makes the barrier function follow a designer-specified recovery trajectory, which is then parameterized and optimized under input constraints.

What carries the argument

Active barrier tracking condition forcing the barrier function to follow a prescribed recovery trajectory.

If this is right

  • Recovery occurs at a precise user-specified instant rather than sometime before an upper bound.
  • Optimized trajectories reduce control aggressiveness compared to conventional finite-time methods.
  • The method applies to any control-affine nonlinear system that starts outside the safe set.
  • In CAV roundabout coordination, violated merging constraints are replaced to restore safety before conflict points.

Where Pith is reading between the lines

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

  • Task planners can schedule around the known recovery deadline for tighter coordination.
  • The approach may extend to disturbed environments if the trajectory is recomputed online.

Load-bearing premise

It is always possible to parameterize a recovery trajectory that keeps all controls feasible while driving the barrier function along the desired path.

What would settle it

A counter-example simulation where enforcing the barrier tracking condition results in the state entering the safe set either before or after the prescribed time.

Figures

Figures reproduced from arXiv: 2603.19119 by Anni Li, Christos G. Cassandras, Wei Xiao, Yingqing Chen.

Figure 1
Figure 1. Figure 1: A roundabout with 3 entries [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: ACC comparison with ExT-CBF optimized for [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: Relative Performance Across Methods for Balanced [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 3
Figure 3. Figure 3: ACC comparison with ExT-CBF optimized for [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
read the original abstract

This paper is motivated by controllers developed for autonomous vehicles which occasionally result into conditions where safety is no longer guaranteed. We develop an exact-time safety recovery framework for any control-affine nonlinear system when its state is outside a safe region using time-varying Control Barrier Functions (CBFs) with optimal barrier tracking. Unlike conventional formulations that provide only conservative upper bounds on recovery time convergence, the proposed approach guarantees recovery to the safe set at a prescribed time. The key mechanism is an active barrier tracking condition that forces the barrier function to follow exactly a designer-specified recovery trajectory. This transforms safety recovery into a trajectory design problem. The recovery trajectory is parameterized and optimized to achieve optimal performance while preserving feasibility under input constraints, avoiding the aggressive corrective actions typically induced by conventional finite-time formulations. The safety recovery framework is applied to the roundabout traffic coordination problem for Connected and Automated Vehicles (CAVs), where any initially violated safe merging constraint is replaced by an exact-time recovery barrier constraint to ensure safety guarantee restoration before CAV conflict points are reached. Simulation results demonstrate improved feasibility and performance.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes an exact-time safety recovery framework for control-affine nonlinear systems using time-varying Control Barrier Functions (CBFs) with optimal barrier tracking. It claims to guarantee recovery to the safe set at a prescribed time T by enforcing an active barrier-tracking condition that forces the barrier function h(x(t)) to follow a designer-chosen trajectory phi(t) with phi(T)=0 exactly. This is achieved by solving for the control u such that the Lie derivative condition matches dot{phi}(t) at each instant, with the recovery trajectory parameterized and optimized to achieve optimal performance while preserving feasibility under input constraints. The method is applied to roundabout traffic coordination for Connected and Automated Vehicles (CAVs), replacing violated safe merging constraints with exact-time recovery barriers, and simulation results are presented to show improved feasibility and performance over conventional CBF formulations.

Significance. If the exact-time guarantee can be established with conditions ensuring the optimized phi(t) always yields feasible controls, the result would be significant for safety-critical control applications. It offers stronger, non-conservative recovery timing compared to standard CBFs that provide only upper bounds on convergence time, and the transformation of recovery into a parameterized trajectory optimization problem could reduce aggressive inputs. The CAV roundabout application demonstrates practical relevance through simulations, and the approach builds on control-affine system properties in a way that could generalize if feasibility conditions are supplied.

major comments (2)
  1. [Abstract and §III] Abstract and §III (active barrier tracking condition): the central claim that the parameterization of phi(t) 'preserves feasibility under input constraints' for arbitrary initial violations is load-bearing for the exact-time guarantee, yet no theorem supplies sufficient conditions (e.g., on relative degree, Lipschitz constants of f and g, or bounds on initial h(0)) under which an admissible phi(t) is guaranteed to exist such that the resulting QP remains feasible for all t in [0,T]. Without this, the method reduces to a conventional CBF when the optimizer returns infeasible.
  2. [§IV] §IV (CAV application): the claim that any initially violated safe merging constraint is replaced by an exact-time recovery barrier to ensure restoration before conflict points relies on the same unproven feasibility preservation; simulation results alone do not establish that the optimization succeeds for all admissible initial states.
minor comments (2)
  1. [Abstract] Abstract: the statement that the approach 'avoids the aggressive corrective actions typically induced by conventional finite-time formulations' would benefit from a brief quantitative comparison (e.g., peak control effort) even in the summary.
  2. [Notation] Notation: the distinction between the time-varying barrier h(x(t),t) and the tracking function phi(t) should be clarified with an explicit equation relating them in the main text.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful reading and constructive comments on the feasibility aspects of the exact-time recovery framework. We address each major comment below and will revise the manuscript to qualify our claims appropriately.

read point-by-point responses

  1. Referee: [Abstract and §III] Abstract and §III (active barrier tracking condition): the central claim that the parameterization of phi(t) 'preserves feasibility under input constraints' for arbitrary initial violations is load-bearing for the exact-time guarantee, yet no theorem supplies sufficient conditions (e.g., on relative degree, Lipschitz constants of f and g, or bounds on initial h(0)) under which an admissible phi(t) is guaranteed to exist such that the resulting QP remains feasible for all t in [0,T]. Without this, the method reduces to a conventional CBF when the optimizer returns infeasible.

    Authors: We agree that the manuscript lacks a general theorem establishing sufficient conditions (such as bounds on initial h(0) or system Lipschitz constants) guaranteeing existence of a feasible phi(t) for arbitrary initial violations. The parameterization and optimization of phi(t) are designed to select a recovery trajectory that respects input constraints while enforcing exact tracking, but for sufficiently severe violations this may indeed render the QP infeasible at some instants. We will revise the abstract and Section III to state explicitly that the exact-time guarantee holds conditionally on the QP remaining feasible throughout [0,T], and we will add a remark discussing practical conditions (e.g., moderate initial deviations) under which the optimizer is expected to succeed. When infeasible, the formulation naturally reduces to a standard CBF as the referee notes. revision: yes

  2. Referee: [§IV] §IV (CAV application): the claim that any initially violated safe merging constraint is replaced by an exact-time recovery barrier to ensure restoration before conflict points relies on the same unproven feasibility preservation; simulation results alone do not establish that the optimization succeeds for all admissible initial states.

    Authors: We concur that the CAV simulations illustrate performance for representative initial conditions but do not constitute a proof for all admissible states. In the roundabout coordination setting, initial constraint violations are bounded by the geometry and traffic rules, allowing the optimized phi(t) to remain feasible in the reported cases. We will revise Section IV to clarify that the exact-time replacement is applied under the assumption of a feasible recovery trajectory and to note the scope of the demonstrated scenarios. We will also add a brief discussion indicating that feasibility can be verified online via the QP solver. revision: partial

standing simulated objections not resolved
  • A general theorem supplying sufficient conditions on system parameters and initial violation size that guarantees existence of an admissible phi(t) for arbitrary initial states under input constraints

Circularity Check

0 steps flagged

No circularity: new construction from control-affine properties without reduction to inputs

full rationale

The paper defines an active barrier-tracking condition that forces h(x(t)) to track a designer-chosen phi(t) with phi(T)=0, then optimizes parameters of phi under input constraints. This is presented as a direct design choice and trajectory parameterization for control-affine systems, not derived from or equivalent to any fitted parameter, self-citation chain, or prior result by the same authors. No equations reduce by construction (e.g., no Lie-derivative equality that is tautological with the optimization output). The feasibility preservation is asserted as part of the framework rather than proven via a uniqueness theorem imported from self-citation. The derivation therefore remains self-contained against external benchmarks such as standard CBF QP feasibility and prescribed-time convergence definitions. This is the expected honest non-finding for a control-synthesis paper whose central claim is a new parameterization rather than a closed-form prediction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on the assumption that the system is control-affine and that a feasible recovery trajectory exists under input constraints; no free parameters or new entities are explicitly introduced in the abstract.

axioms (1)
  • domain assumption The system is any control-affine nonlinear system
    Stated directly in the abstract as the class of systems for which the framework applies.

pith-pipeline@v0.9.0 · 5493 in / 1169 out tokens · 27416 ms · 2026-05-15T08:12:46.369093+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages · 1 internal anchor

  1. [1]

    Functional control: Leveraging function-as- a-service platforms for software-defined networking controllers,

    S. Liu and C. A. Shue, “Functional control: Leveraging function-as- a-service platforms for software-defined networking controllers,” in Proceedings of the Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, ser. MobiHoc ’25. New York, NY , USA: ACM, 2025, p. 141–150

    work page 2025

  2. [2]

    A survey on the coordination of connected and automated vehicles at intersections and merging at highway on-ramps,

    J. Rios-Torres and A. A. Malikopoulos, “A survey on the coordination of connected and automated vehicles at intersections and merging at highway on-ramps,”IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 5, pp. 1066–1077, 2017

    work page 2017

  3. [3]

    Automated and cooperative vehicle merging at highway on- ramps,

    ——, “Automated and cooperative vehicle merging at highway on- ramps,”IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 4, pp. 780–789, 2017

    work page 2017

  4. [4]

    Round- abouts: Traffic simulations of connected and automated vehicles—a state of the art,

    E. Campi, G. Mastinu, G. Previati, L. Studer, and L. Uccello, “Round- abouts: Traffic simulations of connected and automated vehicles—a state of the art,”IEEE Trans. on Intelligent Transp. Systems, pp. 1– 21, 2023

    work page 2023

  5. [5]

    ¨uber die lage der integralkurven gew ¨ohnlicher differen- tialgleichungen,

    M. Nagumo, “ ¨uber die lage der integralkurven gew ¨ohnlicher differen- tialgleichungen,”Proceedings of the Physico-Mathematical Society of Japan. 3rd Series, vol. 24, pp. 551–559, 1942

    work page 1942

  6. [6]

    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

    work page 2016

  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

    work page 2017

  8. [8]

    Exponential control barrier functions for enforcing high relative-degree safety-critical constraints,

    Q. Nguyen and K. Sreenath, “Exponential control barrier functions for enforcing high relative-degree safety-critical constraints,” in2016 American Control Conference (ACC). IEEE, 2016, pp. 322–328

    work page 2016

  9. [9]

    High-order control barrier functions,

    W. Xiao and C. Belta, “High-order control barrier functions,”IEEE Transactions on Automatic Control, vol. 67, no. 7, pp. 3655–3662, 2022

    work page 2022

  10. [10]

    Automated on- ramp merging system for congested traffic situations,

    V . Milan ´es, J. Godoy, J. Villagr ´a, and J. P ´erez, “Automated on- ramp merging system for congested traffic situations,”IEEE Trans. on Intelligent Transp. Systems, vol. 12, no. 2, pp. 500–508, 2010

    work page 2010

  11. [11]

    Robust optimal lane- changing control for connected autonomous vehicles in mixed traffic,

    A. Li, A. S. C. Armijos, and C. G. Cassandras, “Robust optimal lane- changing control for connected autonomous vehicles in mixed traffic,” Automatica, vol. 174, p. 112169, 2025

    work page 2025

  12. [12]

    Decentralized time and energy-optimal control of connected and automated vehicles in a roundabout with safety and comfort guarantees,

    K. Xu, C. G. Cassandras, and W. Xiao, “Decentralized time and energy-optimal control of connected and automated vehicles in a roundabout with safety and comfort guarantees,”IEEE Trans. on Intelligent Transp. Systems, vol. 24, no. 1, pp. 657–672, 2022

    work page 2022

  13. [13]

    Backup control barrier functions: Formulation and comparative study,

    Y . Chen, M. Jankovic, M. Santillo, and A. D. Ames, “Backup control barrier functions: Formulation and comparative study,” in2021 60th IEEE Conference on Decision and Control (CDC). IEEE, 2021, pp. 6835–6841

    work page 2021

  14. [14]

    A learning-based framework for safe human-robot collaboration with multiple backup control barrier functions,

    N. C. Janwani, E. Das ¸, T. Touma, S. X. Wei, T. G. Molnar, and J. W. Burdick, “A learning-based framework for safe human-robot collaboration with multiple backup control barrier functions,” in2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024, pp. 11 676–11 682

    work page 2024

  15. [15]

    Measurement-robust control barrier func- tions: Certainty in safety with uncertainty in state,

    R. K. Cosner, A. W. Singletary, A. J. Taylor, T. G. Molnar, K. L. Bouman, and A. D. Ames, “Measurement-robust control barrier func- tions: Certainty in safety with uncertainty in state,” in2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2021, pp. 6286–6291

    work page 2021

  16. [16]

    Robust control barrier and control lyapunov functions with fixed-time convergence guarantees,

    K. Garg and D. Panagou, “Robust control barrier and control lyapunov functions with fixed-time convergence guarantees,” in2021 American Control Conference (ACC). IEEE, 2021, pp. 2292–2297

    work page 2021

  17. [17]

    Prescribed-time safety control for unknown systems and its application to robotic manipu- lator,

    S. Zhang, D.-H. Zhai, Y . Xiong, and Y . Xia, “Prescribed-time safety control for unknown systems and its application to robotic manipu- lator,”IEEE Transactions on Automation Science and Engineering, vol. 22, pp. 9923–9933, 2024

    work page 2024

  18. [18]

    Learning-based prescribed-time safety for control of unknown systems with control barrier functions,

    P. Huang, F. Yao, Q. Lu, W. Pan, and L. Wang, “Learning-based prescribed-time safety for control of unknown systems with control barrier functions,”IEEE Control Systems Letters, vol. 8, pp. 2439– 2444, 2024

    work page 2024

  19. [19]

    High order control lyapunov-barrier functions for temporal logic specifications,

    W. Xiao, C. A. Belta, and C. G. Cassandras, “High order control lyapunov-barrier functions for temporal logic specifications,” in2021 American Control Conference (ACC). IEEE, 2021, pp. 4886–4891

    work page 2021

  20. [20]

    Optimal sequencing and motion control in a roundabout with safety and comfort guarantees,

    Y . Chen and C. G. Cassandras, “Optimal sequencing and motion control in a roundabout with safety and comfort guarantees,”IEEE Transactions on Intelligent Transportation Systems, vol. 26, no. 11, pp. 19 148–19 162, 2025

    work page 2025

  21. [21]

    W. Xiao, C. G. Cassandras, and C. Belta,Safe autonomy with control barrier functions: Theory and applications. Springer, 2023

    work page 2023

  22. [22]

    Finite-time convergent control barrier functions with feasibility guarantees,

    A. Li, Y . Chen, C. G. Cassandras, and W. Xiao, “Finite-time convergent control barrier functions with feasibility guarantees,”

    work page

  23. [23]

    Available: https://arxiv.org/abs/2603.22445

    [Online]. Available: https://arxiv.org/abs/2603.22445

    work page arXiv

  24. [24]

    Constricting tubes for prescribed-time safe control,

    D. Gadginmath, A. Allibhoy, and F. Pasqualetti, “Constricting tubes for prescribed-time safe control,” 2026. [Online]. Available: https://arxiv.org/abs/2603.17003

    work page internal anchor Pith review arXiv 2026