Metraipolis › archive › dc_39a47e0dc3ff

Abstract homogeneous chains: a Lyapunov framework for high-order sliding modes in multi-agent systems — arXiv:2609.12250

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12250
License (as archived)
CC0-1.0
Archived
2026-10-16T04:27:51.828Z
SHA-256 of the archived text
b60ac7e625b217e138de1e766beb1433fa71b16c287dc5576043acd8186c19e1
Stable URL of this page
https://metraipolis.com/documento/dc_39a47e0dc3ff

How to cite

Abstract homogeneous chains: a Lyapunov framework for high-order sliding modes in multi-agent systems — arXiv:2609.12250 — arXiv (en), https://arxiv.org/abs/2609.12250 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_39a47e0dc3ff (Metraipolis archive dc_39a47e0dc3ff, sha256 b60ac7e625b217e138de1e766beb1433fa71b16c287dc5576043acd8186c19e1)
BibTeX
@misc{dc39a47e0dc3ff,
  title = {Abstract homogeneous chains: a Lyapunov framework for high-order sliding modes in multi-agent systems — arXiv:2609.12250},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12250},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_39a47e0dc3ff; sha256 b60ac7e625b217e138de1e766beb1433fa71b16c287dc5576043acd8186c19e1},
  year = {2026}
}

Archived text

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

This work develops a Lyapunov framework for a broad class of arbitrary-order sliding-mode algorithms in multi-agent systems. We introduce abstract homogeneous chains, a class of nonlinear error systems characterized by common convexity and homogeneity properties. For this class, we establish global finite-time stability for arbitrary order, construct a homogeneous Lyapunov function, and derive a recursive optimization-based gain-proposal procedure. The framework addresses several gaps in existing dynamic average consensus and distributed differentiation results: it provides a recursive numerical optimization-based gain-proposal procedure for EDCHO at arbitrary order, extends REDCHO convergence from local to global, and provides arbitrary-order numerical gain-proposal rules for leader-follower distributed differentiation, previously available only at first order. It also provides a new arbitrary-order observer for multi-leader affine formation tracking with global finite-time convergence.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-14 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.12250 — 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-16T04:21:20.137Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).