Enhancing the settling time estimation of a class of fixed-time stable systems
arXiv:1809.07012 · doi:10.1002/rnc.4600
Abstract
This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is fourfold. First, we revisit the well-known class of fixed-time stable systems, given in (Polyakov et al.,2012}, while showing the conservatism of the classical upper estimate of the settling time. Second, we provide the smallest constant that uniformly upper bounds the settling time of any trajectory of the system under consideration. Third, introducing a slight modification of the previous class of fixed-time systems, we propose a new predefined-time convergent algorithm where the least upper bound of the settling time is set a priori as a parameter of the system. At last, predefined-time controllers for first order and second order systems are introduced. Some simulation results highlight the performance of the proposed scheme in terms of settling time estimation compared to existing methods.
References in corpus (2)
Cited by in corpus (8)
- On the design of new classes of fixed-time stable systems with predefined upper bound for the settling time
- On the design of non-autonomous fixed-time controllers with a predefined upper bound of the settling time
- A class of robust consensus algorithms with predefined-time convergence under switching topologies
- Designing predefined-time differentiators with bounded time-varying gains
- On predefined-time consensus protocols for dynamic networks
- Autonomous and non-autonomous fixed-time leader-follower consensus for second-order multi-agent systems
- A predefined-time first-order exact differentiator based on time-varying gains
- Designing controllers with predefined convergence-time bound using bounded time-varying gains