Metraipolis › archive › dc_529e5eb0f491
Predefined-Time Leaderless Consensus Under Denial-of-Service Attacks — arXiv:2609.11781
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11781
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T07:13:45.276Z
- SHA-256 of the archived text
b7cb6bd1428b20fe793936d0ce3463011a1dda1afcb01aac1c352f9a11f847c6- Stable URL of this page
https://metraipolis.com/documento/dc_529e5eb0f491
How to cite
Predefined-Time Leaderless Consensus Under Denial-of-Service Attacks — arXiv:2609.11781 — arXiv (en), https://arxiv.org/abs/2609.11781 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_529e5eb0f491 (Metraipolis archive dc_529e5eb0f491, sha256 b7cb6bd1428b20fe793936d0ce3463011a1dda1afcb01aac1c352f9a11f847c6)
BibTeX
@misc{dc529e5eb0f491,
title = {Predefined-Time Leaderless Consensus Under Denial-of-Service Attacks — arXiv:2609.11781},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11781},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_529e5eb0f491; sha256 b7cb6bd1428b20fe793936d0ce3463011a1dda1afcb01aac1c352f9a11f847c6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11781. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper addresses predefined-time resilient consensus of leaderless second-order nonlinear multi-agent systems under denial-of-service (DoS) attacks, motivated by coordination requirements in safety-critical applications. The agents are subject to bounded external disturbances and communicate over a strongly connected directed graph whose links are simultaneously disabled during attacks. We develop a switching sliding-mode protocol with the objective of reaching an invariant manifold of position and velocity agreement. The protocol uses relative position and velocity information during attack-free intervals and local velocity feedback during communication blackouts. A time-scaling function remains constant during each blackout and resumes evolving when communication is restored, accounting for the time available for consensus. Under bounds on attack duration and frequency, we derive sufficient gain conditions through a Lyapunov analysis. We show that, despite bounded disturbances, the agents achieve position and velocity consensus by a realistic settling time equal to a prescribed convergence duration plus the cumulative attack duration up to the realistic settling time. The prescribed convergence duration is independent of the initial conditions, and the realistic settling time reduces to that duration in the absence of attacks. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-11 in eess.SY). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.11781 — 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-16T06:56:38.775Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).