A predefined-time first-order exact differentiator based on time-varying gains

Abstract

Recently, a first-order differentiator based on time-varying gains was introduced in the literature, in its non recursive form, for a class of differentiable signals y(t), satisfying |y(t)|≤ L(t-t0), for a known function L(t-t0), such that 1L(t-t0)|d L(t-t0)dt|≤ M with a known constant M. It has been shown that such differentiator is globally finite-time convergent. In this paper, we redesign such an algorithm, using time base generators (a class of time-varying gains), to obtain a differentiator algorithm for the same class of signals, with guaranteed convergence before a desired time, i.e., with fixed-time convergence with an a priori user-defined upper bound for the settling time. Thus, our approach can be applied for scenarios under time-constraints. We present numerical examples exposing the contribution with respect to state-of-the-art algorithms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…