Distributed Dynamic Event-triggered Optimization Algorithm for MASs Subject to Cyber Attacks and Its Applications*

In this paper, the distributed optimization problem (DOP) for multi-agent systems (MASs) is addressed. Unlike the existing results, the present problem faces with some demands, named, the existence of persistent cyber attacks on communication edges, the discrete communication among agents and some devices. To solve such an optimization problem while satisfying the mentioned demands, a distributed dynamic event-triggered optimization algorithm is proposed. Only the information at the triggering time instants is used in the algorithm. Under assumptions on the local functions, the communication graph and attacks, sufficient conditions for the exponentially convergence of the proposed algorithm are derived. It is also proved that the Zeno-behavior is excluded for the triggering time sequences. Finally, the proposed algorithm is applied to the economic dispatch problem to illustrate and validate the efficiency of it.

Institutions

Publication Details

Published
2025-05-17
DOI
https://doi.org/10.1109/yac66630.2025.11150342
Primary Topic
Patient Satisfaction in Healthcare
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Dynamic Event-triggered Optimization Algorithm for MASs Subject to Cyber Attacks and Its Applications*

Patient Satisfaction in Healthcare
article

Distributed Dynamic Event-triggered Optimization Algorithm for MASs Subject to Cyber Attacks and Its Applications*

article en

Abstract

In this paper, the distributed optimization problem (DOP) for multi-agent systems (MASs) is addressed. Unlike the existing results, the present problem faces with some demands, named, the existence of persistent cyber attacks on communication edges, the discrete communication among agents and some devices. To solve such an optimization problem while satisfying the mentioned demands, a distributed dynamic event-triggered optimization algorithm is proposed. Only the information at the triggering time instants is used in the algorithm. Under assumptions on the local functions, the communication graph and attacks, sufficient conditions for the exponentially convergence of the proposed algorithm are derived. It is also proved that the Zeno-behavior is excluded for the triggering time sequences. Finally, the proposed algorithm is applied to the economic dispatch problem to illustrate and validate the efficiency of it.

Beijing Institute of Technology (CN)
Openalex Percentile: Top 33%
Patient Satisfaction in Healthcare
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.