Multi-Agent Consensus with Improved Minimum Inter-Event Times

In this paper, the consensus problem is studied for linear multi-agent systems on undirected graphs. Based on relative output feedback, we propose a distributed protocol for each agent to achieve consensus without continuous communication among agents. Time- and event-triggered sampling mechanisms with event separation properties are designed for different signals and are guaranteed to have a positive minimum inter-event time. Compared with existing results, the clock variable in the event-triggering mechanism is not restricted to be monotonically decreasing but has the potential to increase, thus improving inter-event times. Moreover, different from [1], the two sampling mechanisms in this paper are decoupled, providing more design convenience. Finally, the theoretical results are demonstrated and verified by numerical simulations.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11186926
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Agent Consensus with Improved Minimum Inter-Event Times

Xianwei Li, Sikang Zhan, Ruchao Su
Distributed systems and fault tolerance
article

Multi-Agent Consensus with Improved Minimum Inter-Event Times

Xianwei Li, Sikang Zhan, Ruchao Su
article en

Abstract

In this paper, the consensus problem is studied for linear multi-agent systems on undirected graphs. Based on relative output feedback, we propose a distributed protocol for each agent to achieve consensus without continuous communication among agents. Time- and event-triggered sampling mechanisms with event separation properties are designed for different signals and are guaranteed to have a positive minimum inter-event time. Compared with existing results, the clock variable in the event-triggering mechanism is not restricted to be monotonically decreasing but has the potential to increase, thus improving inter-event times. Moreover, different from [1], the two sampling mechanisms in this paper are decoupled, providing more design convenience. Finally, the theoretical results are demonstrated and verified by numerical simulations.

Shanghai Jiao Tong University (CN)
Openalex Percentile: Top 66%
Distributed systems and fault tolerance
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.