Skip to Content
EngEng
  • Article
  • Open Access

13 October 2026

22 Pages

Offline-Certified Robust Block Backstepping for Perturbed Underactuated Mechanical Systems

and
1
Electrical Engineering Department, National Institute of Technology Rourkela, Rourkela 769008, India
2
College of Science and Engineering, University of Houston–Clear Lake, Houston, TX 77058, USA
*
Author to whom correspondence should be addressed.
This article belongs to the Section Electrical and Electronic Engineering

Abstract

This paper develops certifiable enhancements to a block-backstepping controller for n-DOF underactuated mechanical systems in the Spong normal form. Two offline-computable tests, each reducible to a finite algebraic computation over a prescribed compact domain, are established: a minimum singular-value margin certifying uniform invertibility of the decoupling matrix, and a Jacobian Hurwitz condition certifying local exponential stability of the zero dynamics—the latter derived via an implicit zero-manifold parametrisation. Robustness overlays are introduced, comprising a bi-power term on the velocity-error channel and a matched-disturbance observer. Together, they supply an explicit observer transient budget and a practical entrance bound t o ( ε ) + T ent for ∥ z ˙ 1 ∥ 2 . No finite-time convergence of the complete closed-loop state is claimed. The resulting workflow permits offline tuning and verification prior to deployment. A simulation on a high-fidelity cart–pendulum model is consistent with those bounds; it is not a substitute for the offline certificates.

1. Introduction and Problem Formulation

Underactuated mechanical systems arise across a broad range of engineering platforms, including cable-suspended aerial manipulators, variable-stiffness series-elastic robots, ship fin stabilisers, and spacecraft with reaction-wheel attitude control—anywhere the number of independent actuators is fewer than the degrees of freedom to be regulated [1,2,3,4,5]. The breadth of this system class has been systematically catalogued in several survey treatments [6,7,8]. Although partial feedback linearisation emerged as a standard approach in Spong’s framework [2], the inherent actuation deficit impedes system representation in the standard normal form [9,10,11]. Consequently, this precludes the straightforward application of integral backstepping; however, appropriate coordinate transformations can decompose the dynamics into a cascaded structure [12,13], thereby enabling the use of block backstepping [14]. Block backstepping for underactuated systems [15,16] proceeds by constructing a diffeomorphism that decomposes the closed-loop into a cascade and a zero-dynamics subsystem, then stabilising each independently. This structural decomposition provides a constructive, Lyapunov-based framework [17,18] that systematically circumvents the restrictive matching conditions of standard feedback linearisation [19]. An alternative means of avoiding the recursive differentiation intrinsic to standard backstepping is afforded by command-filtered variants [20,21], subsequently extended to adaptive and disturbance-attenuating formulations [22,23,24]; these approaches, however, address analytic tractability rather than the structural actuation deficit that motivates the cascaded block-backstepping decomposition adopted herein. Data-driven alternatives have likewise been investigated for this problem class [25,26], typically at the expense of the a priori stability certificates that the present Lyapunov-based construction is designed to retain.
The nominal block backstepping architecture [15] forms the baseline for an n-DOF underactuated system with n 2 actuated degrees of freedom ( n 2 < n ). Defining the column concatenation operator col ( v 1 , … , v k ) v 1 ⊤ … v k ⊤ ⊤ , the configuration is partitioned into unactuated degrees of freedom q 1 ∈ R n 1 and actuated degrees of freedom q 2 ∈ R n 2 , with n 1 + n 2 = n . Whilst velocities are denoted p i : = q ˙ i , the full state vector is defined as X : = col ( q 1 , p 1 , q 2 , p 2 ) ∈ R 2 n . Following Spong’s partial feedback linearisation ([9], Equation (4)), the plant dynamics are given by
q ˙ 1 = p 1 , q ˙ 2 = p 2 , p ˙ 1 = f ( q , p ) + g ( q ) u + d ( t ) , p ˙ 2 = u + d ( t ) ,
where d ( t ) : R ≥ 0 → R n 2 denotes a bounded disturbance. Define Ω q ⊂ R n as the compact set of mechanically permissible configurations, and let p ¯ > 0 be a strict velocity bound derived from physical actuation limits. The compact state-space operating domain is defined as
Ω X X ∈ R 2 n ∣ q = col ( q 1 , q 2 ) ∈ Ω q , ∥ p ∥ ∞ ≤ p ¯ ,
and is chosen so that 0 ∈ int Ω X . To ensure that the nominal control law is well-defined and continuous on Ω X , the minimal construction regularity f ∈ C 1 ( Ω X , R n 1 ) and g ∈ C 2 ( Ω q , R n 1 × n 2 ) is imposed [27].
Introducing a constant matrix K ∈ R n 2 × n 1 , the first error coordinate is defined as
z 1 : = q 2 − K q 1 + p 1 − g ( q ) p 2
with the integral state χ 1 : = ∫ 0 t z 1 ( τ ) d τ , which is augmented to eliminate the steady-state offset in z 1 . Denoting the time derivative g ˙ ( q , p ) : = ∑ i = 1 n ∂ g ∂ q i p i , the virtual control [15] for the unperturbed plant (i.e., d ( t ) ≡ 0 ; henceforth, the unperturbed plant is referred to as the nominal plant) is formulated as
α 1 ( X , χ 1 ) : = − c 1 z 1 − λ χ 1 + K p 1 + f ( q , p ) − g ˙ ( q , p ) p 2
for constants c 1 , λ > 0 , which yields the second error coordinate z 2 : = p 2 − α 1 ( X , χ 1 ) . Consequently, the z 1 -channel dynamics become
z ˙ 1 = − c 1 z 1 − λ χ 1 + z 2 .
Differentiating z 2 along the nominal trajectories yields
z ˙ 2 = c 1 z 2 − ( c 1 2 − λ ) z 1 − λ c 1 χ 1 + ϕ ( X ) + ψ ( X ) u .
Omitting the detailed block-strict feedback derivation ([16], Chapter 3), the resulting nominal control inherently depends on the decoupling matrix ψ : R 2 n → R n 2 × n 2 and the lumped nonlinearity ϕ : R 2 n → R n 2 . Define the matrices g ¨ o : = ( q , p ) ∑ i , j = 1 n ∂ 2 g ∂ q j ∂ q i p j p i ∈ R n 1 × n 2 , ∇ 1 ∂ ( g p 2 ) ∂ q 1 ∈ R n 1 × n 1 and ∇ 2 ∂ ( g p 2 ) ∂ q 2 ∈ R n 1 × n 2 . The definitions of ψ ( X ) and ϕ ( X ) are as follows:
ψ ( X ) : = I − K g + ( ∂ p 1 f ) g + ∂ p 2 f − g ˙ − ∇ 1 g − ∇ 2 , ϕ ( X ) : = − K f + ( ∂ q 1 f ) p 1 + ( ∂ q 2 f ) p 2 + ( ∂ p 1 f ) f − g ¨ o p 2 − ∇ 1 f .
In the above description, ∂ v ( · ) denotes the Jacobian matrix with respect to a generic vector v. The aforementioned standing regularity hypotheses ensure that ϕ and ψ are well-defined and continuous on Ω X .
Enforcing the exponentially stable closed-loop cascade
z ˙ 2 = − z 1 − c 2 z 2 ,
with c 2 > 0 , yields the backstepping law for the nominal plant (i.e., (2) with d ( t ) ≡ 0 ):
u bb : = − ψ ( X ) − 1 C 1 z 1 + C 2 z 2 − λ c 1 χ 1 + ϕ ( X )
where C 1 : = 1 − c 1 2 + λ , C 2 : = c 1 + c 2 .
Under the structural assumptions established in [15], this law exponentially stabilises the nominal cascade in ( z 1 , z 2 , χ 1 ) . However, it lacks a priori certification guaranteeing the uniform invertibility of ψ ( X ) over a prescribed compact operating set, leaves the internal zero dynamics unverified, and fails to quantify robustness against persistent matched disturbances.
Building upon this framework, this work provides three key contributions that resolve the open issues identified previously:
  • A singularity-margin certificate for the invertibility of ψ ( X ) on Ω X , computed offline with an explicit ∥ ψ ( X ) − 1 ∥ 2 bound [28,29,30].
  • An a priori Hurwitz condition on the zero-manifold Jacobian, derived via the implicit function theorem to certify local exponential stability [31,32].
  • Composite robustness overlays comprising an Extended State Observer (ESO) [33,34,35,36,37] that yields the ultimate bound lim sup t → ∞ ∥ d ˜ ( t ) ∥ 2 ≤ 2 d ¯ 1 / ω o and a complete transient budget E sup , and a bi-power term [38] that enforces the practical entrance time t o ( ε ) + T ent for ∥ z ˙ 1 ∥ 2 . No finite-time convergence of the complete state is asserted.

