Resilient Collision-Avoidance Distributed Optimal Coordination Strategy for Euler–Lagrangian Systems Subjected to Asynchronous DoS Attacks

This article is concerned with the resilient collision-avoidance distributed optimal coordination (DOC) problem for Euler–Lagrangian systems under asynchronous denial-of-service (DoS) attacks. In an adversarial network environment, it is assumed that attackers can asynchronously launch DoS attacks on any communication channel between agents. To address this issue, a novel resilient collision-avoidance DOC strategy based on barrier functions is proposed, consisting of a decision-layer coordinator and a physical-layer tracking controller. The coordinator generates collision-avoidance optimal consensus commands based on the real-time states of the agents, while the tracking controller achieves collision-avoidance DOC by tracking these command signals, even under asynchronous DoS attacks. Furthermore, the gain parameter of the coordinator is determined through a fully distributed estimation algorithm. Unlike existing methods, the analytical form of the global objective function is no longer required. Finally, the effectiveness of the proposed strategy is demonstrated through a simulation example.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Industrial Informatics
Published
2025-06-11
DOI
https://doi.org/10.1109/tii.2025.3574441
Citations
1
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resilient Collision-Avoidance Distributed Optimal Coordination Strategy for Euler–Lagrangian Systems Subjected to Asynchronous DoS Attacks

Guang‐Hong Yang, Huimin Wang, Jiayuan Yin
1 citations
IEEE Transactions on Industrial Informatics
Distributed Control Multi-Agent Systems
1.49
article

Resilient Collision-Avoidance Distributed Optimal Coordination Strategy for Euler–Lagrangian Systems Subjected to Asynchronous DoS Attacks

Guang‐Hong Yang, Huimin Wang, Jiayuan Yin
article en
1 citations

Abstract

This article is concerned with the resilient collision-avoidance distributed optimal coordination (DOC) problem for Euler–Lagrangian systems under asynchronous denial-of-service (DoS) attacks. In an adversarial network environment, it is assumed that attackers can asynchronously launch DoS attacks on any communication channel between agents. To address this issue, a novel resilient collision-avoidance DOC strategy based on barrier functions is proposed, consisting of a decision-layer coordinator and a physical-layer tracking controller. The coordinator generates collision-avoidance optimal consensus commands based on the real-time states of the agents, while the tracking controller achieves collision-avoidance DOC by tracking these command signals, even under asynchronous DoS attacks. Furthermore, the gain parameter of the coordinator is determined through a fully distributed estimation algorithm. Unlike existing methods, the analytical form of the global objective function is no longer required. Finally, the effectiveness of the proposed strategy is demonstrated through a simulation example.

IEEE Transactions on Industrial InformaticsVol. 21(9)
State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Liaoning Province, Fundamental Research Funds for the Central Universities
Climate action
Openalex Percentile: Top 16%
Distributed Control Multi-Agent Systems
1.49
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.