Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay

arXiv:2601.14089 · eess.SY, cs.SY · Submitted 2026-01-20 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.

Rosa: We're looking at the paper: "Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay".

Dev: Here's the gist of the paper. This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown.

Rosa: The proposed approach achieves finite-time identification of a substantial set of unknown system quantities and exponential convergence of the output state to a reference trajectory while rigorously ensuring safety constraints.

Dev: The dynamics of disturbance d and the reference r are unified by a finite-dimensional exogenous model V˙ (t) = SV (t), where S = diag(Sd, Sr), V (t) = col(Vd, Vr) and nv = nd + nr Data-Driven Parameter Estimation To extract the underlying dynamics of the plant, a data-driven approach leveraging the Koopman operator and Krylov DMD is utilized to extract important dynamic characteristics Θ1 = A, Sd, G without corruption from the external control input Safe Controller Construction under Uncertainty A data-driven safe controller is built by replacing the unknown parameters by their real-time estimates Θ(ˆ t) in the nominal safe control law The safety mechanism designed about (24), (37) relies on the exact value of h(e(D), D) recalling its accessibility in the case of uncertain plant Application Validation The effectiveness of the proposed design is verified through a safe vehicle platooning application The unknown parameters converge to their true values within a finite time tf = 3s The proposed data-driven safe control scheme guarantees that the output of the closed-loop system safely tracks the target trajectory, all states are bounded, and all unknown parameters are identified exactly in finite time The result is that safety is ensured in the sense that if the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞) How the gains come from The selection of the design parameters ki are modified to account for model uncertainty by using the known parameter bounds from Assumptions 1–3 This choice guarantees the initial positivity of all functions hi(zi(D), D) across the entire uncertainty set Where the gains come from The control gains are selected as k1 = 3 and k2 = 1 according to (36), (37), (66), (101)> The initial value of the disturbance is Vd(0) = (1, 0)⊤ Where the gains come from The control gains for vehicles Ei are calculated as Ki = 1/bi(0, ai), G0i = 1/bi(g2 + g1Si − PrS2i), fi = -1/bi((k1 + k2)Z2,i + k1k2Z1 Where the gains come from The observer gains are selected as Lv,0 = 0, Lv = (−0.6, 15)⊤, Lx,0 = 0, Lx = (9, 10)⊤ recalling (90) Where the gains come from The observer gains are selected as Lv,t = (Lv,t ≥ D, Lx,t ≥ D Where the gains come from The selection of the design parameters ki in (36), (37), i = 1, · · ·, n − 1, kn ≥ 0 The selection of the design parameters ki in (36), (37), i = 1, · · ·, n − 1, kn ≥ 0 Where the gains come from

Paper summary: Rosa: So, this paper is talking about a safe control framework for linear systems where you know the basic structure, but most of the important numbers—the plant parameters and external disturbances—are completely unknown.

Dev: Right. It claims they can use data-driven methods to identify all that missing information in finite time and still guarantee safety.

Rosa: That’s because they use the Koopman operator theory, which lets them map the system dynamics from measured data into a linear space, using something called Krylov DMD to extract those system characteristics like A, Sd, and G without getting messed up by the external control input.

Dev: And they aren't just stopping there; they combine that with batch least-squares identification for other unknown parameters in the input channel.

Rosa: Which is smart because it means they can reconstruct the whole system model using only measured data, and then use that to build a full-state safe controller first.

Taro: But I always wonder about what happens when the world misbehaves—the paper mentions how they use control barrier functions and backstepping to develop that initial safe controller.

Dev: That's the starting point, yeah. Before you can estimate everything else, you need a known safe way to handle the system.

Rosa: And then they build an output-feedback controller by identifying the system using only the output data and actuation signals, while simultaneously constructing an observer to estimate those unmeasured plant states.

Taro: So it’s this whole process of identification and estimation happening together in real time?

Dev: Exactly. The main claim is that this approach achieves two things: first, finite-time identification of a substantial set of unknown system quantities, and second, exponential convergence of the output state to a reference trajectory while rigorously ensuring safety constraints.

Rosa: Exponential convergence sounds fast. That’s pretty impressive when you’re dealing with uncertainty in the parameters.

Taro: I'm thinking about the practical application here—the validation part. The paper tested this on a safe vehicle platooning application, and they found that these unknown parameters converge to their true values within a finite time of three seconds, tf equals 3s <ref:2601.14089#pg3>.

Dev: Three seconds is very fast for identification in a real-world setting. That’s the empirical evidence supporting their claim about the identification speed.

Rosa: It shows that the data-driven estimation actually works quickly enough to be useful before the system dynamics drift too far from reality, which is what you want when dealing with uncertainty.

Paper summary: Taro: So, for someone just looking at this, it means we can design systems that adapt their control logic based on what they are currently sensing, rather than relying on a static model that might be wrong.

Dev: And the real world implication is in how the controller gains are chosen. They modify the design parameters by using known parameter bounds from assumptions one through three to make sure the functions h maintain positivity across all uncertainty sets.

Rosa: That’s a technical way of saying they are careful not to pick control settings that would immediately break safety, even when things are wildly uncertain.

Taro: I’m interested in how they handle the disturbance and reference signals, too. They unify the dynamics of the disturbance d and the reference r into a finite-dimensional exogenous model, (t) = SV(t), where S is a diagonal matrix of Sd and Sr, and all unknown quantities are lumped together in that vector.

Dev: That structure helps simplify things because they treat the disturbance and the desired path similarly under this single model, which is crucial for building that safe controller.

Rosa: The paper goes on to explain how the gains themselves are selected based on specific calculations involving k one and k two using those known parameter bounds to ensure positivity for all functions h(z i(D), D) across the entire uncertainty set <ref:2601.14089#pg1>.

Taro: So, the initial selection of these gains is heavily constrained by the known limits of how bad things can get, which makes sense when you’re trying to guarantee safety from the very first step.

Dev: The observer gains are also selected in a specific way, like L v,zero being zero and L v being (-zero point six, fifteen), and the system matrix gain L x being (nine ten).

Rosa: Those numbers look like they were derived from some very specific analysis of the system structure, which is typical for this kind of complex control design.

Taro: They also state how they handle the case where adaptive Control Barrier Functions, or aCBFs, are used as an alternative to more conservative designs that only restrict the state to a small subset of the nominal safe set.

Dev: The paper notes that while these aCBF schemes reduce conservatism by allowing recovery of the original safe set after a finite transient, they still have limitations because if you have too many unknown parameters, this method becomes unsuitable.

Paper summary: Rosa: So, what does this mean for us outside of the lab? It suggests we can deploy control systems in environments where we don't know the exact physics perfectly—like autonomous vehicles navigating unpredictable traffic—because the system can figure out its own dynamics while staying within safe bounds.

Taro: I’m curious about the practical constraints mentioned. The paper flags that this method is limited because it only works well when the number of unknown parameters is limited, which is a significant caveat for very complex, high-dimensional systems.

Dev: So to wrap up this part, the data-driven safe control framework described in "Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay" guarantees that if you start within a safe condition defined in definition one, then safety is guaranteed for all time t from zero onward.

Rosa: It’s about achieving exact identification of parameters in finite time and keeping the output state safely tracking the target trajectory even when things are unknown.

Taro: That's the core result, ensuring bounded states and exact identification of all those unknown parameters in finite time.

Dev: And it really hinges on that unified model (t) = SV(t) that describes both the disturbance and the reference signal dynamics together.

Rosa: It’s a lot of machinery—Koopman, DMD, BaLSI, CBFs—but it boils down to using data to build a safe controller when you don't know everything upfront.

Dev: The title itself points to the core issue: regulating output with input delay in strict-feedback systems where parameters are unknown.

Taro: I think the implication is that future work might focus on extending this framework to handle even more complex, non-linear systems where a finite-dimensional approximation like DMD might struggle.

Rosa: Yeah, it’s about getting robust identification and safety guarantees in environments that are inherently messy and data-rich.

Taro: The paper suggests that for the real world, we need to focus on how the system recovers gracefully after an initial transient when those unknown parameters are being estimated.

Dev: That recovery is tied directly to how well the aCBFs can manage the conservatism imposed by those initial uncertainty bounds.

Rosa: So, it’s not just about getting a number; it’s about having a mechanism that knows how much risk it’s taking at every moment based on what the data tells it.

Dev: Exactly. The convergence to the true values of the parameters in three seconds means we aren't stuck with an inaccurate model for long, which is vital for real-time control loops.

Conclusion: Rosa: So, this paper is about using data to build a safe control system for linear systems that have known structures but where most of the numbers—the plant parameters and external disturbances—are totally unknown.

Dev: Right. It's not just about having a model; it's figuring out the model in real-time while keeping things safe. The title itself, "Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay," tells you exactly what we’re looking at here—input delay, unknown parameters, and a focus on output regulation.

Rosa: It really boils down to taking messy data and turning it into a functional controller that keeps the system tracking the target without breaking any safety rules. The authors are using some specific mathematical tools like the Koopman operator and Krylov DMD for identification.

Dev: I'm interested in how they handle those unknown dynamics; they claim finite-time identification of a lot of stuff, which is fast, but what about when the world gets unpredictable? That’s where my concern lies—the safety case under real-time operation.

Rosa: The core result is that if you start in a safe state defined by definition one, then safety holds for all time from zero onward. It guarantees bounded states and exact identification of those parameters in finite time.

Dev: But it stops working well when the number of unknown parameters gets too big; the paper flags that this method has limitations on how complex the system can be before it breaks down. So, if you're driving a complex vehicle, does this framework actually work for your specific situation?

Zhenxu Zhao, Ji Wang, Weiyao Lan

Xiamen University

eess.SY, cs.SY

Submitted: 2026-01-20

Updated: 2026-10-28

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 79/100

The gist: This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances…

Key concepts

Strict-Feedback Structure
This describes a specific mathematical arrangement of the system's equations where some variables depend on others in a chain, like $x_1$ depending on $x_2$, and so on. This structure is key because it allows for the identification of unknown dynamics using data-driven methods without needing all parameters at once.
Koopman Operator and Krylov DMD
These are data-driven techniques used to discover the underlying dynamics (like system matrices A, Sd, G) from observed input/output data. The Koopman operator maps the system's state evolution into an infinite-dimensional space where linear dynamics can be analyzed using methods like Krylov subspace decomposition (DMD). This helps estimate unknown parameters.
Finite-Time Identification
This refers to the ability of the data-driven approach to accurately determine all unknown system quantities in a finite amount of time. The paper shows that these estimates converge exactly within a specific time $t_f=3s$, meaning the system's true dynamics are fully revealed quickly, which is crucial for building an accurate controller.
Safe Control Mechanism
This is the safety layer built into the control law that guarantees constraints are never violated, even when system parameters are uncertain. The mechanism relies on knowing the exact value of a function $h(e(D), D)$, which is guaranteed to be accessible because of how the uncertainty set is defined, ensuring safety for all time.

Terminology

Summary

This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown<ref:2601. p. 0

Where the paper says it

IEEE TRANSACTIONS AND JOURNALS TEMPLATE 1 Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay Zhenxu Zhao, Ji Wang, Weiyao Lan Abstract— This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown. By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices.

14089#pg2> By leveraging Koopman operator theory, the authors utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices<ref:2601. p. 0
Where the paper says it

IEEE TRANSACTIONS AND JOURNALS TEMPLATE 1 Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay Zhenxu Zhao, Ji Wang, Weiyao Lan Abstract— This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown. By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices.

14089#pg3> Concurrently, the batch least-squares identification (BaLSI) method is employed to identify other unknown parameters in the input channel<ref:2601. p. 0
Where the paper says it

By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices. Concurrently, the batch least-squares identification (BaLSI) method is employed to identify other unknown parameters in the input channel.

14089#pg4> Using control barrier functions (CBFs) and backstepping, they first develop a full-state safe controller<ref:2601. p. 0
Where the paper says it

Concurrently, the batch least-squares identification (BaLSI) method is employed to identify other unknown parameters in the input channel. Using control barrier functions (CBFs) and backstepping, we first develop a full-state safe controller.

14089#pg6> Based on this, they build an output-feedback controller by performing system identification using only the output data and actuation signals as well as constructing an observer to estimate the unmeasured plant states<ref:2601. p. 0
Where the paper says it

Using control barrier functions (CBFs) and backstepping, we first develop a full-state safe controller. Based on this, we build an output-feedback controller by performing system identification using only the output data and actuation signals as well as constructing an observer to estimate the unmeasured plant states.

14089#pg6> The proposed approach achieves: 1) finite-time identification of a substantial set of unknown system quantities, and 2) exponential convergence of the output state (the state furthest from the control input) to a reference trajectory while rigorously ensuring safety constraints<ref:2601. p. 0
Where the paper says it

Based on this, we build an output-feedback controller by performing system identification using only the output data and actuation signals as well as constructing an observer to estimate the unmeasured plant states. The proposed approach achieves: 1) finite-time identification of a substantial set of unknown system quantities, and 2) exponential convergence of the output state (the state furthest from the control input) to a reference trajectory while rigorously ensuring safety constraints.