2. Offline Certificates

This section separates analytical sufficient conditions from their computational verification. In particular, the nonsingularity of the decoupling matrix and stability of the zero dynamics are properties to be tested, rather than properties imposed in the operating-domain assumptions. A successful verification supplies a certificate for the specified model and domain; an inconclusive computation does not establish either stability or instability.

2.1. Operating Domain and Transformation Time Scale

Assumption 1 (Domain and regularity).
The compact operating domain Ω X contains the origin in its interior. The functions f and g are defined on an open neighbourhood of the operating domain, with f ∈ C 1 and g ∈ C 2 . In a neighbourhood of the equilibrium, f ∈ C 2 and g ∈ C 3 . The nominal plant has an equilibrium at the origin, so that f ( 0 , 0 ) = 0 . No nonsingularity assumption on ψ is included here.
For the numerical implementation, introduce a time scale T b > 0 and use
z 1 = q 2 − K q 1 + T b p 1 − T b g ( q ) p 2 ,
χ ˙ 1 = z 1 ,
s 0 ( X ) = p 1 + T b f ( q , p ) − T b g ˙ ( q , p ) p 2 ,
α 1 = − c 1 z 1 − λ χ 1 + K s 0 ( X ) ,
z 2 = p 2 − α 1 .
The transformation in Section 1 is recovered by setting T b = 1 . All occurrences of z 1 , z 2 , α 1 , ϕ and ψ below refer to the same selected value of T b .
The matched-disturbance structure in (1) gives the exact cancellation
z ˙ 1 = p 2 − K s 0 ( X ) = − c 1 z 1 − λ χ 1 + z 2 .
Using the derivative notation introduced in Section 1, define
A ( X ) = f + T b ( ∂ q 1 f ) p 1 + ( ∂ q 2 f ) p 2 + ( ∂ p 1 f ) f − g ¨ o p 2 − ∇ 1 f ,
B ( X ) = g + T b ( ∂ p 1 f ) g + ∂ p 2 f − g ˙ − ∇ 1 g − ∇ 2 ,
ϕ ( X ) = − K A ( X ) ,
ψ ( X ) = I − K B ( X ) .
Consequently,
z ¨ 1 = ϕ ( X ) + ψ ( X ) ( u + d ) .
These identities are also used to check consistency between the analytical model and its numerical implementation.

2.2. Verified Decoupling-Matrix Bounds

Let { B j } j = 1 N B be a finite collection of closed boxes covering Ω X . On each box, construct an interval enclosure
ψ ( B j ) ⊆ [ Ψ ] j = M j + [ − R j , R j ] ,
where R j is componentwise nonnegative. The enclosure must include all state dependence and every uncertain parameter included in the claim. For a numerical certificate, elementary functions and matrix operations must be evaluated using verified outward rounding.
Suppose that verified bounds
s ̲ j ≤ σ min ( M j ) , ∥ R j ∥ F ≤ r ¯ j
are available. Define
σ ̲ j = s ̲ j − r ¯ j , σ ̲ = min 1 ≤ j ≤ N B σ ̲ j .
An ordinary floating-point singular-value calculation without a verified error bound is not sufficient for evaluating s ̲ j .
Proposition 1 (Computable uniform decoupling certificate).
Under Assumption 1, if the verified box enclosures satisfy σ ̲ > 0 , then ψ ( X ) is nonsingular throughout Ω X and
σ ★ : = min X ∈ Ω X σ min ( ψ ( X ) ) ≥ σ ̲ > 0 , ∥ ψ ( X ) − 1 ∥ 2 ≤ σ ̲ − 1 .
Proof. 
For X ∈ B j , write ψ ( X ) = M j + E j ( X ) . Componentwise enclosure gives ∥ E j ( X ) ∥ 2 ≤ ∥ E j ( X ) ∥ F ≤ r ¯ j . The singular-value perturbation inequality yields
σ min ( ψ ( X ) ) ≥ σ min ( M j ) − ∥ E j ( X ) ∥ 2 ≥ σ ̲ j .
Taking the minimum over the covering boxes proves the result. □
For scalar decoupling functions, the calculation simplifies. If ψ ( B j ) ⊆ [ ψ ̲ j , ψ ¯ j ] and this interval does not contain zero, then
σ ̲ j = min { | ψ ̲ j | , | ψ ¯ j | } .
An upper bound needed in the robustness analysis is obtained from the same enclosures:
ψ ¯ ≥ sup X ∈ Ω X ∥ ψ ( X ) ∥ 2 .
The offline procedure is as follows:
1.
Specify the operating domain, parameter set and controller transformation;
2.
Construct verified interval enclosures on an initial box partition;
3.
Accept boxes having a strictly positive lower bound;
4.
Bisect unresolved boxes and repeat;
5.
Report either a positive global lower bound or an inconclusive result at the prescribed computational limit.
Dense sampling may be reported as a diagnostic, but is not used in place of the verified covering calculation. No claim is made that an arbitrary nonlinear verification problem necessarily terminates after a prescribed finite number of subdivisions.

2.3. Constructive Zero-Dynamics Test

