This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\UseRawInputEncoding

Prescribed-Time Safety Design for a Chain of Integrators

Imoleayo Abel, Drew Steeves, Miroslav Krstić, and Mrdjan Janković Imoleayo Abel, Drew Steeves, and Miroslav Krstić are with the Department of Mechanical and Aerospace Engineering, University of California, San Diego, CA 92093-0411, USA, {iabel,dsteeves,krstic}@ucsd.edu.Mrdjan Janković is with Ford Research and Advanced Engineering, Dearborn, MI 48124 USA, [email protected]
Abstract

Safety in dynamical systems is commonly pursued using control barrier functions (CBFs) which enforce safety-constraints over the entire duration of a system’s evolution. We propose a prescribed-time safety (PTSf) design which enforces safety only for a finite time of interest to the user. While traditional CBF designs would keep the system away from the barrier longer than necessary, our PTSf design lets the system reach the barrier by the prescribed time and obey the operator’s intent thereafter. To emphasize the capability of our design for safety constraints with high relative degrees, we focus our exposition on a chain of integrators where the safety condition is defined for the state furthest from the control input. In contrast to existing CBF-based methods for high-relative degree constraints, our approach involves choosing explicitly specified gains (instead of class 𝒦\mathcal{K} functions), and, with the aid of backstepping, operates in the entirety of the original safe set with no additional restriction on the initial conditions. With Quadratic Programming (QP) being employed in the design, in addition to backstepping and CBFs with a PTSf property, we refer to our design as a QP-backstepping PT-CBF design. For illustration, we include a simulation for the double-integrator system.

I Introduction

I-A Hi-rel-deg CBFs

CBFs have become a popular tool for synthesizing safe controllers for dynamical systems and have been used in a wide range of problem domains: multi-agent robotics [29, 10], robust safety [15, 18, 41], automotive systems [28, 2], delay systems [22, 1, 14], and stochastic systems [6, 27, 30] to mention a few. First defined in [38] and later refined and popularized by the seminal papers [3, 2], CBFs are often employed in a “safety filter” framework where they’re used for generating safe control overrides for a potentially unsafe nominal controller. In essence, a nominal controller is designed to achieve a desired performance objective, and a CBF-based control override is used whenever the nominal controller is unsafe.

In its initial conception [38, 2], CBFs were specified for safety constraints of relative degree one i.e. constraints whose time derivative depend explicitly on the input. The extension of CBFs to constraints with high-relative degree (hi-rel-deg CBFs) was first studied independently in [13, 39] with much progress following in [23, 42, 40, 5]. In [39], the extension was limited to the relative degree two case, and in [13] where CBFs of arbitrarily high relative degree was introduced, its usage for a relative degree rr case involves choosing r1r-1 bounded, positive definite functions that satisfy additional derivative conditions [13, Eq. (26)] – a requirement that limits the utility of [13] for significantly high relative degree constraints. A similar limitation applies to more recent treatment [40] which requires choosing and tuning rr class-𝒦\mathcal{K} functions, whose choice determines the subset of the original safe set that is kept forward invariant. Building off [39], exponential CBFs were reported in [23] and allowed the use of simple linear control tools to design CBFs for high relative degree constraints.

I-B The “non-overshooting control” roots of hi-rel-deg CBFs

A year before [38], eight years before [2], and ten years before [23], a design for stabilization to an equilibrium point at the barrier was introduced, under the name “non-overshooting control,” in the 2006 paper [19] (following its conference version in 2005). This design possesses all the attributes of a safety design with a CBF of a uniform and high relative degree111Uniformity of the CBF’s relative degree gives the equivalence of a general control-affine system with the strict-feedback class and the convertibility of the safe set, given by the CBF positivity constraint, into a semi-infinite interval constraint for the first state of the strict-feedback system. (sans the CBF terminology) with only the QP step absent since, for stabilization at the barrier, QP is subsumed in the stabilization design (the nominal feedback and the safety-filtered feedback are the same).

The interest in non-overshooting control in the 1990s came from applications—spacecraft docking, aerial refueling, machining, etc., with no margin for error in downward setpoint regulation. The non-overshooting control problem for linear systems, albeit mostly for zero initial conditions and nonzero setpoints, was solved in [25, 4, 31].

The paper [19] introduced the following two ideas (translated to the current CBF terminology). First, for a system with a hi-rel-deg CBF, a transformation, by backstepping, into a particular target system in the form of a chain of first-order CBF subsystems (resulting in all real poles in the linear case) is performed. Second, in order to ensure that all the CBF “states” of this chain begin and remain positive, the positivity of their initial values is ensured by choosing the backstepping gains in accordance with the initial conditions so the entire CBF chain is initialized positively.

This chain structure and the gain selection of [19, Eq. (12), (13)], regarded through the lens of pole placement, were independently discovered in the 2016 paper [23, Cor. 2]. Likewise, the nonlinear damping choices in the CBF chain in [19, Eq. (53), (54)] was independently proposed in the 2019 paper [40]. Additionally pursued in [19], but not in [23, 40], was a form of input-to-state safety (ISSf) in the presence of disturbances. This notion, though not explored for hi-rel-deg CBFs, is rigorously conceived in [18].

Inspired by non-overshooting control under disturbances in [19], (i.e. stabilization to an equilibrium at the barrier along with ISSf), mean-square stabilization of stochastic nonlinear systems to an equilibrium at the barrier, along with a guarantee of non-violation of the barrier in the mean sense, is solved in [20].

With a nearly negligible QP modification, the stabilizing feedbacks in [19] can be used in safety filters. Hence, backstepping generates a safety-filter with explicit tuning variables that dictate the exponential approach to the barrier.

I-C Prescribed-time safety (PTSf)

