Fixed-Time Stable Systems

• Fixed-time stable systems are defined by a convergence property where all trajectories reach an equilibrium within a predetermined uniform time bound, regardless of initial conditions.
• They employ Lyapunov functions with multiple power terms to derive explicit settling-time bounds, ensuring robust performance even under disturbances or stochastic noise.
• Applications include control, estimation, and learning across nonlinear, discrete, and large-scale systems, enabling precise convergence deadlines and improved system reliability.

A fixed-time stable system is a nonlinear, linear, or stochastic dynamical system whose solutions are rigorously guaranteed to converge to an equilibrium or invariant set within a time bound that is uniform over all admissible initial conditions. The defining feature is that the convergence (settling) time is independent of the initial state, and this property is certified by Lyapunov-based inequalities involving multiple power terms in the state or a related Lyapunov function. This concept underpins the synthesis of controllers, observers, algorithms, and learning dynamics that guarantee deterministic or probabilistic convergence to target sets in a time explicitly specified by parameters, even in the presence of exogenous disturbances or stochastic noise.

1. Formal Definition and Core Concepts

A system $\dot{x}=f(x)$ (continuous-time) or $y(k+1)=F(y(k))$ (discrete-time) is fixed-time stable (FxTS) if it is Lyapunov stable and there exists a uniform upper bound $T^*<\infty$ such that all trajectories starting from admissible initial conditions reach the equilibrium within $T^*$ and remain there for all future times. For stochastic systems, fixed-time stability in probability requires an analogous bound holding almost surely or in expectation, independent of the initial condition (Tatari et al., 2022, Black et al., 2024).

Specifically, for discrete-time autonomous systems, the fixed-time stability of the equilibrium $y=0$ is characterized by the existence of a settling-time function $K(y_0)$ and $K_{\max}$ such that for all $y_0$ in the domain, $y(k)=0$ for all $k\ge K(y_0)$ and $K(y_0)\le K_{\max}$; $K_{\max}$ does not depend on $y_0$ (Tatari et al., 2022). In continuous time, the standard Lyapunov condition asserts that, for a positive definite, radially unbounded $V$,

$$\dot V(x) \leq -aV(x)^p - bV(x)^q \quad\text{with }0 < p < 1 < q,\;a,b>0,$$

implies fixed-time stability with

$$T(x_0) \leq \frac{1}{a(1-p)} + \frac{1}{b(q-1)} =: T_{\max}.$$

This bound is uniform and independent of initial $x_0$ (Luo et al., 2024).

2. Lyapunov-Based Synthesis and Certification

Lyapunov conditions play a central role in certifying fixed-time stability. For deterministic discrete-time systems, the fixed-time condition is:

$$\Delta V(y(k+1)) := V(y(k+1)) - V(y(k)) \leq -\alpha \min\left\{\frac{V(y(k))}{\alpha}, \max\left\{V(y(k))^{r_1}, V(y(k))^{r_2}\right\}\right\}$$

for suitable $0<\alpha<1$, $0<r_1<1<r_2$. This yields an explicit bound on the settling time (number of steps to reach equilibrium):

$$K(y_0) \leq \left\lfloor \alpha^{1/(1-r_1)}(1-\alpha^{1/(1-r_1)}) \right\rfloor + \left\lfloor \alpha^{-1}(\alpha^{1/(1-r_2)}-1) \right\rfloor + 3$$

holding uniformly over initial conditions in the region of attraction (Tatari et al., 2022).

For continuous-time and stochastic systems, the Lyapunov certificate generalizes to drift conditions involving negative powers (for finite-time convergence) and positive powers (to make the settling time uniform). In stochastic systems, a generator inequality for a Lyapunov function $V$ of the form:

$$\mathcal{L}V \leq -aV^\alpha - bV^\beta,\quad 0<\alpha<1<\beta,\;a,b>0$$

is enforced almost surely or in expectation; under suitable martingale and observer error control, this yields a uniform fixed-time bound $T^* = 1/(a(1-\alpha)) + 1/(b(\beta-1))$ for the probability that the process enters the target set within $T^*$ (Black et al., 2024).

3. Robustness to Perturbations and Stochasticity

Fixed-time stability can be extended to systems with deterministic perturbations and stochastic noise. For perturbed deterministic systems $y(k+1) = F(y(k)) + g(k, y(k))$, with $|g(k, y)| \leq \delta_0$, the Lyapunov descent is modified, and fixed-time attractiveness into an invariant ball is guaranteed, with explicit bounds both on the ball radius and the maximal time to enter this ball (Tatari et al., 2022). Under suitable parameter restrictions, solutions enter a computed invariant set within a number of steps independent of the initial condition.

For stochastic discrete-time systems $y(k+1) = f(y(k)) + g(y(k))\nu(k)$ with i.i.d. zero-mean noise, a similar Lyapunov function $V$ can be employed with a generator/expectation-based condition:

$\mathbb E[V(F(y, \nu))] \leq \gamma(V(y)),$

where $\gamma(\cdot)$ has a Polyakov-type structure. This ensures that the mean hitting time (expected settling time) is uniformly bounded (Tatari et al., 2022); recent advances further provide high-probability (risk-aware) bounds with explicit probability control (Black et al., 2024).

4. Optimality, Prescribed-Time and Design Flexibility