Set
η = col ( q 1 , p 1 ) , ξ = col ( q 2 , p 2 ) ,
and define
C 0 ( η , ξ ) = col z 1 ( η , ξ ) , z 2 ( η , ξ , 0 ) .
At the equilibrium, calculate
J η = ∂ C 0 ∂ η 0 , J ξ = ∂ C 0 ∂ ξ 0 .
Assumption 2 (Successful local zero-manifold test).
The equilibrium satisfies C 0 ( 0 , 0 ) = 0 . The explicitly constructed matrix J ξ is nonsingular, as established either analytically or by a verified positive lower bound
σ min ( J ξ ) ≥ σ ̲ ι > 0 .
By the implicit function theorem, the constraints locally define ξ = ι ( η ) , where
ι ( 0 ) = 0 , D ι ( 0 ) = − J ξ − 1 J η .
Define
u 0 ( X ) = − ψ ( X ) − 1 ϕ ( X )
and
H ( η , ξ ) = col p 1 , f ( q , p ) + g ( q ) u 0 ( X ) .
The zero-dynamics Jacobian is therefore constructed directly as
A Z = H η ( 0 ) − H ξ ( 0 ) J ξ − 1 J η .
Thus, no explicit nonlinear solution for ι is required.
A numerical implementation shall report J ξ , its nonsingularity measure, A Z and the eigenvalues of A Z . For a verified floating-point Hurwitz test, one may construct P Z = P Z ⊤ > 0 and verify
A Z ⊤ P Z + P Z A Z < 0 .
For a scalar second-order zero-dynamics model, exact coefficient Sign conditions may be used instead.
Lemma 1 (Invariant augmented zero manifold).
Suppose the decoupling and zero-manifold tests succeed. The local invariant augmented zero manifold is
M 0 = { ( X , χ 1 ) : C 0 ( η , ξ ) = 0 , χ 1 = 0 } .
On this manifold, u bb = u 0 and η ˙ = H ( η , ι ( η ) ) .
Proof. 
On z 1 = z 2 = 0 , the identity z ˙ 1 = − λ χ 1 shows that invariance requires χ 1 = 0 . Conversely, under u 0 , the three derivatives χ ˙ 1 , z ˙ 1 and z ˙ 2 vanish on z 1 = z 2 = χ 1 = 0 . The remaining dynamics are precisely the stated internal dynamics. □

2.4. Explicit Error-Subsystem Stability Test

Lemma 2 (Nominal error dynamics).
For c 1 , c 2 , λ > 0 , the nominal augmented error dynamics
z ˙ χ = ( A E ⊗ I n 2 ) z χ , z χ = col ( χ 1 , z 1 , z 2 ) ,
with
A E = 0 1 0 − λ − c 1 1 0 − 1 − c 2 ,
are exponentially stable.
Proof. 
The characteristic polynomial of A E is
p E ( s ) = s 3 + ( c 1 + c 2 ) s 2 + ( c 1 c 2 + λ + 1 ) s + λ c 2 .
All coefficients are positive. The remaining cubic Routh–Hurwitz inequality is
( c 1 + c 2 ) ( c 1 c 2 + λ + 1 ) > λ c 2 .
Its left-hand side minus its right-hand side equals
c 1 c 2 ( c 1 + c 2 ) + λ c 1 + c 1 + c 2 > 0 .
Hence, A E is Hurwitz. The Kronecker product repeats its eigenvalues n 2 times, establishing the result. □
Theorem 1 (Nominal local exponential stability).
Suppose the decoupling certificate and Assumption 2 hold, and the matrix A Z constructed in (5) is Hurwitz. Then, the nominal augmented equilibrium ( X , χ 1 ) = ( 0 , 0 ) is locally exponentially stable.
Proof. 
The map
Θ ( X , χ 1 ) = col ( η , χ 1 , z 1 , z 2 )
has a nonsingular Jacobian at the origin because J ξ is nonsingular. In these local coordinates, the nominal closed-loop linearisation is block triangular, with diagonal blocks A Z and A E ⊗ I n 2 . Both blocks are Hurwitz. The nominal vector field is C 1 near the equilibrium, so Lyapunov’s indirect method establishes local exponential stability. □

2.5. Explicit Cart–Inverted-Pendulum Specialisation

For the benchmark implementation, let q 1 = θ denote the pendulum angle measured from the upright position, and let q 2 = x denote cart displacement. The point-mass cart–pendulum model is
( M + m ) x ¨ + m l cos θ θ ¨ − m l sin θ θ ˙ 2 + b x x ˙ = F + F d ,
m l cos θ x ¨ + m l 2 θ ¨ − m g l sin θ + b θ θ ˙ = 0 .
The equilibrium θ = 0 is upright; this convention is used consistently in the controller and simulations.
Let v = x ˙ , p = θ ˙ ,
κ = g l , γ = b θ m l 2 , g c ( θ ) = − cos θ l .
After nominal partial feedback linearisation,
x ¨ = u + d , θ ¨ = κ sin θ − γ p + g c ( θ ) ( u + d ) .
Here, d has units of acceleration. A physical force disturbance F d corresponds, for the exact model, to
d = F d M + m sin 2 θ .
A derivative bound on F d therefore does not by itself equal a derivative bound on d.
For scalar K = k , the decoupling function becomes
ψ = 1 − k ( 1 − T b γ ) g c − T b g c ′ ( θ ) p + g c v .
Suppose
| θ | ≤ θ ¯ < π 2 , | p | ≤ p ¯ , | v | ≤ v ¯ , 1 − T b γ > 0 .
Define
L B = ( 1 − T b γ ) ( 1 − θ ¯ 2 / 2 ) l − T b θ ¯ l p ¯ + v ¯ l .
The inequalities cos θ ≥ 1 − θ ¯ 2 / 2 and | sin θ | ≤ θ ¯ give, for k < 0 and L B > 0 ,
| ψ | ≥ | k | L B − 1
whenever | k | L B > 1 . This conservative analytical lower bound can be supplemented by a sharper verified interval partition.
At the upright equilibrium, put G = − 1 / l and
D k = 1 − G k ( 1 − T b γ ) .
For the ordering ξ = ( x , v ) ,
J ξ = 1 k T b G c 1 1 + c 1 k T b G , det J ξ = 1 .
The zero-dynamics Jacobian is
A Z = 0 1 κ D k G k T b κ − γ D k .
For γ ≥ 0 and T b γ < 1 , the strict sufficient and the necessary coefficient conditions for this matrix to be Hurwitz are
D k < 0 , G k T b κ − γ > 0 .
Equivalently,
k < min − l 1 − T b γ , − γ l T b κ .
These explicit conditions make the zero-dynamics test independently reproducible.
The numerical gain search maximises a normalised minimum of the decoupling and zero-dynamics margins over a declared finite candidate set. Its output is described as the best candidate on that set, not as a globally optimal gain.

2.6. Computational Verification of Robust Containment

The nominal stability result is local. It does not establish the robust forward invariance of a prescribed operating domain.
A practical candidate is
V ( x a ) = x a ⊤ P x a , x a = col ( X , χ 1 ) ,
where P = P ⊤ > 0 is obtained from a Lyapunov equation for the nominal augmented linearisation. This construction alone does not establish that V is a Lyapunov function for the nonlinear composite controller.
Let
Ω a ( c ) = { x a : V ( x a ) ≤ c } ,
and choose a uniform observer-error budget E max . With G as defined in Assumption 3, define
L ( x a ) = ∇ V ( x a ) ⊤ F nom ( x a ) + G ( q ) ψ ( X ) − 1 ν + E max ∥ G ( q ) ⊤ ∇ V ( x a ) ∥ 2 .
The last term is the exact support function of the Euclidean observer-error ball.
A successful robust-containment verification consists of the following:
1.
Verified positive definiteness of P;
2.
Verified containment of the projection of Ω a ( c ) in int Ω X ;
3.
A verified strictly negative upper bound for L on V = c ;
4.
Compatibility of E max with the complete observer transient bound, including the prescribed initial errors;
5.
Verification that the requested physical actuator input remains strictly within its limits throughout the set, or explicit inclusion of the saturation discrepancy in the boundary test.
The boundary calculation can be implemented by interval branch-and-bound: discard boxes not intersecting V = c , accept boxes with a negative upper bound, and subdivide the remaining boxes. State-dependent residual bounds are computed over the whole sublevel set, not only along simulated trajectories.
This procedure verifies an inward-pointing condition for the actual composite vector field. If it succeeds, the sublevel set is a robust invariant set for the stated disturbance and observer-error budgets. If it is inconclusive, the nominal local stability certificate may still hold, but the robust invariance claim must remain unverified. A phase portrait, a decreasing sampled quadratic function, or a Monte Carlo success rate is not a substitute for this test.