Recent advances in prescribed-time stabilization (PTS) [32] have resulted in time-varying backstepping controllers that guarantee settling times independent of initial conditions. Extensions have been developed to stochastic nonlinear systems [21], infinite-dimensional systems [7, 35, 36], and even coupled systems with finite/infinite-dimensional subsystems [8, 34, 33]. PTS is a subset of both the finite-time [11] and fixed-time [26] notions (i.e., stronger than both).

The success in achieving stabilization in prescribed time, independent of initial conditions, raises the question of pursuing the safety counterpart of the same notion. The “translation” from stability to safety may be a bit counterintuitive: while PTS guarantees that the state reaches the equilibrium no later than a prescribed time TT, PTSf guarantees that the state cannot reach the barrier sooner than a prescribed time TT.

In what context is such a PTSf property useful? First, it should be noted that PTSf is “less safe” than exponential safety (ESf). Less safe is useful by not being needlessly conservative. If the desired operation is in the barrier’s proximity, and especially if the desired operation is beyond the barrier, where it is safe to be after time TT, PTSf offers obvious performance (or alertness) advantages over ESf. It is even known in the automotive area that “too safe” may mean very unsafe: a follower vehicle that keeps a large distance ‘invites’ vehicles from other lanes to cut in [12].

We distinguish our notion of PTSf from existing notions of limited duration safety [24], and periodic safety using fixed-time CBFs [9]. Specifically, [9] introduced the notion of periodic safety where the objective is to keep a system safe for all times while enforcing that it periodically (with time period TT) visits a goal set inside the safe set. In [24] the notion of limited duration safety was studied, and like PTSf it implies that a system is kept safe only for a limited duration TT. While [24] restricts the set of initial conditions—a set that shrinks as TT increases [24, Rk. 2]—to be a strict subset of the safe set [24, Eq. (3)], our notion of PTSf places no restriction on the initial conditions of the system.

Finally, two distinct features of the time-varying backstepping technique make it quite attractive for use in safety-filter design. The first is that, compared to ESf designs, the PTSf filters designed with time-varying backstepping do not exhibit large transients when the safety filter overrides the nominal controller. This is not the case for ESf filters with rapid decay rates: the so-called “peaking” phenomenon [17, 37, 16] is exhibited, which causes some of the states to become very large near the initialization time, before rapidly converging to the equilibrium. This behavior can cause large state-derivatives, which, e.g., is undesirable in vehicle systems where maneuvers causing large acceleration and “jerk” can be dangerous. PTSf safety-filter designs avoid peaking by using small gains near initialization time that only grow large as the state grows “small”.

The second feature making time-varying backstepping attractive is the behavior of the convergence it achieves near the terminal time. PTSf achieves convergence with “infinitely-soft” landing, that is, the state and all of its derivatives converge to the equilibrium by the terminal time. This feature occurring in finite time is unique to PTSf, and is desirable because it can ensure, e.g., “jerk-free” safety maneuvers by the terminal time.

II Problem Description and Preliminaries

II-A Problem Description

We study systems in the chain-of-integrator form

x˙i(t)\displaystyle\dot{x}_{i}(t) =xi+1(t),i=1,,n1,\displaystyle=x_{i+1}(t),\quad i=1,\dots,n-1, (1)
x˙n(t)\displaystyle\dot{x}_{n}(t) =u(t),\displaystyle=u(t),
y(t)\displaystyle y(t) =x1(t),tt0,\displaystyle=x_{1}(t),\quad\quad t\geq t_{0},

with relative degree nn, where t00t_{0}\geq 0 is the initialization time, x(t)=[x1(t),,xn(t)]nx(t)=[x_{1}(t),\dots,x_{n}(t)]^{\top}\in\mathbb{R}^{n} is the state with initial condition x(t0)x(t_{0}), and u(t)u(t)\in\mathbb{R} is the control input. The control objective is to enforce “safety”, defined here as the non-positivity of the output y(t)y(t) over the finite time horizon [t0,t0+T)[t_{0},t_{0}+T), where TT is a terminal time that can be a priori prescribed.

II-B Preliminaries

We denote by ‘\mathbb{N}’ the set of natural numbers excluding 0. Our PTSf designs will be generated by the following “blow-up” function:

μm(tt0,T)\displaystyle\mu_{m}(t-t_{0},T) =1νm(tt0,T),t[t0,t0+T)\displaystyle=\frac{1}{\nu^{m}(t-t_{0},T)},\quad t\in[t_{0},t_{0}+T) (2)

for m2m\in\mathbb{N}_{\geq 2} and the terminal time T>0T>0, where

ν(tt0,T)\displaystyle\nu(t-t_{0},T) :=T+t0tT\displaystyle:=\frac{T+t_{0}-t}{T} (3)

decays linearly from one to zero by the terminal time. We denote by mk¯m^{\overline{k}} the rising factorial for m,km,k\in\mathbb{N}, that is,

mk¯\displaystyle m^{\overline{k}} :=m(m+1)(m+k1);\displaystyle:=m(m+1)\cdots(m+k-1); (4)

the derivatives of μm\mu_{m} are

μm(i)(tt0,T)=mi¯Tiμm+i(tt0,T).\displaystyle\mu_{m}^{(i)}(t-t_{0},T)=\frac{m^{\overline{i}}}{T^{i}}\mu_{m+i}(t-t_{0},T). (5)

For the rest of this paper, we shall use μm\mu_{m} and μm(t)\mu_{m}(t) to denote μm(tt0,T)\mu_{m}(t-t_{0},T) for brevity when there is no confusion.
We denote my 𝒫n(x)\mathcal{P}^{n}(x) an nnth-order polynomial in xx.

III NNth-Order Chain-of-Integrators Design

