Event-Triggered Resilient Consensus of Second-Order Multiagent Networks via Trusted Neighbors

In this brief, we consider the resilient consensus problem of multiagent networks with second-order integrators in the presence of adversarial agents. A novel event-triggered trusted-neighbor subsequence reduction (E-TSR) algorithm is proposed without the {f} -total/local model assumption. To preve...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2024-05, Vol.71 (5), p.2689-2693
Main Authors: Zhang, Peng, Luo, Ziming, Wu, Sentang
Format: Article
Language:English
Subjects:
Algorithms
event-triggered communication
Filtering algorithms
Graph theory
Heuristic algorithms
Multiagent networks
Multiagent systems
Network topology
Pollution
resilient consensus
Robustness
Safety
Topology
trusted neighbors
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this brief, we consider the resilient consensus problem of multiagent networks with second-order integrators in the presence of adversarial agents. A novel event-triggered trusted-neighbor subsequence reduction (E-TSR) algorithm is proposed without the {f} -total/local model assumption. To prevent data pollution, agents filter out any information received from beyond a dynamically determined trusted region established by neighboring trusted agents. Under the event-triggered method, agents make transmissions to neighbors only when necessary in the sense that their values have sufficiently changed since their last transmissions. A necessary and sufficient graph-theoretic condition is obtained to achieve resilient consensus.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2023.3348114