On inherent limitations in robustness and performance for a class of prescribed-time algorithms

Prescribed-time algorithms based on time-varying gains may have remarkable properties, such as regulation in a user-prescribed finite time that is the same for every nonzero initial condition and that holds even under matched disturbances. However, at the same time, such algorithms are known to lack...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 2023-12, Vol.158, p.111284, Article 111284
Main Authors: Aldana-López, Rodrigo, Seeber, Richard, Haimovich, Hernan, Gómez-Gutiérrez, David
Format: Article
Language:English
Subjects:
Prescribed-time controllers
Prescribed-time differentiators
Prescribed-time observers
Robustness analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Prescribed-time algorithms based on time-varying gains may have remarkable properties, such as regulation in a user-prescribed finite time that is the same for every nonzero initial condition and that holds even under matched disturbances. However, at the same time, such algorithms are known to lack robustness to measurement noise. This note shows that the lack of robustness of a class of prescribed-time algorithms is of an extreme form. Specifically, we show the existence of arbitrarily small measurement noises causing considerable deviations, divergence, and other detrimental consequences. We also discuss some drawbacks and trade-offs of existing workarounds as motivation for further analysis.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2023.111284