14089#pg6> The effectiveness of the proposed method is demonstrated through a safe vehicle platooning application<ref:2601. p. 0
Where the paper says it

The proposed approach achieves: 1) finite-time identification of a substantial set of unknown system quantities, and 2) exponential convergence of the output state (the state furthest from the control input) to a reference trajectory while rigorously ensuring safety constraints. The effectiveness of the proposed method is demonstrated through a safe vehicle platooning application.

14089#pg6>.

System Modeling and Uncertainty Definition

The problem considers an uncertain strict-feedback linear system subject to the input delay and disturbances, defined by X˙ (t) = AX(t) + BU(t − D) + Gd(t)<ref:2601.14089#pg4> The plant parameters b, ai,j (1 ≤ i, j ≤ n) in (1) are unknown<ref:2601. p. 0

Where the paper says it

IEEE TRANSACTIONS AND JOURNALS TEMPLATE 1 Data-Driven Safe Output Regulation of Strict-Feedback Linear Systems with Input Delay Zhenxu Zhao, Ji Wang, Weiyao Lan Abstract— This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown. By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices.

14089#pg4> Disturbance d(t) is modeled by a finite-dimensional exogenous model V˙ d(t) = SdVd(t)<ref:2601. p. 2
Where the paper says it

In addition, we assume that (A, B) is controllable and (C, A) is observable. Like [18], [32], the disturbances are supposed to be generated by the following finite-dimensional exogenous model V˙ d(t) = SdVd(t), d(t) = PdVd(t), (4) where Vd(t) = (vd,1, · · · , vd,nd ) ⊤ ∈ R nd , and (Pd, Sd) is observable.