We begin by performing a time-varying backstepping transformation defined as follows, for t[t0,t0+T)t\in[t_{0},t_{0}+T):

hi\displaystyle h_{i} :=xi+αi1(x¯i1,t),i=1,,n,\displaystyle:=-x_{i}+\alpha_{i-1}(\underline{x}_{i-1},t),\quad i=1,\dots,n, (6)
α0(x¯0,t)\displaystyle\alpha_{0}(\underline{x}_{0},t) 0,\displaystyle\;\equiv 0, (7)
αi(x¯i,t)\displaystyle\alpha_{i}(\underline{x}_{i},t) :=ciμ2hi+ddtαi1(x¯i1,t),i=1,,n,\displaystyle:=c_{i}\mu_{2}h_{i}+\frac{d}{dt}\alpha_{i-1}(\underline{x}_{i-1},t),\ \ i=1,\dots,n, (8)

where cic_{i}, i=1,,ni=1,\dots,n are design parameters to be determined. We call the transformed states hih_{i}, i=1,,ni=1,\dots,n barrier functions to connote the desire to keep their values positive, provided that the initial values hi(t0)h_{i}(t_{0}) are positive as is typical with CBFs. For the control input, we use the safety-filter

u\displaystyle u ={min{unom,αn(x¯n,t)},if t0t<t0+T,unomg(t,x1(t0+T)),if tt0+T,\displaystyle=\begin{cases}\min\left\{u_{\text{nom}},\ \alpha_{n}(\underline{x}_{n},t)\right\},&\text{if }t_{0}\leq t<t_{0}+T,\\ u_{\text{nom}}g(t,x_{1}(t_{0}+T)),&\text{if }t\geq t_{0}+T,\end{cases} (9)

where unomu_{\text{nom}} is a potentially unsafe nominal controller and gg is the “ramp” function

g(t,x1(t0+T))\displaystyle g(t,x_{1}(t_{0}+T)) (10)
:={1νm(tt0T,T¯),if x1(t0+T)=0,t0+Ttt0+T+T¯,1,otherwise,\displaystyle:=\begin{cases}1-\nu^{m}(t-t_{0}-T,\bar{T}),&\text{if }x_{1}(t_{0}+T)=0,\\ &t_{0}+T\leq t\leq t_{0}+T+\bar{T},\\ 1,&\text{otherwise},\end{cases}

where mm\in\mathbb{N} and T¯>0\bar{T}>0 are design parameters. The role of gg in the product unomg(t,x1(t0+T))u_{\mathrm{nom}}g(t,x_{1}(t_{0}+T)) in (9) is to ensure that the control law is continuous at t=t0+Tt=t_{0}+T, since we will show that the feedback law αn(x¯n,t0+T)=0\alpha_{n}(\underline{x}_{n},t_{0}+T)=0 (cf. Section IV). As defined, the continuity of the controller (9) follows from the continuity of unomu_{\text{nom}}.

Strictly speaking, the safety-filter (9) during times t0t<t0+Tt_{0}\leq t<t_{0}+T is the solution of the QP problem

u=\displaystyle u= argminv|vunom|2\displaystyle\operatorname*{arg\,min}_{v\in\mathbb{R}}\ |v-u_{\text{nom}}|^{2} (11)
subject tovαn\displaystyle\text{subject to}\ \ v\leq\alpha_{n}

where constraint vαnv\leq\alpha_{n} is equivalent to h˙n+cnμ2hn0\dot{h}_{n}+c_{n}\mu_{2}h_{n}\geq 0 under input vv. Therefore, we refer to our design as a QP-backstepping PT-CBF design.

With the safety-filter (9), the CBFs (6) satisfy

h˙i\displaystyle\dot{h}_{i} =ciμ2hi+hi+1,i=1,,n1,\displaystyle=-c_{i}\mu_{2}h_{i}+h_{i+1},\quad i=1,\dots,n-1, (12)
h˙n\displaystyle\dot{h}_{n} cnμ2hn,\displaystyle\geq-c_{n}\mu_{2}h_{n}, (13)

for t[t0,t0+T)t\in[t_{0},t_{0}+T). We can now state our main result.

Theorem 1

If the system (1) is initially safe, that is, y(t0)<0y(t_{0})<0, then the controller (6)–(9) ensures that y(t)<0y(t)<0 for all t[t0,t0+T)t\in[t_{0},t_{0}+T) for the initial control gains

ci>max{0,c¯i},i=1,,n1,c_{i}>\max\left\{0,\underline{c}_{i}\right\},\quad i=1,\dots,n-1, (14)

where

c¯i\displaystyle\underline{c}_{i} =xi+1(t0)ddtαi1(x¯i1(t0),t0)αi1(x¯i1(t0),t0)xi(t0),\displaystyle=\frac{x_{i+1}(t_{0})-\frac{d}{dt}\alpha_{i-1}(\underline{x}_{i-1}(t_{0}),t_{0})}{\alpha_{i-1}(\underline{x}_{i-1}(t_{0}),t_{0})-x_{i}(t_{0})}, (15)

and cn0c_{n}\geq 0. Moreover, the control law (9) is uniformly bounded provided that unomu_{\mathrm{nom}} is continuous in the interval [t0,t0+T][t_{0},t_{0}+T].

Remark 1

While not characterized in Theorem 1, if the safety filter overrides the nominal controller over the time interval [t0+t¯,t0+T)[t_{0}+\bar{t},t_{0}+T) for some t¯<T\bar{t}<T, then the convergence of the CBFs to zero with be “infinitely-soft”: that is, all of the derivatives dkhi(t)dtk\frac{d^{k}h_{i}(t)}{dt^{k}}, kk\in\mathbb{N}, will also converge to zero by the terminal time t0+Tt_{0}+T. This also holds true for the xx-system states. See Section IV, and in particular, (32) and (34) for the mathematical treatment of this “infinitely-soft” convergence.

IV Proof of Theorem 1

The structure of our proof comes in two parts: one to establish non-positivity of y(t)y(t) for t[t0,t0+T)t\in[t_{0},t_{0}+T); and another to establish uniform boundedness of the control law which filters the nominal controller to enforce safety. To this end, we first present the following commutativity property of the “blow-up” function (2) which we will leverage to show controller boundedness. To simplify our presentation, we take t0=0t_{0}=0 henceforth.

Lemma 2

For m1m\in\mathbb{N}_{\geq 1} and 0t¯t<T0\leq\bar{t}\leq t<T, the “blow-up” function (2) satisfies

μm(t,T)=μm(t¯,T)μm(tt¯,Tt¯).\displaystyle\mu_{m}(t,T)=\mu_{m}(\bar{t},T)\mu_{m}(t-\bar{t},T-\bar{t}). (16)

Proof: Omitted due to space limitation.

To demonstrate controller uniform boundedness, we must leverage the fact that the feedback law invokes PTSf whose convergence dominates the rate of divergence of the time-varying control gains in (8). To accomplish this, we characterize the following property of the closed-loop system.

Lemma 3

For c>0c>0, the iith derivative of the function

ξ(t):=ecT(μ1(t,T)1)\displaystyle\xi(t):=e^{-cT\left(\mu_{1}(t,T)-1\right)} (17)

satisfies

limtTdiξ(t)dti=limtT𝒫2i(μ1(t,T))ξ(t)=0,i.\displaystyle\lim_{t\rightarrow T^{-}}\frac{d^{i}\xi(t)}{dt^{i}}=\lim_{t\rightarrow T^{-}}\mathcal{P}^{2i}\left(\mu_{1}(t,T)\right)\xi(t)=0,\ i\in\mathbb{N}. (18)

Proof: Follows by induction and repeated application of l’Hôpital’s rule. Details to be included in a journal version.

We can now proceed with the proof of Theorem 1.

Proof:

We first pursue non-positivity of y(t)y(t) under (9), (14), (15). The system beginning from safety, that is, y(t0)=x1(t0)<0y(t_{0})=x_{1}(t_{0})<0, implies that h1(t0)>0h_{1}(t_{0})>0. We proceed by induction: suppose hi(t0)>0h_{i}(t_{0})>0 for some i=1,,n1i=1,\dots,n-1; it follows from (12) and differentiating (6) along (1) that

hi+1(t0)\displaystyle h_{i+1}(t_{0}) =cihi(t0)xi+1(t0)+ddtαi1(x¯i1(t0),t0)\displaystyle=c_{i}h_{i}(t_{0})-x_{i+1}(t_{0})+\frac{d}{dt}\alpha_{i-1}(\underline{x}_{i-1}(t_{0}),t_{0}) (19)

The initial control gains (14), (15) are designed so that

cihi(t0)xi+1(t0)+ddtαi1(x¯i1(t0),t0)>0,\displaystyle c_{i}h_{i}(t_{0})-x_{i+1}(t_{0})+\frac{d}{dt}\alpha_{i-1}(\underline{x}_{i-1}(t_{0}),t_{0})>0, (20)

where we’ve used (6). With hi(t0)>0h_{i}(t_{0})>0 i=1,,n\forall i=1,\dots,n, it is easy to show by backwards strong induction and the variation of constants formula that hi(t)>0h_{i}(t)>0 for t[t0,t0+T)t\in[t_{0},t_{0}+T).

We now pursue uniform boundedness of the the control law (9). We partition the time horizon [0,T)[0,T) into intervals for which the system is either deemed safe or unsafe according to the safety filter (9) by defining

for kk\in\mathbb{N} with t0=0t_{0}=0, where

[0,T)=k{0}tk+1T[tk,tk+1).\displaystyle[0,T)=\bigcup_{\begin{subarray}{c}k\in\mathbb{N}\cup\{0\}\\ t_{k+1}\leq T\end{subarray}}[t_{k},t_{k+1}). (21)

We have constructed this partition such that the control law (9) remains continuous at tkt_{k}, precluding Zeno behavior of the closed-loop system. Since the system is initially safe, t1Tt_{1}\neq T represents the first time that safety is enforced by (9). For t[t2k,t2k+1)t\in[t_{2k},t_{2k+1}), k{0}k\in\mathbb{N}\cup\{0\} and t2k+1Tt_{2k+1}\leq T, we define

hi2k\displaystyle h_{i}^{2k} :=xi+αi12k(x¯i1,tt2k),\displaystyle:=-x_{i}+\alpha_{i-1}^{2k}(\underline{x}_{i-1},t-t_{2k}), (22)
αi2k(x¯i,tt2k)\displaystyle\alpha_{i}^{2k}(\underline{x}_{i},t-t_{2k}) :=ci2kμ2(tt2k,Tt2k)hi2k\displaystyle:=c_{i}^{2k}\mu_{2}(t-t_{2k},T-t_{2k})h_{i}^{2k}
+ddtαi12k(x¯i1,tt2k)\displaystyle\;+\frac{d}{dt}\alpha_{i-1}^{2k}(\underline{x}_{i-1},t-t_{2k}) (23)

for i=1,,ni=1,\dots,n, with α02k(x¯0,tt2k)0\alpha_{0}^{2k}(\underline{x}_{0},t-t_{2k})\equiv 0. Similarly, for t[t2k1,t2k)t\in[t_{2k-1},t_{2k}), kk\in\mathbb{N} and t2kTt_{2k}\leq T, we define the CBFs

hi2k1\displaystyle h_{i}^{2k-1} :=xi+αi12k1(x¯i1,tt2k1),\displaystyle:=-x_{i}+\alpha_{i-1}^{2k-1}(\underline{x}_{i-1},t-t_{2k-1}), (24)
αi2k1\displaystyle\alpha_{i}^{2k-1} (x¯i,tt2k1):=ddtαi12k1(x¯i1,tt2k1)\displaystyle(\underline{x}_{i},t-t_{2k-1}):=\frac{d}{dt}\alpha_{i-1}^{2k-1}(\underline{x}_{i-1},t-t_{2k-1}) (25)
+ci2k1μ2(tt2k1,Tt2k1)hi2k1\displaystyle\qquad+c_{i}^{2k-1}\mu_{2}(t-t_{2k-1},T-t_{2k-1})h_{i}^{2k-1}

for i=1,,ni=1,\dots,n, with α02k1(x¯0,tt2k1)0\alpha_{0}^{2k-1}(\underline{x}_{0},t-t_{2k-1})\equiv 0. We select ci0=cic_{i}^{0}=c_{i} according to (14), (15), and we select

cik=cik1μ2(tktk1,Ttk1),k.\displaystyle c_{i}^{k}=c_{i}^{k-1}\mu_{2}(t_{k}-t_{k-1},T-t_{k-1}),\quad k\in\mathbb{N}. (26)

Since α02k(x¯0,tt2k)=α02k1(x¯0,tt2k1)0\alpha_{0}^{2k}(\underline{x}_{0},t-t_{2k})=\alpha_{0}^{2k-1}(\underline{x}_{0},t-t_{2k-1})\equiv 0, it follows that h12k(t2k1)=h12k1(t2k1)h_{1}^{2k}(t_{2k-1})=h_{1}^{2k-1}(t_{2k-1}) for kk\in\mathbb{N}. Furthermore, by applying the initial gain selection (26) to (24), (25) and comparing them to (22), (23) at t=t2k1t=t_{2k-1}, we deduce that hi2k(t2k1)=hi2k1(t2k1)h_{i}^{2k}(t_{2k-1})=h_{i}^{2k-1}(t_{2k-1}) for i=2,,ni=2,\dots,n. The same treatment leads to the equalities hi2k(t2k)=hi2k1(t2k)h_{i}^{2k}(t_{2k})=h_{i}^{2k-1}(t_{2k}) for i=1,,ni=1,\dots,n. Hence, the initial gain selection (26) for each time partition in (21) ensures that the system dynamics remain continuous at every time. In fact, it simply tracks the growth of the “blow-up” function μ2\mu_{2} over the time intervals.

Furthermore, we can leverage Lemma 2 and the initial gain selection (26) to show that

kcikμ2(ttk,Ttk)=μ2(t,T);\displaystyle\prod_{k\in\mathbb{N}}c_{i}^{k}\mu_{2}(t-t_{k},T-t_{k})=\mu_{2}(t,T); (27)

in other words, the CBF design over the partitioned set (21) is consistent with the design (6)–(15).

For t[t2k,t2k+1)t\in[t_{2k},t_{2k+1}), k{0}k\in\mathbb{N}\cup\{0\} and t2k+1Tt_{2k+1}\leq T, the system is safe and the nominal control—which we assume to be uniformly bounded (continuous over a compact time interval)—is being applied. For t[t2k1,t2k)t\in[t_{2k-1},t_{2k}), kk\in\mathbb{N} and t2kTt_{2k}\leq T, we must estimate the size of the time-varying input to verify that it is bounded. It follows from (9) adapted as u=αn2k1(x¯n,tt2k1)u=\alpha_{n}^{2k-1}(\underline{x}_{n},t-t_{2k-1}) that during these intervals, the CBFs satisfy

h˙i2k1\displaystyle\dot{h}_{i}^{2k-1} =ci2k1μ2(tt2k1,Tt2k1)hi2k1+hi+12k1,\displaystyle=-c_{i}^{2k-1}\mu_{2}(t-t_{2k-1},T-t_{2k-1})h_{i}^{2k-1}+h_{i+1}^{2k-1}, (28)
h˙n2k1\displaystyle\dot{h}_{n}^{2k-1} =cn2k1μ2(tt2k1,Tt2k1)hn2k1,\displaystyle=-c_{n}^{2k-1}\mu_{2}(t-t_{2k-1},T-t_{2k-1})h_{n}^{2k-1}, (29)

for i=1,,n1i=1,\dots,n-1. To this end, we first study the stability of (28), (29). We can solve (29) explicitly to obtain

hn2k1(t)\displaystyle h_{n}^{2k-1}(t) (30)
=ecn2k1(Tt2k1)(μ1(tt2k1,Tt2k1)1)hn2k1(t2k1),\displaystyle=e^{-c_{n}^{2k-1}(T-t_{2k-1})(\mu_{1}(t-t_{2k-1},T-t_{2k-1})-1)}h_{n}^{2k-1}(t_{2k-1}),

whereas for i=1,,n1i=1,\dots,n-1, we have the relationship

hi2k1(t)\displaystyle h_{i}^{2k-1}(t)
=eci2k1(Tt2k1)(μ1(tt2k1,Tt2k1)1)hi2k1(t2k1)\displaystyle=e^{-c_{i}^{2k-1}(T-t_{2k-1})(\mu_{1}(t-t_{2k-1},T-t_{2k-1})-1)}h_{i}^{2k-1}(t_{2k-1})
+t2k1teci2k1τtμ2(zt2k1,Tt2k1)𝑑zhi+1(τ)𝑑τ.\displaystyle+\int_{t_{2k-1}}^{t}e^{-c_{i}^{2k-1}\int_{\tau}^{t}\mu_{2}(z-t_{2k-1},T-t_{2k-1})dz}h_{i+1}(\tau)d\tau. (31)

We apply Lemma 3 to (30) to establish that successive derivatives of (30) will converge to zero by the terminal time:

limtTdrhn2k1(t)dtr=0,t[t2k1,T],\displaystyle\lim_{t\rightarrow T^{-}}\frac{d^{r}h_{n}^{2k-1}(t)}{dt^{r}}=0,\quad t\in[t_{2k-1},T^{-}], (32)

for r{0}r\in\mathbb{N}\cup\{0\}. For i=1,,n1i=1,\dots,n-1, we compute

dhi2k1(t)dt=hi+1(t)+hi2k1(t2k1)×\displaystyle\frac{dh_{i}^{2k-1}(t)}{dt}=h_{i+1}(t)+h_{i}^{2k-1}(t_{2k-1})\times (33)
ddt(eci2k1(Tt2k1)(μ1(tt2k1,Tt2k1)1)).\displaystyle\qquad\qquad\frac{d}{dt}\left(e^{-c_{i}^{2k-1}(T-t_{2k-1})(\mu_{1}(t-t_{2k-1},T-t_{2k-1})-1)}\right).

By applying Lemma 3 to the second term within (33), and by backward strong induction on (32), we get for r{0}r\in\mathbb{N}\cup\{0\}

limtTdrhi2k1(t)dtr=0,i=1,,n1.\displaystyle\lim_{t\rightarrow T^{-}}\frac{d^{r}h_{i}^{2k-1}(t)}{dt^{r}}=0,\quad i=1,\dots,n-1. (34)
Refer to caption
Figure 1: System trajectories (left) and outputs (right) for double integrator under nominal controller (42) with terminal time T=4T=4, and initial condition (x1(0),x2(0))=(4,2)(x_{1}(0),x_{2}(0))=(-4,2). The PTSf safety-filter uses (9) with c2=c1=0.6c_{2}=c_{1}=0.6 while the ESf safety-filter uses (37) with ρ=0.6\rho=0.6 and ρ=3.2\rho=3.2 – the latter value tuned to make ESf react at the same instant as PTSf.
Refer to caption
Figure 2: Left: Control signal. Right: Jerk during intervals when nominal command is overridden. When ESf is tuned (ρ=3.2\rho=3.2 case) to be less conservative like PTSf, the magnitude of the jerk increases significantly.

Hence, we have shown that when the nominal controller is overridden by the safety filter to enforce safety during t[t2k1,t2k)t\in[t_{2k-1},t_{2k}), kk\in\mathbb{N} and t2kTt_{2k}\leq T, our time-varying backstepping design ensures that the CBF converge very smoothly to zero by the terminal time—indeed, all of their derivatives also converge to zero by the terminal time.

By using (28) within the derivative term of (25) in an iterative fashion, we can verify by induction that (25) for i=ni=n is equivalent to

αn2k1\displaystyle\alpha_{n}^{2k-1} (x¯n,tt2k1)=r=1n1drdtr(hnr2k1h˙nr12k1)\displaystyle(\underline{x}_{n},t-t_{2k-1})=\sum_{r=1}^{n-1}\frac{d^{r}}{dt^{r}}\left(h_{n-r}^{2k-1}-\dot{h}_{n-r-1}^{2k-1}\right) (35)
+cn2k1μ2(tt2k1,Tt2k1)hn2k1.\displaystyle\qquad+c_{n}^{2k-1}\mu_{2}(t-t_{2k-1},T-t_{2k-1})h_{n}^{2k-1}.

We conclude from (32), (34) and applying l’Hôpital’s rule to (35) as before that

|αn2k1(x¯n,tt2k1)|<+,t[t2k1,t2k),\displaystyle\left|\alpha_{n}^{2k-1}(\underline{x}_{n},t-t_{2k-1})\right|<+\infty,\quad\forall\ t\in[t_{2k-1},t_{2k}), (36)

for kk\in\mathbb{N} and t2kTt_{2k}\leq T. ∎

V Double Integrator Design Interpretation

We consider the double integrator i.e. system (1) with n=2n=2. Suppose that the nominal control input unomu_{\mathrm{nom}} is at risk of making the system unsafe, and we wish to design a time-invariant safety filter that overrides the nominal controller and takes the system to the origin. This problem was studied in [23, Sec. 3.B] for input-output linearized systems via pole-placement (which inherently relies on the backstepping method—see [23, Rk. 5]), which achieves exponential convergence to the origin with arbitrary decay rate. We define the barrier functions h1:=x1h_{1}:=-x_{1}, h2:=x2+ρh1h_{2}:=-x_{2}+\rho h_{1}, ρ>0\rho>0, with the goal of keeping h10h_{1}\geq 0 uniformly. Consider the following time-invariant safety filter designed as in [23]:

u\displaystyle u =min{unom,(2ρ2  3ρ)x},\displaystyle=\min\left\{u_{\text{nom}},-\left(2\rho^{2}\;\;3\rho\right)x\right\}, for t0t<,\displaystyle\text{for }t_{0}\leq t<\infty, (37)

with ρmax{0,x2(t0)/x1(t0)}\rho\geq\max\left\{0,-x_{2}(t_{0})/x_{1}(t_{0})\right\}. Suppose the safety-filter overrides unomu_{\text{nom}} at t=t0+t¯<t=t_{0}+\bar{t}<\infty and continues to enforce safety thereafter (i.e., u(t)=(2ρ2  3ρ)x(t)u(t)=-\left(2\rho^{2}\;\;3\rho\right)x(t) for all tt0+t¯t\geq t_{0}+\bar{t}, placing the closed-loop poles for the xx-system at {ρ,2ρ}\{-\rho,-2\rho\}). Then the closed-loop system is given by

x(t)=eρ(tt0t¯)\displaystyle x(t)=e^{-\rho(t-t_{0}-\bar{t})} (38)
×(2eρ(tt0)1ρeρ(tt0t¯)ρ2ρ(eρ(tt0t¯)1)2eρ(tt0t¯)1)x(t0+t¯).\displaystyle\times\left(\begin{array}[]{c c}2-e^{-\rho(t-t_{0})}&\frac{1}{\rho}-\frac{e^{-\rho(t-t_{0}-\bar{t})}}{\rho}\\ 2\rho\left(e^{-\rho(t-t_{0}-\bar{t})}-1\right)&2e^{-\rho(t-t_{0}-\bar{t})}-1\end{array}\right)x(t_{0}+\bar{t}). (41)

If we wish to achieve large exponential decay when the system is unsafe, we can select ρmax{0,x2(t0)/x1(t0)}\rho\gg\max\left\{0,-x_{2}(t_{0})/x_{1}(t_{0})\right\} as large as desired. However, for small tt0t¯t-t_{0}-\bar{t}, the righthand side of (38) can be very large depending on the size of ρ\rho (in particular, x2x_{2} grows with ρ\rho). This illustrates the “peaking” phenomenon, which was studied for ODE control systems in [17, 37, 16]. We now compare these results graphically to demonstrate the advantages of time-varying backstepping. We perform numerical simulations for the double-integrator system under the nominal controller

unom=4[x1+sin(ωt)+0.8]4[x2+ωcos(ωt)]u_{\text{nom}}=-4\big{[}x_{1}+\sin(\omega t)+0.8\big{]}-4\big{[}x_{2}+\omega\cos(\omega t)\big{]} (42)

with ω=2π/T\omega=2\pi/T where T=4T=4 is the prescribed time. For initial condition x(0)=(4,2)x(0)=(-4,2)^{\top}, we use the time-varying PTSf safety-filter (9) with choice of gains c2=c1=max{0,x2(0)/x1(0)}+0.1=0.6c_{2}=c_{1}=\max\left\{0,-x_{2}(0)/x_{1}(0)\right\}+0.1=0.6 and use ramp function (10) with m=2m=2 and T¯=0.5\bar{T}=0.5. For comparison, we use the time-invariant ESf safety-filter (37) with ρ=0.6\rho=0.6 and ρ=3.2\rho=3.2. The choice ρ=0.6\rho=0.6 was made to allow a gain equivalent to the initial gains of PTSf, and the choice ρ=3.2\rho=3.2 was tuned to make ESf less conservative and to react at around the same instant as PTSf. For numerical stability near the origin, we clip the blow-up function μ2\mu_{2} at a maximum value μ2,max=1000\mu_{2,\max}=1000 — which still allows the PTSf gains grow to several orders of magnitudes larger than ρ=3.2\rho=3.2. The system trajectories under PTSf and ESf are shown in Fig. 1. There, we observe that while ESf can be tuned to be less conservative like PTSf by choosing larger gains, it comes at the expense of a significant jerk.

References

  • [1] I. Abel, M. Janković, and M. Krstić, “Constrained control of input delayed systems with partially compensated input delays,” ASME Dynamic Systems and Controls Conference (DSCC), 2020.
  • [2] A. D. Ames, J. W. Grizzle, and P. Tabuada, “Control barrier function based quadratic programs with application to adaptive cruise control,” in IEEE Conference on Decision and Control, 2014, pp. 6271–6278.
  • [3] 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, pp. 3861–3876, 2017.
  • [4] M. Bement and S. Jayasuriya, “Construction of a set of nonovershooting tracking controllers,” J. Dyn. Sys., Meas., Control, vol. 126, no. 3, pp. 558–567, 2004.
  • [5] J. Breeden and D. Panagou, “High relative degree control barrier functions under input constraints,” in 60th IEEE Conference on Decision and Control (CDC), 2021, pp. 6119–6124.
  • [6] A. Clark, “Control barrier functions for stochastic systems,” Automatica, vol. 130, p. 109688, 2021.
  • [7] N. Espitia, A. Polyakov, D. Efimov, and W. Perruquetti, “Boundary time-varying feedbacks for fixed-time stabilization of constant-parameter reaction-diffusion systems,” Automatica, vol. 103, pp. 398 – 407, 2019.
  • [8] N. Espitia, D. Steeves, W. Perruquetti, and M. Krstic, “Sensor delay-compensated prescribed-time observer for lti systems,” Automatica, vol. 135, p. 110005, 2022.
  • [9] K. Garg, R. K. Cosner, U. Rosolia, A. D. Ames, and D. Panagou, “Multi-rate control design under input constraints via fixed-time barrier functions,” IEEE Control Systems Letters, vol. 6, pp. 608–613, 2022.
  • [10] P. Glotfelter, J. Cortés, and M. Egerstedt, “Nonsmooth barrier functions with applications to multi-robot systems,” IEEE Control Systems Letters, vol. 1, no. 2, pp. 310–315, 2017.
  • [11] V. T. Haimo, “Finite time controllers,” SIAM Journal on Control and Optimization, vol. 24, no. 4, pp. 760–770, 1986.
  • [12] C. R. He and G. Orosz, “Safety guaranteed connected cruise control,” in 21st International Conference on Intelligent Transportation Systems (ITSC), 2018, pp. 549–554.
  • [13] S.-C. Hsu, X. Xu, and A. D. Ames, “Control barrier function based quadratic programs with application to bipedal robotic walking,” in American Control Conference (ACC), 2015, pp. 4542–4548.
  • [14] M. Janković, “Control barrier functions for constrained control of linear systems with input delay,” in American Control Conference (ACC), June 2018, pp. 3316–3321.
  • [15] M. Jankovic, “Robust control barrier functions for constrained stabilization of nonlinear systems,” Automatica, vol. 96, pp. 359–367, 2018.
  • [16] H. K. Khalil and F. Esfandiari, “Semiglobal stabilization of a class of nonlinear systems using output feedback,” in Proceedings of the 31st IEEE Conference on Decision and Control, 1992, pp. 3423–3428.
  • [17] H. Kimura, “A new approach to the perfect regulation and the bounded peaking in linear multivariable control systems,” IEEE Transactions on Automatic Control, vol. 26, no. 1, pp. 253–270, 1981.
  • [18] S. Kolathaya and A. D. Ames, “Input-to-state safety with control barrier functions,” IEEE Control Systems Letters, vol. 3, no. 1, pp. 108–113, Jan 2019.
  • [19] M. Krstic and M. Bement, “Nonovershooting control of strict-feedback nonlinear systems,” IEEE Transactions on Automatic Control, vol. 51, no. 12, pp. 1938–1943, 2006.
  • [20] W. Li and M. Krstic, “Mean-nonovershooting control of stochastic nonlinear systems,” IEEE Transactions on Automatic Control, 2020.
  • [21] ——, “Stochastic nonlinear prescribed-time stabilization and inverse optimality,” IEEE Transactions on Automatic Control, 2021.
  • [22] T. G. Molnár, A. W. Singletary, G. Orosz, and A. D. Ames, “Safety-critical control of compartmental epidemiological models with measurement delays,” IEEE Control Systems Letters, vol. 5, no. 5, pp. 1537–1542, 2021.
  • [23] Q. Nguyen and K. Sreenath, “Exponential control barrier functions for enforcing high relative-degree safety-critical constraints,” in American Control Conference (ACC), 2016, pp. 322–328.
  • [24] M. Ohnishi, G. Notomista, M. Sugiyama, and M. Egerstedt, “Constraint learning for control tasks with limited duration barrier functions,” Automatica, vol. 127, p. 109504, 2021.
  • [25] S. F. Phillips and D. E. Seborg, “Conditions that guarantee no overshoot for linear systems,” International Journal of Control, vol. 47, no. 4, pp. 1043–1059, 1988.
  • [26] A. Polyakov, D. Efimov, and W. Perruquetti, “Finite-time and fixed-time stabilization: Implicit lyapunov function approach,” Automatica, vol. 51, pp. 332–340, 2015.
  • [27] S. Prajna, A. Jadbabaie, and G. J. Pappas, “A framework for worst-case and stochastic safety verification using barrier certificates,” IEEE Transactions on Automatic Control, vol. 52, no. 8, pp. 1415–1428, 2007.
  • [28] Y. Rahman, M. Jankovic, and M. Santillo, “Driver intent prediction with barrier functions,” in American Control Conference (ACC), 2021, pp. 224–230.
  • [29] M. Santillo and M. Jankovic, “Collision free navigation with interacting, non-communicating obstacles,” in American Control Conference (ACC), 2021, pp. 1637–1643.
  • [30] C. Santoyo, M. Dutreix, and S. Coogan, “A barrier function approach to finite-time stochastic system verification and control,” Automatica, vol. 125, p. 109439, 2021.
  • [31] R. Schmid and L. Ntogramatzidis, “A unified method for the design of nonovershooting linear multivariable state-feedback tracking controllers,” Automatica, vol. 46, no. 2, pp. 312–321, 2010.
  • [32] Y. Song, Y. Wang, J. Holloway, and M. Krstic, “Time-varying feedback for regulation of normal-form nonlinear systems in prescribed finite time,” Automatica, vol. 83, pp. 243–251, 2017.
  • [33] D. Steeves, N. Espitia, M. Krstic, and W. Perruquetti, “Input delay compensation in prescribed-time of boundary-actuated reaction-diffusion pdes,” in American Control Conference (ACC), 2021, pp. 274–279.
  • [34] D. Steeves and M. Krstic, “Prescribed-time stabilization of odes with diffusive actuator dynamics,” IFAC-PapersOnLine, vol. 54, no. 9, pp. 434–439, 2021.
  • [35] D. Steeves, M. Krstic, and R. Vazquez, “Prescribed-time h1h^{1}-stabilization of reaction-diffusion equations by means of output feedback,” in 18th European Control Conference (ECC), 2019, pp. 1932–1937.
  • [36] ——, “Prescribed–time estimation and output regulation of the linearized schrödinger equation by backstepping,” European Journal of Control, 2020.
  • [37] H. Sussmann and P. Kokotovic, “The peaking phenomenon and the global stabilization of nonlinear systems,” IEEE Transactions on Automatic Control, vol. 36, no. 4, pp. 424–440, 1991.
  • [38] P. Wieland and F. Allgöwer, “Constructive safety using control barrier functions,” IFAC Proceedings Volumes, vol. 40, no. 12, pp. 462 – 467, 2007, 7th IFAC Symposium on Nonlinear Control Systems.
  • [39] G. Wu and K. Sreenath, “Safety-critical and constrained geometric control synthesis using control lyapunov and control barrier functions for systems evolving on manifolds,” in American Control Conference (ACC), 2015, pp. 2038–2044.
  • [40] W. Xiao and C. Belta, “Control barrier functions for systems with high relative degree,” in 2019 IEEE 58th Conference on Decision and Control (CDC), 2019, pp. 474–479.
  • [41] X. Xu, P. Tabuada, J. W. Grizzle, and A. D. Ames, “Robustness of control barrier functions for safety critical control.” IFAC-PapersOnLine, vol. 48, no. 27, pp. 54 – 61, 2015.
  • [42] X. Xu, “Constrained control of input-output linearizable systems using control sharing barrier functions,” Automatica, vol. 87, pp. 195–201, 2018.