Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the design of new classes of fixed-time stable systems with predefined upper bound for the settling time

Published 9 Jan 2019 in math.OC, cs.SY, and eess.SY | (1901.02782v4)

Abstract: This paper aims to provide a methodology for generating autonomous and non-autonomous systems with a fixed-time stable equilibrium point where an Upper Bound of the Settling Time (UBST) is set a priori as a parameter of the system. In addition, some conditions for such an upper bound to be the least one are provided. This construction procedure is a relevant contribution when compared with traditional methodologies for generating fixed-time algorithms satisfying time constraints since current estimates of an UBST may be too conservative. The proposed methodology is based on time-scale transformations and Lyapunov analysis. It allows the presentation of a broad class of fixed-time stable systems with predefined UBST, placing them under a common framework with existing methods using time-varying gains. To illustrate the effectiveness of our approach, we generate novel, autonomous and non-autonomous, fixed-time stable algorithms with predefined least UBST.

Citations (44)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.