3. Composite Robust Control Architecture

The composite controller combines the nominal block-backstepping law with a matched-disturbance observer and a bi-power nonlinear term. The observer estimate and the control input must be expressed in the same partially linearised input coordinates. For the cart–pendulum benchmark, these coordinates have acceleration units, whereas the physical actuator input has force units.
The analytical statements below concern the exact matched model and exact state feedback unless measurement noise, actuator saturation or parameter uncertainty is explicitly included. Simulations with additional uncertainties are reported separately as robustness experiments.

3.1. Extended State Observer and Complete Transient Bound

Let the measured actuated velocity be
p 2 m = p 2 + n , ∥ n ( t ) ∥ 2 ≤ n ¯ .
The observer is
p ^ ˙ 2 = u a + d ^ + 2 ω o ( p 2 m − p ^ 2 ) ,
d ^ ˙ = ω o 2 ( p 2 m − p ^ 2 ) , ω o > 0 ,
where u a is the known input actually applied in the partially linearised coordinates. In the unsaturated case, u a = u . When a physical actuator is saturated, the observer must use the corresponding applied input, not the unsaturated request.
Define
e p = p 2 − p ^ 2 , d ˜ = d − d ^ ,
where p ˙ 2 = u a + d . Suppose d is absolutely continuous and
∥ d ˙ ( t ) ∥ 2 ≤ d ¯ 1
almost everywhere.
Proposition 2 (Observer transient and ultimate bounds).
For all t ≥ 0 ,
∥ d ˜ ( t ) ∥ 2 ≤ e − ω o t ( 1 + ω o t ) ∥ d ˜ ( 0 ) ∥ 2 + ω o 2 t ∥ e p ( 0 ) ∥ 2   + d ¯ 1 ω o 2 − ( 2 + ω o t ) e − ω o t + 2 ω o e n ¯ .
In particular,
sup t ≥ 0 ∥ d ˜ ( t ) ∥ 2 ≤ ∥ d ˜ ( 0 ) ∥ 2 + ω o e ∥ e p ( 0 ) ∥ 2 + 2 d ¯ 1 ω o + 2 ω o e n ¯ = : E sup ,
lim sup t → ∞ ∥ d ˜ ( t ) ∥ 2 ≤ 2 d ¯ 1 ω o + 2 ω o e n ¯ = : E ∞ .
Proof. 
The observer-error dynamics are
d d t e p d ˜ = − 2 ω o I I − ω o 2 I 0 e p d ˜ + 0 I d ˙ − 2 ω o I ω o 2 I n .
The disturbance-error initial-condition response is
e − ω o t ( 1 + ω o t ) d ˜ ( 0 ) − ω o 2 t e p ( 0 ) .
The impulse response from d ˙ to d ˜ is
h d ( t ) = ( 1 + ω o t ) e − ω o t ,
whose integral over [ 0 , t ] is
2 − ( 2 + ω o t ) e − ω o t ω o .
The impulse response from n to d ˜ is
h n ( t ) = − ω o 2 ( 1 − ω o t ) e − ω o t ,
and
∫ 0 ∞ | h n ( t ) | d t = 2 ω o e .
The triangle inequality gives (11). The uniform estimate follows from ( 1 + ω o t ) e − ω o t ≤ 1 and ω o 2 t e − ω o t ≤ ω o / e . Taking the upper limit establishes the ultimate bound. □
The noise-free result in Lemma 4 is recovered by setting n ¯ = 0 . The uniform budget, rather than the ultimate bound alone, must be used in the robust-containment test:
E sup ≤ E max .
For an unknown initial disturbance, a known upper bound on ∥ d ˜ ( 0 ) ∥ 2 must be supplied.
For any ε > 0 , an explicit sufficient observer transient time is
t o ( ε ) = 2 ω o max 0 , log 2 ( ∥ d ˜ ( 0 ) ∥ 2 + ω o ∥ e p ( 0 ) ∥ 2 ) ε ,
with t o = 0 when both initial errors vanish. This guarantees
∥ d ˜ ( t ) ∥ 2 ≤ E ∞ + ε , t ≥ t o ( ε ) .
This follows from ( 1 + s ) e − s ≤ 2 e − s / 2 and s e − s ≤ 2 e − s / 2 for s ≥ 0 .
For bandwidth selection, one may minimise the explicitly declared surrogate
J o ( ω ) = w d 2 d ¯ 1 ω 2 + w n 2 ω n ¯ e 2 .
When d ¯ 1 , n ¯ > 0 , its unconstrained minimiser is
ω opt = e d ¯ 1 n ¯ w d w n 1 / 4 .
The selected bandwidth is its projection onto the prescribed admissible interval. This is optimality for the stated surrogate, not a global closed-loop performance claim.

3.2. Bi-Power Nonlinear Term

For ρ > 0 , define the componentwise signed power
sig ρ ( v ) = col | v i | ρ sign ( v i ) .
The nonlinear term is
ν = − a 1 sig α ( z 1 ) − a 2 sig β ( z 1 ) − b 1 sig α ( z ˙ 1 ) − b 2 sig β ( z ˙ 1 ) ,
where
a 1 , a 2 , b 1 , b 2 > 0 , 0 < α < 1 < β .
We use the term bi-power because both sublinear and superlinear signed powers are present. No assertion that the complete augmented closed loop is homogeneous or finite-time stable follows merely from this choice.
Under the exact matched model,
z ˙ 1 = − c 1 z 1 − λ χ 1 + z 2
is evaluated algebraically. It does not require the numerical differentiation of a noisy angle signal.

3.3. Composite Law and Saturation Discrepancy

The requested virtual input is
u c = u bb + ψ ( X ) − 1 ν − d ^ .
Let
δ u = u a − u c
denote the discrepancy between the applied and requested virtual inputs. For an unsaturated, exact actuator, δ u = 0 .
Lemma 3 (Exact channel decomposition).
Under the exact matched model and exact state feedback,
z ¨ 1 = ν + r a ,
where
r a = ψ ( X ) ( d ˜ + δ u ) − C 1 z 1 − C 2 z 2 + λ c 1 χ 1 .
For δ u = 0 , write r = r a .
Proof. 
The transformation gives z ¨ 1 = ϕ + ψ ( u a + d ) . Substitute u a = u bb + ψ − 1 ν − d ^ + δ u and the definition of u bb . □
Consequently, actuator saturation is not a plotting operation: if it is applied physically, ψ δ u is an additional term in the transformed dynamics. There are two valid certification options:
1.
Verify that saturation is inactive throughout the certified set, including the allowed observer states;
2.
Include a verified bound on δ u in both the invariance and residual calculations.
Using the applied input in the observer avoids attributing known clipping to the unknown disturbance, but does not restore the cancellation lost in the controller.

3.4. Practical Velocity-Error Entrance

