--- title: Recurrent Control Barrier Functions url: https://www.emergentmind.com/topics/recurrent-control-barrier-functions-rcbfs type: topic --- # Recurrent Control Barrier Functions Recurrent Control Barrier Functions (RCBFs) are barrier-based safety certificates that replace the standard requirement of forward invariance by a recurrence condition on trajectories. In the recurrent formulations introduced in 2025, a trajectory may temporarily leave an auxiliary barrier superlevel set, provided it returns within a finite horizon \(\tau\); safety is then recovered either by combining recurrence with reachable-set exclusion [2510.02127] or by coupling a reduced-order-model control barrier function with a recurrent tracking certificate for a full-order model [2510.01147]. The term is distinct from earlier uses of the same acronym for reciprocal or robust control barrier functions. ## 1. Terminology, scope, and acronym ambiguity In the control-barrier literature, the acronym **RCBF** is overloaded. The recurrent usage is recent and should be separated from the reciprocal and robust usages that already existed in the CBF literature. | Meaning of RCBF | Representative papers | Core safety idea | |---|---|---| | **Recurrent Control Barrier Function** | [2510.01147], [2510.02127] | Finite-time return or \(\tau\)-recurrence | | **Reciprocal Control Barrier Function** | [1609.06408], [2312.02430] | Barrier blows up at the boundary | | **Robust Control Barrier Function** | [2503.18524], [2107.04094] | Invariance under disturbances and input constraints | The standard background is the continuous-time CBF framework for a safe set \(\mathcal C=\{x:h(x)\ge 0\}\), where forward invariance is enforced through pointwise control inequalities such as \[ L_f h(x)+L_g h(x)u \ge -\alpha(h(x)), \] or, in reciprocal form, through a singular barrier on \(\operatorname{Int}(\mathcal C)\) [1609.06408]. Recurrent CBFs depart from that logic by weakening the certificate itself: the set associated with the recurrent barrier need not be invariant, and the barrier quantity need not satisfy a pointwise differential inequality at every instant. This distinction matters because a recurrent CBF is not simply a standard CBF enforced repeatedly online. The repeated online QP logic of the classical CLF-CBF framework is a precursor, but it is not itself the recurrent formalism introduced under the name “Recurrent Control Barrier Function” in 2025 [1609.06408]. ## 2. Finite-horizon recurrence as a barrier condition One recurrent formulation considers the control system \[ \dot{x}=F(x,u), \] with trajectories \(\phi(t,x,u)\), unsafe set \(\mathcal X_u\), and a continuous function \(h:\mathbb R^n\to\mathbb R\). A compact set \(S\) is **control recurrent** if, for every \(x\in S\), there exists a control such that the trajectory returns to \(S\) infinitely often; it is **control \(\tau\)-recurrent** if every return occurs within at most \(\tau\) time units [2510.02127]. The recurrent barrier condition is defined on \[ D_0:=h_{\ge -c}, \qquad c>0, \] by requiring that for every \(x\in D_0\) there exists \(u\in U^{(0,\tau]}\) such that \[ \max_{t\in(0,\tau]} e^{\gamma(h(\phi(t,x,u)))t}\,h(\phi(t,x,u)) \ge h(x), \] where \(\gamma:\mathbb R\to\mathbb R_{>0}\). A frequently used choice is \[ \gamma_{\alpha,\beta}(s)= \begin{cases} \alpha, & s\ge 0,\\ \beta, & s<0, \end{cases} \qquad \alpha,\beta>0. \] The induced safety theorem has two parts. First, if \(h\) is an RCBF, then \(h_{\ge 0}\) is control \(\tau\)-recurrent. Second, if \[ h_{\ge 0}\cap \mathcal R_\tau(\mathcal X_u)=\emptyset, \] where \(\mathcal R_\tau(\mathcal X_u)\) is the \(\tau\)-backward reachable tube of the unsafe set, then any control rendering the trajectory \(\tau\)-recurrent also guarantees \[ \phi(t,x,u)\notin \mathcal X_u,\qquad \forall t\ge 0, \] for every \(x\in h_{\ge 0}\) [2510.02127]. The conceptual shift is precise. A standard CBF says “once inside, never leave.” A recurrent CBF says “if a trajectory leaves, it must come back within \(\tau\).” Safety is then obtained not from invariance of \(h_{\ge 0}\) itself, but from the conjunction of finite-time return and exclusion of the unsafe set’s \(\tau\)-reachable region. This suggests a different geometric object: a recurrent-safe set rather than an invariant safe set. ## 3. Layered recurrent barriers from recurrent tracking functions A second recurrent formulation arises in layered safety-critical control for a high-dimensional full-order model (FoM) \[ \dot x = F(x,u), \qquad x\in \mathcal X\subseteq \mathbb R^N, \] and a lower-dimensional reduced-order model (RoM) \[ \dot z = f(z,v), \qquad z\in Z\subseteq \mathbb R^n,\quad n0\). The novelty is the tracking layer. If \(z_s(\cdot)\) is a safe RoM reference, the projected FoM trajectory is \(z(t)=\Pi(x(t))\), and the tracking error is \[ e=z-z_s,\qquad \dot e=\dot z-\dot z_s. \] The paper replaces monotone Lyapunov tracking with a **Recurrent Tracking Function (RTF)** \(V(z,\dot e)\). On a compact set \(S\subseteq \mathbb R^n\times\mathbb R^n\), \(V\) must satisfy linear error bounds \[ a_1\|\dot e\|\le V(z,\dot e)\le a_2\|\dot e\|, \] and a \(\beta\)-exponential \(\tau\)-recurrence condition \[ \min_{t\in T_S(x;\tau)} e^{\beta t}V(z(t),\dot e(t)) \le V(z,\dot e). \] This is weaker than a differential inequality such as \(\dot V\le -cV\): transient growth of the tracking measure is allowed, provided recurrent decrease occurs within every time window of length \(\tau\). Under this condition, the tracking-error derivative still obeys the exponential bound \[ \|\dot e(t)\| \le M e^{-\beta t}\|\dot e(0)\|. \] The recurrent barrier is then constructed as \[ h_V(z,\dot e)= -V(z,\dot e)+\alpha_e h(z), \qquad \alpha_e=\frac{a_1^2(\beta-\alpha)}{a_2 C_h M}, \] with superlevel set \[ S_V=\{(z,\dot e)\in \mathbb R^n\times\mathbb R^n:h_V(z,\dot e)\ge 0\}. \] If the RoM barrier is a CBF with \(\kappa(h)=\alpha h\), the RTF has rate \(\beta>\alpha\), and the stated assumptions hold, then \(S_V\) is a control \(\tau\)-recurrent set and \(h_V\) is an RCBF on \(S_V\) [2510.01147]. The crucial point is that \(h_V\) is only recurrent, but the FoM safety variable can still be forward invariant. Along the projected FoM trajectory, \[ h(z(t)) \ge e^{-\alpha t} h(z) - C_h\int_0^t e^{-\alpha(t-s)}\|\dot e(s)\|\,ds. \] Using the exponential tracking bound and the initial margin condition \[ h(z)\ge \frac{V(z,\dot e)}{\alpha_e}, \] the paper proves \[ h(\Pi(x(t)))\ge 0,\qquad \forall t\ge 0, \] provided \(\beta>\alpha\). The separation condition \(\beta>\alpha\) is therefore the key timescale requirement: the tracking correction must dominate the rate at which the RoM barrier budget can decay. The guaranteed safe set is not all of \(S_{\mathrm{FoM}}\), but the subset whose initial barrier value is large enough relative to the initial tracking error. The same paper also gives a disturbance extension. If the tracking layer satisfies the ISS-type estimate \[ \|\dot e(t)\| \le M\|\dot e\| e^{-\beta t} + \mu(\|d\|_\infty), \] then the practical RTF condition is shifted by \[ \iota(\|d\|_\infty)= \frac{a_2 e^{\beta\tau}\mu(\|d\|_\infty)}{M}, \] and the robust recurrent barrier becomes \[ h_{Vd}(z,\dot e)=h_V(z,\dot e)-\gamma(\|d\|_\infty). \] Safety is retained if the initial condition lies in the correspondingly shrunk set \(S_{Vd}\) [2510.01147]. ## 4. Signed-distance RCBFs and nonparametric safety verification A major theoretical result of the direct recurrence-based formulation is that, under mild assumptions, the **signed-distance function** can itself serve as an RCBF. For a closed set \(S\), the signed distance is \[ \mathrm{sd}(x,S)= \begin{cases} \inf_{y\in\partial S}\|y-x\|, & x\notin S,\\ -\inf_{y\in\partial S}\|y-x\|, & x\in S, \end{cases} \] and the candidate barrier is \[ \hat h(x)=-\mathrm{sd}(x,S). \] If a classical CBF \(h\) satisfies the sector containment condition \[ (h(x)-a_1\mathrm{sd}(x,h_{\le 0}))(h(x)-a_2\mathrm{sd}(x,h_{\le 0}))\le 0 \] over \(D_0=h_{\ge -c}\), and if \(S\) is closed with \[ h_{\ge 0}\subseteq S\subseteq h_{\ge -c}, \qquad \partial S\cap h_{=0}=\emptyset, \] then \(\hat h\) is an RCBF over \(\hat D_0=\hat h_{\ge -\hat c}\) for suitable \(\hat\alpha>\alpha\), \(\hat\beta<\beta\), and an explicit lower bound on \(\hat\tau\) [2510.02127]. This turns barrier construction into **set identification**. Instead of synthesizing a smooth certificate directly, one can identify a set \(S\) and define the barrier as its signed distance. The paper uses this observation to propose a data-driven nonparametric method based on adaptive cell decomposition. The state space is partitioned into disjoint cells \[ \mathcal G=\{g_i:=\mathcal B_{r_i}(x_i)\}_{i=1}^{|\mathcal G|}, \] with tentative safe cells \(\mathcal G_s\), unsafe cells \(\mathcal G_u\), and candidate set \[ S=\bigcup \mathcal G_s. \] The certification logic is trajectory-based. For two initial states \(x\) and \(y\) in the same radius-\(r\) ball and under the same control, the trajectory deviation implies \[ |\mathrm{sd}(\phi(t,y,u),S)-\mathrm{sd}(\phi(t,x,u),S)|\le r e^{Lt}. \] This bound yields robust sufficient tests for whether an entire cell is outside or inside the \(\tau\)-backward reachable tube of the unsafe set, and whether the RCBF recurrence condition holds or fails throughout the cell. Unresolved cells are split into smaller balls of radius \(r/3\) using the stencil \[ P=\left\{x+\frac{2r}{3}\boldsymbol\delta \mid \boldsymbol\delta\in\{-1,0,1\}^n\right\}. \] Because each cell can be processed independently, the method is described as massively parallelizable [2510.02127]. The same paper reports a 3D evasion example with \(\tau=1\) s and \(n_s=3000\) control samples per cell. At tested resolutions \(r_{\min}=1.111, 0.370, 0.123, 0.041\), HJ reachability captured \(0.510\), \(0.900\), \(0.953\), and \(1\) of the unsafe zone, respectively, while the recurrent-set method captured \(1\) at all tested resolutions. The reported computation times were \(0.02\), \(0.19\), \(2.33\), and \(83.73\) s for HJ, and \(0.13\), \(0.61\), \(3.19\), and \(19.75\) s for the recurrent-set method [2510.02127]. The layered RTF-based paper gives a different implementation profile. In a 2D double-integrator FoM with a first-order RoM, the RoM safe velocity is produced by the QP \[ \arg\min_{\dot z_s\in\mathbb R^2} (\dot z_s-\dot z_d)^\top(\dot z_s-\dot z_d) \] subject to \[ n_i^\top \dot z_s \ge -\alpha(\|z-o_i\|-r_i), \] and the FoM controller is \[ u = -K_D(\dot z-\dot z_s). \] Using \(K_P=1.8\), \(K_D=8\), and an exponentially convergent tracking error with \(\beta=2.45\) and \(M=3.24\) when the CBF constraint is inactive, the study compares \(\alpha=5\), \(\alpha=1\), and \(\alpha=0.5\). Safety can fail when the RoM CBF is invalid, and it also cannot be guaranteed when the initial state lies outside \(S_V\); only when the RoM CBF is valid and the initial condition lies in \(S_V\) does the FoM remain safe for all time [2510.01147]. ## 5. Relation to standard, reciprocal, robust, and learning-based barrier methods The foundational difference between recurrent and classical CBFs is structural. Classical zeroing and reciprocal CBFs certify forward invariance of a set or of its interior through pointwise inequalities on the infinitesimal dynamics [1609.06408]. Recurrent CBFs replace that with a finite-horizon recurrence inequality. In the direct recurrent formulation, the set \(h_{\ge 0}\) need not be invariant; in the layered formulation, the auxiliary superlevel set \(\{h_V\ge 0\}\) need not be forward invariant either, even though it is used to prove forward invariance of the original FoM safety set [2510.01147]. The distinction from **reciprocal** CBFs is especially important because Ames, Xu, Grizzle, and Tabuada use “RCBF” to mean **Reciprocal Control Barrier Function**, and later stochastic work uses the same acronym in the reciprocal sense [1609.06408]. The distinction from **robust** CBFs is equally important: papers on multiple robust CBFs for bounding-box constraints and on high-relative-degree satellite safety also use “RCBF” to mean **Robust Control Barrier Function**, with the central issue being feasibility under disturbances and input constraints rather than recurrence [2503.18524], [2107.04094]. Several adjacent learning-based works are relevant but not terminologically identical. One paper learns a feasibility boundary for CBF/HOCBF QPs and improves it with a recurrent training algorithm, but it does not define a recurrent control barrier function as a new barrier object [2303.09403]. Another learns discrete-time CPA barrier functions from one-step data via the recursive condition \[ W(g(x,u))-\gamma(W(x),x)\le 0, \] which is a one-step invariance recurrence rather than the continuous-time \(\tau\)-return notion used by recurrent CBFs [2511.20463]. A plausible implication is that the recurrent CBF idea is part of a broader shift from purely differential barrier certificates toward trajectory-level and data-driven safety conditions, but the formal definitions are not interchangeable. ## 6. Assumptions, conservatism, and unresolved issues The recurrent formulations obtain their flexibility by trading pointwise invariance conditions for stronger auxiliary assumptions elsewhere. In the layered RTF construction, one must verify forward completeness and local Lipschitz continuity, the relative-degree compatibility relation \[ \left.\frac{\partial \Pi}{\partial x}\right|_x F(x,u)=f(\Pi(x),\Psi(x)), \] the bounded barrier-gradient condition \[ \|\nabla h(\Pi(x))\|\le C_h, \] a valid RoM CBF, a valid RTF with constants \(a_1,a_2,\beta,\tau\), and the strict separation condition \(\beta>\alpha\). Safety is guaranteed only for the margin-restricted subset \[ (\Pi(x),\dot e)\in S_V, \] not for all \(x\in S_{\mathrm{FoM}}\). Under disturbances, the initial margin must be enlarged further to \(S_{Vd}\) [2510.01147]. In the signed-distance and nonparametric formulation, the safety guarantee depends on excluding the \(\tau\)-backward reachable tube of the unsafe set and on verifying recurrence over cells using a Lipschitz bound \(L\). The paper explicitly notes that quantifying the approximation gap between the computed and true safe set remains future work, and it does not provide a formal sampling-complexity or error law. Sparse sampling or overly conservative Lipschitz bounds enlarge the robust margins \(re^{Lt}\), which can make certification conservative. The method still faces refinement growth in high dimensions, although more gracefully and more parallelizably than global PDE or SOS approaches [2510.02127]. The choice of \(\tau\) is itself a conservatism–cost parameter. In the nonparametric recurrent-set method, as \(\tau\to 0\), recurrent sets approach invariant sets; smaller \(\tau\) reduces the volume gap relative to the HJ/BRT benchmark, but computation time increases sharply, approximately exponentially [2510.02127]. This suggests that recurrent CBFs are not a replacement for invariant-set methods in all regimes. Rather, they supply a different safety geometry—finite-time return, not perpetual stay-inside—that can be advantageous when invariant barrier synthesis is computationally prohibitive or when transient departures of auxiliary certificates are acceptable. In that sense, recurrent control barrier functions define a distinct safety paradigm within barrier-function theory. They preserve the barrier viewpoint, but shift the certifying mechanism from instantaneous inward-pointing inequalities to trajectory recurrence over finite horizons. Source: https://www.emergentmind.com/topics/recurrent-control-barrier-functions-rcbfs