Metraipolis › archive › dc_f36d461a28a5

Fixed-Time ISS for Interconnected Discrete-Time Systems, Part II: Finite-Horizon Lyapunov Functions — arXiv:2610.00660

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00660
License (as archived)
CC0-1.0
Archived
2026-10-06T16:00:24.482Z
SHA-256 of the archived text
4d673115d648d3a830316b309c90eaa6f2b6ffc18cd1eb9001bd138387bc0aff
Stable URL of this page
https://metraipolis.com/documento/dc_f36d461a28a5

How to cite

Fixed-Time ISS for Interconnected Discrete-Time Systems, Part II: Finite-Horizon Lyapunov Functions — arXiv:2610.00660 — arXiv (en), https://arxiv.org/abs/2610.00660 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f36d461a28a5 (Metraipolis archive dc_f36d461a28a5, sha256 4d673115d648d3a830316b309c90eaa6f2b6ffc18cd1eb9001bd138387bc0aff)
BibTeX
@misc{dcf36d461a28a5,
  title = {Fixed-Time ISS for Interconnected Discrete-Time Systems, Part II: Finite-Horizon Lyapunov Functions — arXiv:2610.00660},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00660},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f36d461a28a5; sha256 4d673115d648d3a830316b309c90eaa6f2b6ffc18cd1eb9001bd138387bc0aff},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00660. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study fixed-time input-to-state stability (FxT-ISS) for discrete-time systems subject to exogenous inputs using finite-horizon Lyapunov functions. In the proposed Lyapunov- based characterization, the effect of the initial condition is eliminated after a uniformly bounded number of iterations. This characterization encompasses existing extinction-based Lyapunov conditions while allowing more general finite-memory mechanisms. Building on this framework, we establish a finite-horizon small-gain theorem for interconnected discrete-time systems, providing conditions under which FxT-ISS is preserved under feedback interconnections. The proposed framework is illustrated through examples arising in distributed algorithms, optimization, and feedback optimization.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.00660 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:14:57.943Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).