Suppose robust containment has been verified and define
z ¯ i = sup Ω a ∥ z i ∥ 2 , χ ¯ 1 = sup Ω a ∥ χ 1 ∥ 2 .
Let m = n 2 , and suppose ∥ δ u ∥ 2 ≤ δ ¯ u on the certified set. For t ≥ t o ( ε ) , a valid residual bound is
r ¯ ε = ψ ¯ ( E ∞ + ε + δ ¯ u ) + | C 1 | z ¯ 1 + | C 2 | z ¯ 2 + λ c 1 χ ¯ 1 .
Furthermore,
∥ sig α ( z 1 ) ∥ 2 ≤ m ( 1 − α ) / 2 z ¯ 1 α , ∥ sig β ( z 1 ) ∥ 2 ≤ z ¯ 1 β .
Thus, the aggregate perturbation
φ = − a 1 sig α ( z 1 ) − a 2 sig β ( z 1 ) + r a
satisfies
∥ φ ∥ 2 ≤ a 1 m ( 1 − α ) / 2 z ¯ 1 α + a 2 z ¯ 1 β + r ¯ ε = : φ ¯ ε .
Proposition 3 (Practical fixed-time entrance of the velocity channel).
Let s = ∥ z ˙ 1 ∥ 2 and
s ★ = 2 φ ¯ ε b 1 1 / α .
For t ≥ t o ( ε ) and s ≥ s ★ ,
D + s ≤ − b 1 2 s α − b 2 m ( 1 − β ) / 2 s β .
The set s ≤ s ★ is forward invariant while the perturbation bound holds. Its entrance time, measured from t o ( ε ) , is bounded independently of s ( t o ) by
T ent ≤ 2 s c 1 − α b 1 ( 1 − α ) + s c 1 − β b 2 m ( 1 − β ) / 2 ( β − 1 )
for any selected reference speed s c > 0 . For normalised coordinates with s c = 1 , this becomes
T ent ≤ 2 b 1 ( 1 − α ) + m ( β − 1 ) / 2 b 2 ( β − 1 ) .
Proof. 
For s > 0 ,
D + s ≤ − b 1 s α − b 2 m ( 1 − β ) / 2 s β + φ ¯ ε .
The two signed-power estimates follow from the finite-dimensional norm inequalities. For s ≥ s ★ , φ ¯ ε ≤ b 1 s α / 2 . The vector field points inward at a positive boundary s = s ★ .
An upper bound on the entrance time is obtained by extending the comparison integral to ( 0 , ∞ ) and splitting it at s c . On ( 0 , s c ) , retain the sublinear term; on ( s c , ∞ ) , retain the superlinear term. Integrating the two resulting powers yields (19). The zero-residual case follows from the same comparison argument with s ★ = 0 . □
The total guaranteed time is
t total ≤ t o ( ε ) + T ent .
This is an entrance guarantee for the transformed velocity error, conditional on robust containment and the stated bounds. It is not a finite-time convergence guarantee for ( X , χ 1 , p ^ 2 , d ^ ) , nor a claim that the physical angle and cart displacement settle within the same time.
The introduction of ε > 0 is essential when only an ultimate observer bound is available: a limsup bound does not imply finite-time entry into the same closed bound without slack.

3.5. Implementation and Validation Protocol

The numerical study distinguishes the following:
1.
Exact-model nominal regulation;
2.
Exact matched-disturbance observer validation;
3.
Deterministic disturbance, measurement-noise and parameter-mismatch experiments;
4.
Multiple-initial-condition entrance experiments;
5.
Seeded Monte Carlo comparisons.
All compared controllers receive the same initial physical state and the same prescribed disturbance and measurement-noise histories. The baseline differs only by the removal of the observer compensation and nonlinear overlay; it is not artificially disadvantaged by a different velocity measurement architecture.
Physical states, requested and applied actuator inputs, saturation duration, observer error, operating-domain exits, and decoupling margins are recorded without artificial amplitude scaling or time-dependent display decay. Failed runs are retained and identified.
The observer bound is compared with simulation only in experiments satisfying its assumptions. Residual maxima computed from finite trajectories are labelled empirical finite-horizon quantities, not verified global bounds. A successful interval verification and a successful simulation are reported as distinct outcomes.
The complete architecture is depicted in Figure 1.
Figure 1. Composite backstepping architecture.

4. Stability Analysis

Lemma 4 (Observer Estimation Bound).
If ∥ d ˙ ( t ) ∥ 2 ≤ d ¯ 1 , the perturbation estimation error d ˜ : = d − d ^ satisfies lim sup t → ∞ ∥ d ˜ ( t ) ∥ 2 ≤ 2 d ¯ 1 ω o .
Proof. 
Defining p ˜ 2 : = p 2 − p ^ 2 and d ˜ : = d − d ^ , (1) and (10) yield the LTI error dynamics E ˙ = A o E + B o d ˙ ( t ) , where E : = col ( p ˜ 2 , d ˜ ) , B o : = col ( 0 , I ) , and A o = − 2 ω o I I − ω o 2 I 0 .
Since all block matrices in A o are scalar multiples of the identity matrix I n 2 , each component pair ( p ˜ 2 , i , d ˜ i ) obeys identical dynamics; the transfer function from d ˙ i to d ˜ i is
H ( s ) = s + 2 ω o ( s + ω o ) 2 ,
with impulse response h ( t ) = ( 1 + ω o t ) e − ω o t ≥ 0 , ∀ t ≥ 0 .
Since the impulse response is nonnegative ( h ( t ) ≥ 0 ), the integral form of the triangle inequality and the absolute homogeneity of the Euclidean norm permit the scalar weight to pass through the norm. Accounting for the unforced initial-condition response, the complete error norm satisfies
∥ d ˜ ( t ) ∥ 2 ≤ 0 I e A o t E ( 0 ) 2 + ∫ 0 t h ( t − τ ) ∥ d ˙ ( τ ) ∥ 2 d τ .
Since A o is Hurwitz [36], the transient term exponentially vanishes as t → ∞ . Bounding the remaining convolution integral yields the ultimate limit: lim sup t → ∞ ∥ d ˜ ( t ) ∥ 2 ≤ d ¯ 1 ∫ 0 ∞ h ( τ ) d τ = 2 d ¯ 1 ω o . □
Lemma 5 (Finite-time entrance).
Let y : R ≥ 0 → R m satisfy
y ¨ = − b 1 sig α ( y ˙ ) − b 2 sig β ( y ˙ ) + φ ( t ) ,
where ∥ φ ( t ) ∥ 2 ≤ φ ¯ , b 1 , b 2 > 0 , and 0 < α < 1 < β .
  • Set s : = ∥ y ˙ ∥ 2 , s ★ : = 2 φ ¯ b 1 1 / α . Then, for almost every t such that s ( t ) ≥ s ★ , s ˙ ( t ) ≤ − b 1 2 s ( t ) α . Consequently, if s ( 0 ) > s ★ , then s ( t ) ≤ s ★ for all t ≥ T ★ , where
    T ★ = 2 s ( 0 ) 1 − α − s ★ 1 − α b 1 ( 1 − α ) .
