Finite-time convergent discrete-time algorithms: from explicit to backward schemes - TRIPOP Access content directly
Preprints, Working Papers, ... Year : 2024

Finite-time convergent discrete-time algorithms: from explicit to backward schemes

Abstract

Many continuous-time control laws are shown to achieve finite-time convergence. However, when discretized, such property is, most of the times, lost. In this article we study the conditions guaranteeing the finite-time convergence of discrete-time mappings and also investigate the cases when such maps can be interpreted as the backward-Euler discretization of system with a maximal monotone right-hand side. Finite-time stability is characterized. Many examples illustrate the theoretical developments.
Fichier principal
Vignette du fichier
explicit_to_implicit.pdf (496.06 Ko) Télécharger le fichier
Origin Files produced by the author(s)
licence

Dates and versions

hal-04516369 , version 1 (22-03-2024)
hal-04516369 , version 2 (12-07-2024)

Licence

Identifiers

  • HAL Id : hal-04516369 , version 1

Cite

Félix Miranda-Villatoro, Fernando Castaños, Bernard Brogliato. Finite-time convergent discrete-time algorithms: from explicit to backward schemes. 2024. ⟨hal-04516369v1⟩
46 View
82 Download

Share

Gmail Mastodon Facebook X LinkedIn More