Accelerated distributed online aggregative optimization over unbalanced digraphs
Transactions of the Institute of Measurement and Control · 03.07.2026
DOI: 10.1177/01423312261460541 ↗Kurz gefasst
Fachartikel in der Zeitschrift Transactions of the Institute of Measurement and Control, online erschienen am 03.07.2026. Verfasst von Jiahui Fang. Die Arbeit nennt 20 Literaturangaben.
Abstract (Originalsprache)
This paper investigates online distributed aggregative optimization of multi-agent systems over directed graphs characterized by row-stochastic mixing matrices, where each agent possesses a time-varying cost function determined by its individual decision variable and a global aggregative variable. To address this problem, we first propose a novel accelerated distributed algorithm incorporating gradient tracking and dynamic consensus mechanisms. Then, the designed algorithm integrates heavy-ball momentum to enhance convergence speed, and the linear convergence rate is rigorously analyzed as well. Finally, the theoretical results are validated in the multi-robot target tracking scenarios to show the effectiveness of the algorithm.
Zitieren
APA
Fang, J. (2026). Accelerated distributed online aggregative optimization over unbalanced digraphs. Transactions of the Institute of Measurement and Control. https://doi.org/10.1177/01423312261460541
Vancouver
Fang J. Accelerated distributed online aggregative optimization over unbalanced digraphs. Transactions of the Institute of Measurement and Control. 2026. doi:10.1177/01423312261460541
BibTeX
@article{Fang2026,
author = {Fang, Jiahui},
title = {Accelerated distributed online aggregative optimization over unbalanced digraphs},
journal = {Transactions of the Institute of Measurement and Control},
year = {2026},
doi = {10.1177/01423312261460541}
}
EUVIMED