Proof. 
For s > 0 , the map t ↦ ∥ y ˙ ( t ) ∥ 2 is differentiable almost everywhere, yielding the time derivative s ˙ = s − 1 y ˙ ⊤ y ¨ . By the element-wise definition of the sig α operator, y ˙ ⊤ sig α ( y ˙ ) = ∥ y ˙ ∥ α + 1 α + 1 . Since α + 1 ∈ ( 1 , 2 ) , the standard inclusion property of finite-dimensional l p norms implies ∥ y ˙ ∥ α + 1 ≥ ∥ y ˙ ∥ 2 = s . Consequently,
y ˙ ⊤ sig α ( y ˙ ) ≥ s α + 1 .
The Cauchy–Schwarz inequality and the uniform bound on φ yield y ˙ ⊤ φ ≤ ∥ y ˙ ∥ 2 ∥ φ ∥ 2 ≤ s φ ¯ . Substituting the dynamics of y ¨ into the expression for s ˙ and discarding the nonnegative term b 2 y ˙ ⊤ sig β ( y ˙ ) = b 2 ∥ y ˙ ∥ β + 1 β + 1 ≥ 0 establishes the differential inequality
s ˙ ≤ − b 1 s α + φ ¯ .
Integrating this inequality via the comparison principle [18] yields the stated entrance time T ★ . □
Assumption 3 (Robust compact containment).
Let x a : = col ( X , χ 1 ) ∈ R 2 n 1 + 3 n 2 , and V nom : R 2 n 1 + 3 n 2 ↦ R ≥ 0 ∈ C 1 be a Lyapunov function for the nominal closed-loop system. There exists a constant c > 0 such that the compact sublevel set ([17], Chapter 4)
Ω a : = { x a ∣ V nom ( x a ) ≤ c }
is strictly contained within the domain of attraction of the nominal equilibrium. Furthermore, there exists a uniform bound d ˜ ¯ sup > 0 such that, for all x a ∈ ∂ Ω a and all observer errors satisfying ∥ d ˜ ∥ 2 ≤ d ˜ ¯ sup , the following strict dissipation inequality holds:
∇ V nom ( x a ) ⊤ G ( q ) ψ ( X ) − 1 ν ( z 1 , z ˙ 1 ) + d ˜ < − ∇ V nom ( x a ) ⊤ F nom ( x a ) ,
where F nom ( x a ) is the nominal closed-loop vector field, and the input distribution matrix is defined as the block column vector
G ( q ) : = col ( 0 n 1 × n 2 , g ( q ) , 0 n 2 × n 2 , I n 2 , 0 n 2 × n 2 ) .
Theorem 2 (Conditional robust containment and practical entrance).
Suppose the decoupling and local zero-dynamics tests succeed. Let a compact sublevel set Ω a have its physical-state projection contained in int Ω X , and suppose the robust boundary test in Section 2.6 has been verified for an observer-error budget E max .
Assume that the disturbance and initial observer errors satisfy
E sup ≤ E max ,
where E sup is given by (12). Assume also that actuator saturation is either excluded on the certified set or included explicitly in the verified boundary and residual bounds. For noisy state feedback outside the ESO, the associated controller perturbations must additionally be included in those bounds.
Then, every solution starting in Ω a remains in Ω a and admits continuation for all t ≥ 0 . For every ε > 0 , the transformed velocity error enters the set specified in Proposition 3 no later than t o ( ε ) + T ent . No finite-time convergence of the complete state to the origin is asserted.
Proof. 
Proposition 2 supplies the required observer-error bound for the entire transient, not only asymptotically. The verified boundary inequality therefore makes the vector field strictly inward pointing on ∂ Ω a . This establishes forward invariance. The bounded disturbance, bounded physical and integral states, and bounded observer errors preclude a finite escape of the augmented solution. The residual bounds and the entrance claim follow from Proposition 3. □
Remark 1 (Explicit residual bound).
Let z ¯ i = sup x a ∈ Ω a ∥ z i ∥ 2 , χ ¯ 1 = sup x a ∈ Ω a ∥ χ 1 ∥ 2 , ψ ¯ = sup Ω X ∥ ψ ( X ) ∥ 2 , and let d ˜ ¯ be the bound from Lemma 4. Then,
lim sup t → ∞ ∥ r ( t ) ∥ 2 ≤ ψ ¯ d ˜ ¯ + | C 1 | z ¯ 1 + | C 2 | z ¯ 2 + λ c 1 χ ¯ 1 r ¯ .

5. Simulation Results

The numerical study follows the protocol in Section 3. Offline algebraic tests on the declared box Ω X are reported first; closed-loop records are reported afterwards. A successful analytical or interval certificate and a successful simulation are distinct outcomes. Three implementations share the same plant, the same Ω X , the same T b and the same coefficients: the nominal law in (2) (BB), that law with (10) (BB+ESO), and the composite law in (16) (BB+ESO+FT).

5.1. Plant, Box and Implemented Coefficients

The plant is a virtual replica of the Digital Pendulum System (Feedback Instruments, model 33-005-PCI) ([16], Section 4.6). Parameters and the design box
Ω X = X = col ( x , θ , v , ω ) : | x | ≤ x ¯ , | θ | ≤ θ ¯ , | v | ≤ v ¯ , | ω | ≤ ω ¯
are listed in Table 1. Here, n 1 = n 2 = 1 and K = k . As in Section 2.5, the matched signal d lives in the partially linearised acceleration channel. A physical force F d satisfies d = F d / ( M + m sin 2 θ ) on the exact model, so a bound on F ˙ d is not, by itself, a bound on d ˙ .
Table 1. Cart–pendulum parameters and design box Ω X . Inertias follow J com = J p − m l 2 . Friction and the force/rail limits are modelling assumptions of the virtual replica.
Implemented gains appear in Table 2. In particular, ω o = 30 s − 1 and ( b 1 , b 2 ) = ( 0.879 , 0.621 ) m s − 2 . The cascade pair satisfies c 1 + c 2 = 8 s − 1 , whence C 1 = 1 − c 1 2 + λ = − 6.838 and C 2 = 8 . The bi-power term is evaluated on the normalised arguments z 1 / z ref and z ˙ 1 / s ref rather than on z 1 , z ˙ 1 directly. Because sig ρ is homogeneous of degree ρ , this is a rescaling of (15): the tabulated ( a i , b i ) and the comparison time T formula belong to those normalised coordinates, which are also the coordinates in which Proposition 3 is applied.
Table 2. Implemented controller and offline numbers at the selected k. The pair ( c 1 , c 2 ) is the split of c 1 + c 2 = 8 used in the code. The weights ( a i , b i ) and T formula are those of the normalised bi-power term.
Integrations use RK4 with d t = 1 ms on a horizon of T = 8 s . A step-halving check on the same vector field, controller and noise functions produced a four-state discrepancy no larger than 1.5 × 10 − 6 in SI units.
The actuator is limited to F max = 15 N . Lemma 3 holds with δ u = 0 only when u a = u c . In the numerical plant, the requested force is clipped, and the observer is fed u a rather than u c . Across the records below, the observed saturation fraction is either zero or of order 10 − 3 of the horizon. That sampled fact does not replace the set-wise test in Section 2.6.

5.2. Offline Tests of ψ and A Z

For this plant, ψ is the scalar from Section 2.5. Figure 2 plots the whole-box analytical lower bound | ψ | ≥ | k | L B − 1 against k, together with a dense-angle diagnostic. The two curves agree on the plotted interval. The diagnostic is not a substitute for the verified covering argument in Proposition 1; it is reported as a check on the conservative closed-form bound. Because ψ is scalar, the calculation is cheap. For larger n, the same test must be replaced by the box-covering procedure from Section 2.
Figure 2. Offline transformation design on Ω X .
The marker k = − 0.910 m rad − 1 is the maximiser of a normalised max–min score on a declared finite grid, not a continuum optimiser. At that value, the design script returns
σ ̲ = 0.652 , μ Z = − max i Re λ i ( A Z ) = 3.254 s − 1 , H min = 0.894 , det J ξ = 1 .
Thus, J ξ is nonsingular and the implemented A Z is Hurwitz with spectral abscissa − μ Z . The two eigenvalues are the roots of that same implemented 2 × 2 matrix, assembled by (5) in the coordinates of the numerical model. They are not inferred from the point-mass specialisation in Section 2.5 unless that specialisation is the model used in code: the virtual replica uses J p , whereas the displayed point-mass Jacobian uses m l 2 .
The top-left panel in Figure 2 is a lower bound on | ψ | . It does not give ψ ¯ = sup X ∈ Ω X ∥ ψ ( X ) ∥ 2 , which is a separate upper estimate at the selected k. On the recorded orbits of the next subsections, | ψ | remains near 0.89 . Residual quantities r ¯ and φ ¯ in the sense of the explicit residual bound and of Proposition 3 further require extrema of ( z 1 , z 2 , χ 1 ) on a declared Ω a . Those extrema are not read from a single trajectory, and they are not claimed here as verified set-wise bounds.