14089#pg4> The dynamics of disturbance d and the reference r are unified by a finite-dimensional exogenous model V˙ (t) = SV (t)<ref:2601. p. 2
Where the paper says it

The target trajectory r(t) ∈ R is considered to be generated by the exact known exogenous model V˙ r(t) = SrVr(t), r(t) = PrVr(t), (5) where Vr(t) = (vr,1, · · · , vr,nr ) ⊤ ∈ R nr , (Pr, Sr) is observable. Thus, the dynamics of disturbance d and the reference r are unified by a finite-dimensional exogenous model V˙ (t) = SV (t), (6) where S = diag(Sd, Sr), V (t) = col(Vd, Vr) and nv = nd + nr.

14089#pg4> The unknown model parameters are defined as Θ = [A, G, S ¯d D, b z]Θ2<ref:2601. p. 6
Where the paper says it

More details can be found in [54]. Lemma 7: The finite-time exact identification of the unknown parameters Θ2 is achieved, that is, there exists a finite time tf defined by tf = min{ti : ∃t ∈ [0, ti), u(0, t) ̸= 0}, (61) such that Θˆ 2(tf ) ≡ Θ2, ∀t ≥ tf .

14089#pg4> Assumptions regarding the bounds of unknown parameters in Θ2 are required for the control design<ref:2601. p. 2
Where the paper says it

