Finite-time convergent discrete-time algorithms: from explicit to backward schemes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

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

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC - Paternité - Pas d'utilisation commerciale

Dates et versions

hal-04516369 , version 1 (22-03-2024)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

  • HAL Id : hal-04516369 , version 1

Citer

Félix Miranda-Villatoro, Fernando Castaños, Bernard Brogliato. Finite-time convergent discrete-time algorithms: from explicit to backward schemes. 2024. ⟨hal-04516369⟩
1 Consultations
5 Téléchargements

Partager

Gmail Facebook X LinkedIn More