5.3. Observer Envelope and Decoupling Along One Record

Lemma 4 is an ultimate bound. Theorem 2 uses the complete transient budget of Proposition 2. Figure 3 shows both, for the injected acceleration-channel signal of this campaign (not the force-rate figure of an earlier draft). The ultimate line in the figure is 2 d ¯ 1 / ω o at the implemented ω o = 30 s − 1 and at the rate bound of that same injected d. After about 0.2 s , the recorded | d ˜ | lies below that line; the first samples do not. Forward invariance of a candidate Ω a on this record is therefore an observed property of the initialisation, not a corollary of the limsup alone.
Figure 3. Exact–model observer record.
Along the same orbit, | ψ | remains near 0.89 , above σ ̲ = 0.652 , whilst the state stays inside Ω X . Requested and injected forces are plotted together so that any approach to F max can be seen. On this record the applied force stays inside the limiter after the opening sample.

5.4. One Common Stress Comparison

A single Lipschitz disturbance and a common initial condition are applied to all three laws (Figure 4, Table 3). BB leaves a persistent oscillation. BB+ESO removes most of that residual. BB+ESO+FT further reduces | z 1 | after the first second and records the smallest terminal index and the smallest IAE on this horizon. Settling times are 1.06 s (BB+ESO) and 0.97 s (BB+ESO+FT); BB does not meet the settling test in 8 s . The minimum observed | ψ | is 0.878 .
Figure 4. Common perturbed–plant experiment.
Table 3. Quantitative comparison. Stress: one common disturbance and initial condition (seed 73). Monte Carlo: median (minimum, maximum) over 24 shared seeds. BB settling statistics use the 21 records that settle. IAEx in metre-seconds; IAEθ in radian-seconds.
Two caveats belong here. First, the record is not a proof of Theorem 2, and the figure does not display T ent . The comparison time associated with Proposition 3, after a residual radius has been sampled a posteriori in the normalised coordinates of Table 2, is T formula = 2.91 s . The last entry of | z ˙ 1 | into the engineering band on the recorded family occurs earlier than that mark. Second, total variation of the applied force is larger for BB+ESO+FT than for BB+ESO ( 57.5 N against 34.7 N on this record). The bi-power term buys IAE and terminal error at the price of a more lively actuator.

5.5. Seeded Monte Carlo

Twenty-four common seeds are reused for the three controllers (Figure 5, Table 3). Every run completed 8 s . Under a strict success test combining settling, terminal index and box containment, BB succeeds on 21 / 24 seeds (3 censored non-settling records, not crashes); BB+ESO and BB+ESO+FT succeed on 24 / 24 . Median settling times fall from 5.07 s (BB, on those records that settle) to 1.07 s and 0.87 s . Median normalised IAE falls from 0.618 to 0.295 and 0.234 . Median RMS force is essentially unchanged (≈0.84–0.88 N ); total variation is systematically higher once the bi-power term is active.
Figure 5. Seeded Monte Carlo on 24 common trials. Settling-time NR markers are censored BB records, not numerical settling times. IAE and RMS force use completed horizons only (all runs completed). Minimum observed | ψ | includes records up to any safety stop. The overlays improve settling and IAE; they do not reduce RMS effort.
The smallest | ψ | among all 72 records is 0.860 , still above σ ★ . The largest peak domain ratio is 0.996 , so no sampled orbit leaves Ω X . These are counts from a finite seeded study. They are not hypothesis tests, not empirical probabilities of stability, and not a covering of Ω X . In the language of Section 2.6, they do not replace the interval boundary test in Assumption 3.
No finite-time convergence of ( X , χ 1 , p ^ 2 , d ^ ) to the origin is inferred from any of the four figures. Additional diagnostics generated on the same campaign (nominal regulation, phase portraits, a sampled quadratic that is not a containment certificate, a velocity-entrance family, completion counts, a four-term anatomy of ν , and the step-refinement overlay) are omitted from the main text.

6. Conclusions

The offline tests decide the invertibility of ψ on Ω X and local exponential stability of the zero dynamics. Both are properties of a declared model and a declared compact set: a completed covering with σ ̲ > 0 gives σ ★ ≥ σ ̲ and a usable inverse bound. A Hurwitz Jacobian A Z is a local statement about the unforced zero dynamics. It is not a robustness certificate for the perturbed loop.
The overlays address that gap only in the sense made precise by Theorem 2. The observer contributes the ultimate bound 2 d ¯ 1 / ω o and the transient budget E sup used in the invariance argument. The bi-power term contributes the entrance time t o ( ε ) + T ent for ∥ z ˙ 1 ∥ 2 . Neither overlay is claimed to render the full state ( X , χ 1 , p ^ 2 , d ^ ) finite-time stable. The cart–pendulum records in Section 5 are consistent with those distinctions; they are not a covering of Assumption 3. The construction remains the block-backstepping law of [15], with the tests and overlays attached.

Author Contributions

Methodology, formal analysis, investigation and draft preparation, S.R.; supervision, review and editing, M.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ESOExtended State Observer
FTFinite-Time
DOFDegrees of Freedom