(13) It means that all plant parameters in the considered system are unknown except for Sr that is to generate the target trajectory and thus is known. The following two assumptions about the bounds of unknown parameters in Θ2, are required in the control design, which are not restrictive because the bounds are arbitrary.

14089#pg4>

Identification Methodology

The authors employ a two-pronged data-driven identification strategy to estimate the unknown dynamics<ref:2601.14089#pg6> 1) They use Koopman operator theory and Krylov DMD to extract system dynamics from data, exploiting the link between DMD and Krylov subspace methods<ref:2601. p. 1

Where the paper says it

Dynamic Mode Decomposition (DMD) [43], [48], provides a practical finite-dimensional approximation of the Koopman operator directly from data [38], whose standard form is noise-sensitive and requires fullstate data. By exploiting the intrinsic link between DMD and Krylov subspace methods [24], Krylov DMD utilizes Hankel matrices to construct observable bases, enabling more robust extraction of Koopman modes and eigenvalues.

14089#pg6> 2) They employ a batch least-squares identifier (BaLSI) to identify other unknown parameters in the input channel<ref:2601. p. 0
Where the paper says it

By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices. Concurrently, the batch least-squares identification (BaLSI) method is employed to identify other unknown parameters in the input channel.

14089#pg4> For the output-feedback case, they reconstruct system and disturbance dynamics directly from output measurements using Hankel matrix factorization into observability and controllability matrices<ref:2601. p. 7
Where the paper says it

CONTROL DESIGN USING OUTPUT DATA In contrast to the preceding full-state feedback design, this section addresses a more practical situation in which only the output state is measurable. We develop an output-feedback safe controller by reconstructing the system and disturbance dynamics directly from output measurements.

14089#pg6> The exact identification of the unknown parameters Θˆ 1(D) = [A, Sd, G]¯ is achieved at t = D through the reconstruction methods<ref:2601. p. 6
Where the paper says it

More details can be found in [54]. Lemma 7: The finite-time exact identification of the unknown parameters Θ2 is achieved, that is, there exists a finite time tf defined by tf = min{ti : ∃t ∈ [0, ti), u(0, t) ̸= 0}, (61) such that Θˆ 2(tf ) ≡ Θ2, ∀t ≥ tf .

14089#pg6>

Safe Controller Construction under Uncertainty

The nominal safe controller design proceeds via a three-step backstepping transformation assuming full model knowledge<ref:2601.14089#pg6> The final controller is constructed by replacing the unknown parameters with their real-time estimates Θ(ˆ t) = [Θˆ 1(t), Θˆ 2(t)] in the nominal safe control law<ref:2601. p. 6

Where the paper says it

III-B, III-C. Replacing the unknown parameters by their real-time estimates Θ( ˆ t) = (Θˆ 1(t), Θˆ 2(t)) in the nominal safe control law (34), we have Ud(t) := U(χ(t); Θ( ˆ t)), (62) where Θ( ˆ t) is piecewise-constant vector recalling the designs in Secs.

14089#pg6> To handle identification errors, they compute lower and upper bounds h and h over the parameter uncertainty sets<ref:2601. p. 6
Where the paper says it

Especially, the safety mechanism designed about (24), (37) relies on the exact value of h(e(D), D) recalling (25), which is inaccessible in the case of the uncertain plant. We instead compute its lower and upper bounds, h and h, over the parameter uncertainty sets Θ¯ 1, Θ¯ 2 defined in Assumptions 3 and (58), as h = maxθ1∈Θ¯ 1,θ2∈Θ¯ 2 P0(χ(0); θ1, θ2), h = min θ1∈Θ¯ 1,θ2∈Θ¯ 2 P0(χ(0); θ1, θ2).

14089#pg6> A modified function ς (24) is introduced to drive the state that is unsafe initially to the safe region by a prescribed time D + t¯<ref:2601. p. 6
Where the paper says it

