4.6 Article Proceedings Paper

Finite- and fixed-time convergent algorithms: Design and convergence time estimation

Journal

ANNUAL REVIEWS IN CONTROL
Volume 48, Issue -, Pages 209-221

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.arcontrol.2019.05.007

Keywords

Finite- and fixed-time convergence; Settling time estimation; Control and observer design

Funding

  1. Mexican National Science and Technology Council (CONACyT) [250611]

Ask authors/readers for more resources

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. (C) 2019 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available