
Abstract This paper presents a review of finite- and fixed-time convergent algorithms for dynamic systems of various dimensions and relative degrees, with or without disturbances. The review mainly focuses on finite- and fixed-time convergent algorithms, which provide explicit and easily computable upper estimates for the corresponding convergence times. The finite- and fixed-time convergent algorithms are classified according to their actions and structural properties: regulators, observers (differentiators), controllers; discontinuous and continuous, non-smooth and smooth, non-adaptive and adaptive. Some fixed-time convergent algorithms are illustrated by simulation examples displaying typical time histories of the state/estimate trajectories in each case.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 94 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 1% |