The role of (65) is to drive the state that is unsafe initially to the safe region by a prescribed time D + t¯. Also, the selection of the design parameter ki is modified to account for model uncertainty by using the known parameter bounds from Assumptions 1–3: ki ≥ max θ1∈Θ¯ 1,θ2∈Θ¯ 2 {0, ˆki(χ(0); θ1, θ2}, i = 1, · · · , n − 1 (66) and kn ≥ 0, where ˆki is obtained from substituting the variable θ1, θ2 for the unknown Θ in (37), which are specified by the bounds in Assumptions 3 and (58), respectively.

14089#pg6> The selection of gain parameters ki is modified to account for model uncertainty by using known parameter bounds from Assumptions 1–3<ref:2601. p. 6
Where the paper says it

The role of (65) is to drive the state that is unsafe initially to the safe region by a prescribed time D + t¯. Also, the selection of the design parameter ki is modified to account for model uncertainty by using the known parameter bounds from Assumptions 1–3: ki ≥ max θ1∈Θ¯ 1,θ2∈Θ¯ 2 {0, ˆki(χ(0); θ1, θ2}, i = 1, · · · , n − 1 (66) and kn ≥ 0, where ˆki is obtained from substituting the variable θ1, θ2 for the unknown Θ in (37), which are specified by the bounds in Assumptions 3 and (58), respectively.

14089#pg6>

Application and Results

The effectiveness of the design is verified through a safe vehicle platooning application<ref:2601.14089#pg6> The simulation results show that the distance between vehicles E1 and E0 converges to the desired distance (so1 = 0.5 m in Case 1) and all unknown parameters converge to their true values within the finite time tf = 3s<ref:2601. p. 9

Where the paper says it

The system matrices used in the observer are the identified values of A and Sd, denoted as Aˆ(t) and Sˆ d(t). Specifically, as established in Lemma 10, these estimates are piecewise constant and converge in finite time: Aˆ(t) = ( A0, 0 ≤ t < D A, t ≥ D , Sˆ d(t) = ( Sd0 , 0 ≤ t < D Sd, t ≥ D , and Dˆ(t) = ( D0, 0 ≤ t < tf D, t ≥ tf , where A, Sd are given in Lemma 10, D = Dˆ(tf ) is given in Lemma 11, and A0, Sd0 , D0 are arbitrary initial estimates satisfying Assumptions 1, 3.

p. 9
Where the paper says it

The system matrices used in the observer are the identified values of A and Sd, denoted as Aˆ(t) and Sˆ d(t). Specifically, as established in Lemma 10, these estimates are piecewise constant and converge in finite time: Aˆ(t) = ( A0, 0 ≤ t < D A, t ≥ D , Sˆ d(t) = ( Sd0 , 0 ≤ t < D Sd, t ≥ D , and Dˆ(t) = ( D0, 0 ≤ t < tf D, t ≥ tf , where A, Sd are given in Lemma 10, D = Dˆ(tf ) is given in Lemma 11, and A0, Sd0 , D0 are arbitrary initial estimates satisfying Assumptions 1, 3.

14089#pg6> The safety is guaranteed in the sense that if the initial safe condition is met, then safety is guaranteed for t ∈ [0,∞)<ref:2601. p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

14089#pg6> If the initial safe condition is not met but h(e(D), D) > 0, then safety is guaranteed for t ≥ D<ref:2601. p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

14089#pg6> If the initial safe condition is not met and h(e(D), D) ≤ 0, safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users<ref:2601. p. 7
Where the paper says it

b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D. c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users.

p. 7
Where the paper says it

b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D. c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users.

14089#pg6>.

Conclusion

The paper successfully develops a data-driven safe control scheme that guarantees output tracking, state boundedness, and exact identification of unknown parameters in finite time<ref:2601.14089#pg6> The proposed control design guarantees that the output of the closed-loop system safely tracks the target trajectory, all states are bounded, and all unknown parameters are identified exactly in finite time<ref:2601. p. 7

Where the paper says it

Theorem 1: For initial data X(0) ∈ R n, V (0) ∈ R nv , and the safety constraint h(e, t) satisfying Assumptions 4, 7, choosing the design parameters k1, · · · , kn satisfying (66), the closed-loop system consisting of the disturbed linear plant (1), (2) with unknown Θ (13), and the data-driven safe controller (67), has the following properties 1) There exists a unique solution X(t) ∈ R n, V (t) ∈ R nv , u[t] ∈ L 2 (0, 1) to the system (9)–(12) with control input (67). 2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61).

14089#pg6>.

Appendix

The appendix provides detailed calculations for the PDE transformation (30) and its inverse transformation<ref:2601.14089#pg6> The proof of Lemma 1 establishes that hi (zi(D), D) ≥ 0 for all i = 1, · · ·, n<ref:2601. p. 7

Where the paper says it

Together with the initial condition, this establishes system safety, h(e(t), t) ≥ 0, for all time t ∈ [0, ∞). b) Even though the safety is not guaranteed during the period [0, D) in this case, considering h(e(D), D) ≥ 0 and through the same process with the proof in a), we have h(e(t), t) ≥ 0 holds on t ∈ [D, ∞).

14089#pg6> The proof of Lemma 2 concludes that e(t) is exponentially convergent to zero from the exponential convergence to zero of h1(z1(t), t)<ref:2601. p. 7
Where the paper says it

Together with that the matrix Ah in (28) is Hurwitz, |H(t)| is thus exponentially convergent to zero. Then, follow the same process in proving Lemma 2 in Appendix C, this property is obtained.

14089#pg6> The proof of Lemma 3 establishes that rank Hn˜(X˜) = ˜n<ref:2601. p. 8
Where the paper says it

(C¯A˜n˜−1 d ) ⊤ ⊤ ∈ R n˜×n˜ . (75) Unlike [20], which requires the output dimension to be no less than the disturbance dimension, the following lemma establishes a full-rank condition for Hn˜(Y ) using only lowdimensional output data.

14089#pg6> The proof of Lemma 5 shows that the Koopman eigenvalues are computed from the measurement data using DMD<ref:2601. p. 5
Where the paper says it

Above condition ensures that updates commence only after the DMD identification of an,i completes at t = D, as these parameters are required to compute (57) (specifically fb(t)). Each new estimate at ti+1 is computed using a batch of historical plant data collected over the time window [µi+1, ti+1].

14089#pg6> The proof of Lemma 6 establishes that the estimated system parameters Θˆ 1(D) = [A, Sd, G]¯ are then obtained by partitioning the reconstructed matrix A˜ according to its block structure defined in (38)<ref:2601. p. 6
Where the paper says it

Replacing the unknown parameters by their real-time estimates Θ( ˆ t) = (Θˆ 1(t), Θˆ 2(t)) in the nominal safe control law (34), we have Ud(t) := U(χ(t); Θ( ˆ t)), (62) where Θ( ˆ t) is piecewise-constant vector recalling the designs in Secs. III-B, III-C: Θ( ˆ t) =    (Θˆ 1(0), Θˆ 2(0)), t ∈ [0, D) (Θˆ 1(D), Θˆ 2(0)), t ∈ [D, tf ) (Θˆ 1(D), Θˆ 2(tf )), t ∈ [tf , ∞) (63) where Θˆ 1(0), Θˆ 2(0) are the initial estimates, and Θˆ 1(D) = {A, Sd, G}¯ , which are obtained by (53), is the exact identification of Θ1 according to Lemma 6, and Θˆ 2(tf ) is the exact identification of Θ2 according to Lemma 7.

14089#pg6> The proof of Lemma 8 confirms that the Hankel matrix Hn˜(Y) satisfies full rank, i. p. 8
Where the paper says it

(75) Unlike [20], which requires the output dimension to be no less than the disturbance dimension, the following lemma establishes a full-rank condition for Hn˜(Y ) using only lowdimensional output data. Lemma 8: If rank A − λI GP ˜ d C 0 = n + 1, ∀λ˜ ∈ eig(Sd), (76) the Hankel matrix Hn˜(Y ) satisfies rank Hn˜(Y ) = ˜n (77) for almost all Y (0) ∈ R.

e., rank(Qo) = ˜n<ref:2601. p. 0
Where the paper says it

However, the above approaches typically assume full knowledge of the system model, whereas real-world systems often contain substantial uncertainties. Robust CBF methods [31], [37] address such uncertainties by enforcing safety under arXiv:2601.

14089#pg6> The proof of Lemma 10 shows that the Koopman eigenvalues are solved as λ˜i = ln λˆi Td for i = 1,. p. 5
Where the paper says it

Proof: Its proof can be found in [20, Lemma 3]. The next step is crucial, which derives the Koopman modes, eigenvalues, and eigenfunctions from the companion matrix F.

.., n˜<ref:2601. p. 0
Where the paper says it

However, the above approaches typically assume full knowledge of the system model, whereas real-world systems often contain substantial uncertainties. Robust CBF methods [31], [37] address such uncertainties by enforcing safety under arXiv:2601.

14089#pg6> The proof of Lemma 11 confirms that the finite-time exact identification of the unknown parameters D is achieved<ref:2601. p. 6
Where the paper says it

Lemma 7: The finite-time exact identification of the unknown parameters Θ2 is achieved, that is, there exists a finite time tf defined by tf = min{ti : ∃t ∈ [0, ti), u(0, t) ̸= 0}, (61) such that Θˆ 2(tf ) ≡ Θ2, ∀t ≥ tf . Proof: Its proof is very similar to the proofs of Lemma 4 in [54] and Sec.

14089#pg6> The proof of Theorem 2 concludes that the parameter identification Θ(ˆ t) achieves the true value Θ in finite time tf defined in (84)<ref:2601. p. 7
Where the paper says it

The proof of this property is complete. 2) According to Lemmas 6, 7, we directly obtain the property 2) that the parameter identification Θ( ˆ t) achieves the true value Θ in finite time tf .

14089#pg6> The proof of property 3) about safety by examining each of the three cases is complete<ref:2601. p. 7
Where the paper says it

, h1(t) ≥ 0 is ensured for all t ≥ D. Next, we prove property 3) about safety by examining each of the three cases: a) Because the initial safe condition in Definition 1 is met, (65) directly imply ς(t) ≡ 0.

