Process-Based Triggering and Accelerated Dual Averaging Algorithm for Dynamic Parameter Estimation

In the large-scale cyber-physical systems, to conserve communication resources holds critical significance, thereby driving extensive research interest toward distributed optimization algorithms with high communication efficiency. This paper investigates the constrained distributed dynamic parameter estimation problem (CDPE) for communication resource conservation, and further considers how to cope with more generally directed communication structure, unavoidable arbitrary bounded communication delays, and diverse update strategies. We introduce a new process-based triggering strategy and develop an efficient Process-based Triggering Accelerated Dual Averaging Algorithm(PTADA). Compared with the traditional time-dependent threshold, the PTADA can well adapt to the dynamic behavior of distributed optimization and save communication resources. Our dynamic bound is linear and is independent of the explicit time horizon. Moreover, we further extend PTADA to address scenarios where gradient information cannot be directly obtained, while ensuring no performance degradation. This extension can make the algorithm more realistic and universal. Finally, a distributed multi-sensor network is set up to verify the effectiveness of the algorithm.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal and Information Processing over Networks
Published
2025-01-01
DOI
https://doi.org/10.1109/tsipn.2025.3587414
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Process-Based Triggering and Accelerated Dual Averaging Algorithm for Dynamic Parameter Estimation

Gang Chen, Zhenghua Chen, Yaoyao Zhou
IEEE Transactions on Signal and Information Processing over Networks
Control Systems and Identification
article

Process-Based Triggering and Accelerated Dual Averaging Algorithm for Dynamic Parameter Estimation

Gang Chen, Zhenghua Chen, Yaoyao Zhou
article en

Abstract

In the large-scale cyber-physical systems, to conserve communication resources holds critical significance, thereby driving extensive research interest toward distributed optimization algorithms with high communication efficiency. This paper investigates the constrained distributed dynamic parameter estimation problem (CDPE) for communication resource conservation, and further considers how to cope with more generally directed communication structure, unavoidable arbitrary bounded communication delays, and diverse update strategies. We introduce a new process-based triggering strategy and develop an efficient Process-based Triggering Accelerated Dual Averaging Algorithm(PTADA). Compared with the traditional time-dependent threshold, the PTADA can well adapt to the dynamic behavior of distributed optimization and save communication resources. Our dynamic bound is linear and is independent of the explicit time horizon. Moreover, we further extend PTADA to address scenarios where gradient information cannot be directly obtained, while ensuring no performance degradation. This extension can make the algorithm more realistic and universal. Finally, a distributed multi-sensor network is set up to verify the effectiveness of the algorithm.

IEEE Transactions on Signal and Information Processing over NetworksVol. 11
Agency for Science, Technology and Research (SG), Chongqing University (CN), Institute for Infocomm Research (SG)
Openalex Percentile: Top 80%
Control Systems and Identification
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.