Traditionally, the settling-time bound for fixed-time systems depended only on system parameters and not on initial state, but was often highly conservative. Recent work derives exact least upper bounds for settling time by completing the integral or recursion calculations, avoiding unnecessary conservatism (Aldana-López et al., 2018). Moreover, predefined-time or prescribed-time stability strengthens fixed-time stability by allowing the designer to set the uniform convergence time $T_c$ arbitrarily via gain rescaling of the system, achieving $\sup_{x_0}T(x_0)\leq T_c$ (Aldana-López et al., 2018, Aldana-López et al., 2019, Jiménez-Rodríguez et al., 2019). Most standard fixed-time systems can be algorithmically transformed to this strong form by explicit gain design or time-scale modifications, including bounded time-varying gains (Aldana-López et al., 2020).

The general framework is now unified: arbitrary classes of continuous- or discrete-time systems can be constructed to be fixed-time or predefined-time stable by leveraging time-scale transformations, composite Lyapunov inequalities, or operator-theoretic splitting, directly controlling and optimizing convergence rate and maximum allowable time (Tran et al., 2024, Jiménez-Rodríguez et al., 2019).

5. Extensions: Discrete-Time, Composite, and Large-Scale Systems

The fixed-time stability paradigm is applicable across a diverse set of contexts:

• Discrete-time nonlinear and stochastic systems with explicit Lyapunov-based and comparison-lemma characterizations (Tatari et al., 2022).
• Composite and interconnected systems, including singularly perturbed multi-timescale dynamics, where composite Lyapunov functions and quadratic forms are used to certify global fixed-time stability provided subsystem interaction terms are controlled; the overall settling time is then expressed in terms of subsystem and interaction coefficients (Tang et al., 2024).
• Distributed, learning, and optimization schemes, e.g., forward-backward splitting for monotone inclusions, and proximal-type algorithms for variational inequalities and generalized equations, where fixed-time stability translates into a uniform iteration bound in discrete-time schemes (Tran et al., 2024, Tran, 13 Jan 2026).

The fixed-time property is also preserved under suitable explicit Euler time-discretization, as long as the step size is sufficiently small and Lipschitz constants are controlled (Li et al., 1 Jul 2025, Tran et al., 2024, Ozaslan et al., 2024).

6. Control, Estimation, Learning, and Safety Applications

Fixed-time stability has become a key paradigm in modern control, estimation, and learning, enabling rigorous guarantees on convergence deadlines:

• Static and dynamic feedback controllers for nonlinear and linear plants that drive the state to equilibrium exactly within user-specified time even in the presence of input delays, exogenous perturbations, and measurement noise (Polyakov et al., 2023, Polyakov et al., 2022).
• Adaptive control laws and parameter estimators for safety-critical control under parametric uncertainty, guaranteeing convergence of estimates in uniform fixed-time and integration within robust control barrier function (RaCBF) frameworks (Black et al., 2020).
• Neural ODEs and deep learning architectures endowed with fixed-time convergence to target predictions, providing robustness against input perturbations and precise control over learning dynamics (Luo et al., 2024).
• Safe control via nonovershooting fixed-time safety filters enforcing state or output constraints with fixed restraint times, applicable to chain-of-integrator, nonlinear, or input-output linearizable systems (Polyakov et al., 2022).
• Large-scale problems in convex optimization, traffic assignment, and mixed variational inequalities, where fixed-time stable primal-dual or proximal-type algorithms yield practical iteration bounds independent of initialization (Tran et al., 6 Mar 2025, Tran, 13 Jan 2026, Garg et al., 2019).

7. Representative Theorems and Settling-Time Benchmarks

The following table synthesizes key fixed-time results and their explicit uniform bounds:

System (Setting)	Lyapunov / Drift Inequality	Uniform Bound Expression	Reference
CT ODE: $\dot{x}=f(x)$	$\dot{V}\le -aV^p - bV^q$	$T_{\max} = 1/(a(1-p)) + 1/(b(q-1))$	(Luo et al., 2024)
DT: $y(k+1)=F(y(k))$	$\Delta V \le -\alpha\min\{\cdots\}$	$K_{\max}$ explicit in $(\alpha, r_1,r_2)$	(Tatari et al., 2022)
Stoch. DT: $y(k+1)=f(y)+g(y)\nu(k)$	$\mathbb{E}[V(\cdot)] \le \gamma(V)$	$\mathbb{E}[K]\le K_{\max}$	(Tatari et al., 2022, Black et al., 2024)
Prescribed-time CT:	see (Jiménez-Rodríguez et al., 2019, Aldana-López et al., 2020)	Arbitrary $T_c$ through gain design	(Aldana-López et al., 2018, Jiménez-Rodríguez et al., 2019)
Forward-Backward Splitting (FBF) / Proximal	$\dot{V}\le -p_1V^{a_1}-p_2V^{a_2}$	$T^* = 1/(p_1(1-a_1))+1/(p_2(a_2-1))$	(Tran et al., 2024)

All explicit claims regarding Lyapunov drift, settling time, and extension to stochastic or perturbed systems are directly reflected in the theorems and constructions found in these sources.

---

References

• "Deterministic and Stochastic Fixed-time Stability of Discrete-time Autonomous Systems" (Tatari et al., 2022)
• "Enhancing the settling time estimation of a class of fixed-time stable systems" (Aldana-López et al., 2018)
• "Risk-Aware Fixed-Time Stabilization of Stochastic Systems under Measurement Uncertainty" (Black et al., 2024)
• "FxTS-Net: Fixed-Time Stable Learning Framework for Neural ODEs" (Luo et al., 2024)
• "Fixed-time Stabilization with a Prescribed Constant Settling Time by Static Feedback for Delay-Free and Input Delay Systems" (Polyakov et al., 2023)
• "Consistent discretization of finite/fixed-time controllers" (Polyakov et al., 2022)
• "A Lyapunov-like Characterization of Predefined-Time Stability" (Jiménez-Rodríguez et al., 2019)
• Additional references as cited throughout the article.