14089#pg6> The proof of property 4) is complete<ref:2601. p. 7
Where the paper says it

4), we have that u[t] ∈ L 2 (0, 1) is then obtained from w[t] ∈ L 2 (0, 1). The proof of this property is complete.

14089#pg6>.

References

The references listed include works on control barrier functions, Koopman operator theory, and data-driven modeling<ref:2601.14089#pg6> The references also cover delay compensation and adaptive control for uncertain systems<ref:2601. p. 0

Where the paper says it

Recently, a new delay-adaptive design [52] was proposed for coupled PDEs, leveraging a batch least-squares identifier (BaLSI) that was originally introduced in [33], [35] for nonlinear ODEs, and extended to PDEs in [36], [53], achieving finite-time exact identification of the uncertain delay and exponential regulation of the plant. Safety-Critical Control in Complex Environments Safety is paramount in modern autonomous systems, where one must rigorously guarantee that system trajectories remain within a prescribed safe set.

14089#pg6> The references also cover output regulation for hyperbolic PDEs coupled with nonlinear ODEs<ref:2601. p. 0
Where the paper says it

For uncertain delays, Lyapunov-based designs have been employed to develop delay-adaptive controllers in [62]–[65]. Recently, a new delay-adaptive design [52] was proposed for coupled PDEs, leveraging a batch least-squares identifier (BaLSI) that was originally introduced in [33], [35] for nonlinear ODEs, and extended to PDEs in [36], [53], achieving finite-time exact identification of the uncertain delay and exponential regulation of the plant.