References

  1. Lu, B.; Fang, Y. Online trajectory planning control for a class of underactuated mechanical systems. IEEE Trans. Autom. Control 2024, 69, 442–448. [Google Scholar] [CrossRef] [Scilit]
  2. Reyhanoglu, M.; van der Schaft, A.; McClamroch, N.H.; Kolmanovsky, I. Dynamics and Control of a Class of Underactuated Mechanical Systems. IEEE Trans. Autom. Control 1999, 44, 1663–1671. [Google Scholar] [CrossRef] [Scilit]
  3. Wang, B.; Nersesov, S.; Ashrafiuon, H. Quasi-LPV Control Design for a Class of Underactuated Mechanical Systems. In Proceedings of the 2022 American Control Conference (ACC), Atlanta, GA, USA, 8–10 June 2022; pp. 1904–1909. [Google Scholar] [CrossRef] [Scilit]
  4. Franco, E.; Arpenti, P.; Donaire, A.; Ruggiero, F. Integral IDA-PBC for Underactuated Mechanical Systems Subject to Matched and Unmatched Disturbances. IEEE Control Syst. Lett. 2024, 8, 568–573. [Google Scholar] [CrossRef] [Scilit]
  5. Emirsajłow, Z.; Barciński, T. A Robust Asymptotic Tracking Controller for an Uncertain 2DOF Underactuated Mechanical System Motivated by a Satellite Attitude Control Problem. Int. J. Appl. Math. Comput. Sci. 2025, 35, 97–116. [Google Scholar] [CrossRef] [Scilit]
  6. Krafes, S.; Chalh, Z.; Saka, A. A Review on the Control of Second Order Underactuated Mechanical Systems. Complexity 2018, 2018, 9573514, Correction in Complexity 2020, 2020, 1629749. https://doi.org/10.1155/2020/1629749. [Google Scholar] [CrossRef] [Scilit]
  7. Liu, Y.; Yu, H. A Survey of Underactuated Mechanical Systems. IET Control Theory Appl. 2013, 7, 921–935. [Google Scholar] [CrossRef] [Scilit]
  8. Huang, Z.; Yu, C.; Zeng, B.; Gong, X.; Zhou, H. A Survey of Planar Underactuated Mechanical System. Machines 2024, 12, 829. [Google Scholar] [CrossRef] [Scilit]
  9. Olfati-Saber, R. Normal forms for underactuated mechanical systems with symmetry. IEEE Trans. Autom. Control 2002, 47, 305–308. [Google Scholar] [CrossRef] [Scilit]
  10. Fantoni, I.; Lozano, R. Non-Linear Control for Underactuated Mechanical Systems; Springer: London, UK, 2001. [Google Scholar] [CrossRef] [Scilit]
  11. Xin, X.; Liu, Y. Control Design and Analysis for Underactuated Robotic Systems; Springer: London, UK, 2014. [Google Scholar] [CrossRef] [Scilit]
  12. Olfati-Saber, R. Cascade Normal Forms for Underactuated Mechanical Systems. In Proceedings of the 39th IEEE Conference on Decision and Control, Sydney, Australia, 12–15 December 2000; pp. 2162–2167. [Google Scholar] [CrossRef] [Scilit]
  13. Olfati-Saber, R. Nonlinear Control and Reduction of Underactuated Systems with Symmetry. II. Unactuated Shape Variables Case. In Proceedings of the Proceedings of the 40th IEEE Conference on Decision and Control, Orlando, FL, USA, 4–7 December 2001; pp. 4164–4169. [Google Scholar] [CrossRef] [Scilit]
  14. Li, N.; Liu, X.; Liu, C.; Wang, H.; Ju, J.; Li, C. A novel block backstepping-based trajectory tracking control with zero dynamics stability for underactuated overhead cranes. ISA Trans. 2025, 166, 379–392. [Google Scholar] [CrossRef] [Scilit]
  15. Rudra, S.; Barai, R.K.; Maitra, M. Nonlinear State Feedback Controller Design for Underactuated Mechanical System: A Modified Block Backstepping Approach. ISA Trans. 2014, 53, 317–326. [Google Scholar] [CrossRef] [Scilit]
  16. Rudra, S.; Barai, R.K.; Maitra, M. Block Backstepping Design of Nonlinear State Feedback Control Law for Underactuated Mechanical Systems; Springer: Singapore, 2017. [Google Scholar] [CrossRef] [Scilit]
  17. Khalil, H. Nonlinear Systems; Pearson Education, Prentice Hall: Upper Saddle River, NJ, USA, 2002. [Google Scholar]
  18. Hahn, W. Stability of Motion; Grundlehren der Mathematischen Wissenschaften; Springer: Berlin/Heidelberg, Germany, 2012. [Google Scholar] [CrossRef] [Scilit]
  19. Krstic, M.; Kokotovic, P.V.; Kanellakopoulos, I. Nonlinear and Adaptive Control Design, 1st ed.; John Wiley & Sons, Inc.: Hoboken, NJ, USA, 1995. [Google Scholar]
  20. Farrell, J.A.; Polycarpou, M.; Sharma, M.; Dong, W. Command Filtered Backstepping. IEEE Trans. Autom. Control 2009, 54, 1391–1395. [Google Scholar] [CrossRef] [Scilit]
  21. Ye, H.; Song, Y. Backstepping Design Embedded With Time-Varying Command Filters. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 2832–2836. [Google Scholar] [CrossRef] [Scilit]
  22. Zhu, J.; Li, S.; Liu, Z. Adaptive command filter control for switched time-delay systems with dead-zone based on an exact disturbance observer. Int. J. Robust Nonlinear Control 2024, 34, 10131–10159. [Google Scholar] [CrossRef] [Scilit]
  23. Xu, D.; Dai, Y.; Yang, C.; Yan, X. Adaptive fuzzy sliding mode command-filtered backstepping control for islanded PV microgrid with energy storage system. J. Frankl. Inst. 2019, 356, 7025–7046. [Google Scholar] [CrossRef] [Scilit]
  24. Mercorelli, P. Feedforward and repetitive control of a servo piezo-mechanical hydraulic actuator. J. Phys. Conf. Ser. 2020, 1564, 012005. [Google Scholar] [CrossRef] [Scilit]
  25. Turrisi, G.; Capotondi, M.; Gaz, C.; Modugno, V.; Oriolo, G.; De Luca, A. On-Line Learning for Planning and Control of Underactuated Robots with Uncertain Dynamics. IEEE Robot. Autom. Lett. 2022, 7, 358–365. [Google Scholar] [CrossRef] [Scilit]
  26. Turcato, N.; Calì, M.; Dalla Libera, A.; Giacomuzzo, G.; Carli, R.; Romeres, D. Learning Global Control of Underactuated Systems with Model-Based Reinforcement Learning. arXiv 2025, arXiv:2504.06721. [Google Scholar] [CrossRef] [Scilit]
  27. Royden, H.; Fitzpatrick, P. Real Analysis; Pearson Modern Classics for Advanced Mathematics Series; Pearson: London, UK, 2018. [Google Scholar]
  28. Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd ed.; Cambridge University Press: Cambridge, UK, 2012. [Google Scholar] [CrossRef] [Scilit]
  29. Moore, R.E.; Kearfott, R.B.; Cloud, M.J. Introduction to Interval Analysis; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 2009. [Google Scholar] [CrossRef] [Scilit]
  30. Boyd, S.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar] [CrossRef] [Scilit]
  31. Krantz, S.G.; Parks, H.R. The Implicit Function Theorem: History, Theory, and Applications; Birkhäuser: Boston, MA, USA, 2002. [Google Scholar] [CrossRef] [Scilit]
  32. Teschl, G. Ordinary Differential Equations and Dynamical Systems; American Mathematical Society: Providence, RI, USA, 2012; Volume 140. [Google Scholar]
  33. Le, D.T.; Dao, Q.T. A model-assisted ESO-based nonlinear ADRC for robust transportation control of a biglide parallel robot. Results Control Optim. 2026, 24, 100761. [Google Scholar] [CrossRef] [Scilit]
  34. Zhu, W.; Du, H. Global Uniform Finite-Time Output Feedback Stabilization for Disturbed Nonlinear Uncertain Systems: Backstepping-like Observer and Nonseparation Principle Design. SIAM J. Control Optim. 2024, 62, 1717–1736. [Google Scholar] [CrossRef] [Scilit]
  35. Dao, K.L.; Tran, M.K.; Tong, T.L.; Duong, M.D. Disturbance observer integrated proportional–derivative sliding mode control for trajectory tracking control of quadrotor UAVs. Results Control Optim. 2026, 24, 100769. [Google Scholar] [CrossRef] [Scilit]
  36. Guo, B.Z.; Zhao, Z.L. On the convergence of an extended state observer for nonlinear systems with uncertainty. Syst. Control Lett. 2011, 60, 420–430. [Google Scholar] [CrossRef] [Scilit]
  37. Darouach, M. Complements to full order observer design for linear systems with unknown inputs. Appl. Math. Lett. 2009, 22, 1107–1111. [Google Scholar] [CrossRef] [Scilit]
  38. Polyakov, A.; Krstic, M. Finite- and Fixed-Time Nonovershooting Stabilizers and Safety Filters by Homogeneous Feedback. IEEE Trans. Autom. Control 2023, 68, 6434–6449. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.