14089#pg6>.

Future Work

Future research will focus on extending the current results to systems with more stochastic uncertainties, such as stochastic noise and disturbance, and exploring the experimental validation of the proposed control scheme on practical systems<ref:2601.14089#pg6> The references also cover robust data-driven control with safety constraints and fault detection<ref:2601. p. 1

Where the paper says it

Main contributions In this paper, we develop a data-driven CBF-based safe control scheme for linear strict-feedback systems with significant model uncertainties, unknown external disturbances, and unknown input delay. The main contributions of this work are: 1) Compared with data-driven output regulation results [20], [61], we address a more challenging case where the plant is subject to unknown input delay and safety constraints.

14089#pg6>.

Controller Design Details

The controller design details the construction of the safe output regulator by combining the nominal design in Sec. III-A and the data-driven identification process in Secs. p. 6

Where the paper says it

Data-Driven Safe Control In this section, we build a data-driven safe controller by combining the nominal design in Sec. III-A and the datadriven identification process in Secs.

III-B, III-C<ref:2601. p. 1
Where the paper says it

Organization The problem is formulated in Sec. III, we present the identification of all unknown parameters and the datadriven safe control design under full state access.

14089#pg6> The final controller Ua(t) is constructed to operate under both parameter and state uncertainty<ref:2601. p. 6
Where the paper says it

The role of (65) is to drive the state that is unsafe initially to the safe region by a prescribed time D + t¯. Also, the selection of the design parameter ki is modified to account for model uncertainty by using the known parameter bounds from Assumptions 1–3: ki ≥ max θ1∈Θ¯ 1,θ2∈Θ¯ 2 {0, ˆki(χ(0); θ1, θ2}, i = 1, · · · , n − 1 (66) and kn ≥ 0, where ˆki is obtained from substituting the variable θ1, θ2 for the unknown Θ in (37), which are specified by the bounds in Assumptions 3 and (58), respectively.

14089#pg6> The controller switching time tf is the triggering time when the exact parameter identification is achieved, determined by (61)<ref:2601. p. 6
Where the paper says it

t ≥ tf (67) where ϑ0 := sgn(ϑ(e(0), 0)). (68) The switching time tf is the triggering time when the exact parameter identification is achieved, determined by (61).

14089#pg6> The selection of the design parameters ki in (101) defines a stricter subset of the conditions in (36), which strictly guarantees the positivity of the initial barrier function values, i. p. 7
Where the paper says it

Recalling (66), the positivity of the initial barrier function value, i. , hi (zi (D), D), is guaranteed by design parameters ki which belong to the subset of (36).

e., hi (zi(D), D)<ref:2601. p. 0
Where the paper says it

However, the above approaches typically assume full knowledge of the system model, whereas real-world systems often contain substantial uncertainties. Robust CBF methods [31], [37] address such uncertainties by enforcing safety under arXiv:2601.

14089#pg6> This choice guarantees that all barrier functions hi are nonnegative during the time period t ∈ [D,∞) and i = 1, · · ·, n<ref:2601. p. 7
Where the paper says it

, hi (zi (D), D), is guaranteed by design parameters ki which belong to the subset of (36). Therefore, from the structure of H(t) in (31), we know that all barrier functions hi are nonnegative during the time period t ∈ [D,∞), i.

14089#pg6> The controller gains Ki are calculated as Ki = 1/bi (0, ai), G0i = 1/bi (g2 + g1Si − PrS2i), fi = -1/bi ((k1 + k2)Z2,i + k1k2Z1<ref:2601.14089#pg6>

Application in Vehicle Platooning

The application in safe vehicle platooning validates the theoretical results<ref:2601.14089#pg6> The simulation results show that the distance between vehicles E1 and E0 converges to the desired distance (so1 = 0.5 m in Case 1) and all unknown parameters converge to their true values within the finite time tf = 3s<ref:2601.14089#pg6> The safety is guaranteed in the sense that if the initial safe condition is met, then safety is guaranteed for t ∈ [0,∞)<ref:2601.14089#pg6> If the initial safe condition is not met but h(e(D), D) > 0, then safety is guaranteed for t ≥ D<ref:2601.14089#pg6> If the initial safe condition is not met and h(e(D), D) ≤ 0, safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users<ref:2601.14089#pg6>.

Observer Design Details

An extended state observer is designed to estimate the unmeasured states and disturbances of the system<ref:2601.14089#pg6> The observer gains Lv(t) and Lx(t) are piecewise constant which are defined as Lv(t) = (Lv,0, 0 ≤ t The observer error system is well-posed in the sense that X˜(0) ∈ R n, V˜ d(0) ∈ R nd for t ∈ [0, ∞)<ref:2601. p. 9

Where the paper says it

Defining the observer error norm Ωe = |X˜| + |V˜ d|, (91) we establish the next lemma. Lemma 13: For initial data Xˆ(0) ∈ R n, Vˆ d(0) ∈ R nd , the observer (85)–(87) where the observer gains function Lv(t), Lx(t) are defined by (90), and satisfies that L(t) ≡ L, t ≥ D is Hurwitz, the observer error system (89) is well-posed in the sense of X˜(0) ∈ R n, V˜ d(0) ∈ R nd ,for t ∈ [0, ∞).

14089#pg6> The exponential convergence to zero of the observer errors (89) is achieved in the sense that omegae ≤ √2Γe,1(t) for t ∈ [0, D) and omegae ≤ √2Γe,2(t) for D ≤ t

Final Results Summary

The closed-loop system consisting of the disturbed linear plant (1), (2) with unknown Θ (71), the observer (85)–(87), and the controller (102) has the following properties: 1) There exists a unique solution X(t) ∈ R n, V(t) ∈ R nv, u[t] ∈ L2 (0, 1)<ref:2601.14089#pg6> 2) The identification Θ(ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (84)<ref:2601. p. 7

Where the paper says it

Theorem 1: For initial data X(0) ∈ R n, V (0) ∈ R nv , and the safety constraint h(e, t) satisfying Assumptions 4, 7, choosing the design parameters k1, · · · , kn satisfying (66), the closed-loop system consisting of the disturbed linear plant (1), (2) with unknown Θ (13), and the data-driven safe controller (67), has the following properties 1) There exists a unique solution X(t) ∈ R n, V (t) ∈ R nv , u[t] ∈ L 2 (0, 1) to the system (9)–(12) with control input (67). 2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61).

p. 7
Where the paper says it

Theorem 1: For initial data X(0) ∈ R n, V (0) ∈ R nv , and the safety constraint h(e, t) satisfying Assumptions 4, 7, choosing the design parameters k1, · · · , kn satisfying (66), the closed-loop system consisting of the disturbed linear plant (1), (2) with unknown Θ (13), and the data-driven safe controller (67), has the following properties 1) There exists a unique solution X(t) ∈ R n, V (t) ∈ R nv , u[t] ∈ L 2 (0, 1) to the system (9)–(12) with control input (67). 2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61).

14089#pg6> 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded<ref:2601. p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

14089#pg6> 4) Safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞)<ref:2601. p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

14089#pg6> b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D<ref:2601. p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

p. 7
Where the paper says it

2) The identification Θ( ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (61). 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded; 4) The safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞).

14089#pg6> c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users<ref:2601. p. 7
Where the paper says it

b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D. c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users.

p. 7
Where the paper says it

b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D. c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users.

14089#pg6>

The closed-loop system consisting of the disturbed linear plant (1), (2) with unknown Θ (71), the observer (85)–(87), and the controller (102) has the following properties: 1) There exists a unique solution X(t) ∈ R n, V(t) ∈ R nv, u[t] ∈ L2 (0, 1)<ref:2601.14089#pg6> 2) The identification Θ(ˆ t) of unknown parameters Θ is bounded and reaches the true value in finite time tf that is defined in (84)<ref:2601.14089#pg6> 3) Tracking error state e(t) (14) is convergent to zero and all states are bounded<ref:2601.14089#pg6> 4) Safety is ensured in the sense that a) If the initial safe condition in Definition 1 is met, then safety is guaranteed for t ∈ [0,∞)<ref:2601.14089#pg6> b) If the initial safe condition in Definition 1 is not met, but h(e(D), D) > 0, then safety is guaranteed for t ≥ D<ref:2601.14089#pg6> c) If the initial safe condition in Definition 1 is not met, and h(e(D), D) ≤ 0, the safety is guaranteed for t ≥ D + t¯ where t >¯ 0 can be arbitrarily assigned by users<ref:2601.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Data driven safe control for linear strict-feedback systems with unknown plant parameters, external disturbances, and input delay. This system can safely track a reference trajectory while ensuring all states remain within a prescribed safe set C.

  2. Output feedback control using only measurable output signals for systems where the disturbance and unmeasured states are unknown. This allows for real-time state estimation and tracking in complex environments like vehicle platooning, as demonstrated by the application in Section V.

  3. Identification of all unknown plant parameters, including system matrices A, Sd, Gbar and input delay D, in finite time tf. This exact identification is achieved using a combination of Koopman operator theory via Krylov DMD and batch least-squares identification (BaLSI).

  4. Robust safety guarantees against parameter uncertainty by computing lower and upper bounds for the barrier function h(eD, D) and selecting control gains ki based on these bounds. This ensures that the safety constraint is satisfied even when most plant parameters are unknown.

  5. Adaptive control laws that switch between nominal and data-driven safe controllers based on the identification progress. The controller switches from a conservative design to an exact identification-based design at time tf, reducing conservatism after this point while maintaining safety guarantees for all time t greater than D plus t bar.

Abstract

This paper develops a data-driven safe control framework for linear systems possessing a known strict-feedback structure, but with most plant parameters, external disturbances, and input delay being unknown. By leveraging Koopman operator theory, we utilize Krylov dynamic mode decomposition (DMD) to extract the system dynamics from measured data, enabling the reconstruction of the system and disturbance matrices. Concurrently, the batch least-squares identification (BaLSI) method is employed to identify other unknown parameters in the input channel. Using control barrier functions (CBFs) and backstepping, we first develop a full-state safe controller. Based on this, we build an output-feedback controller by performing system identification using only the output data and actuation signals as well as constructing an observer to estimate the unmeasured plant states. The proposed approach achieves: 1) finite-time identification of a substantial set of unknown system quantities, and 2) exponential convergence of the output state (the state furthest from the control input) to a reference trajectory while rigorously ensuring safety constraints. The effectiveness of the proposed method is demonstrated through a safe vehicle platooning application.

Related papers