Privacy-Preserving Average Consensus Algorithm Under Round-Robin Scheduling Protocol  

作　　者：Yingjiang Guo Wenying Xu Haodong Wang Jianquan Lu Shengli Du 

机构地区：[1]the School of Mathematics,Southeast University,Nanjing 21189,China [2]the School of Electronic Information and Electrical Engineering,Chengdu University,Chengdu 610106,Chengdu 610106,China [3]the School of Artificial Intelligence and Automation,Beijing University of Technology,Beijing 100124 [4]the Engineering Research Center of Intelligent Perception and Autonomous Control,Ministry of Education,Beijing 100124,China

出　　处：《IEEE/CAA Journal of Automatica Sinica》2024年第7期1705-1707,共3页自动化学报（英文版）

基　　金：supported in part by the National Natural Science Foundation of China(62173087);the Fundamental Research Funds for the Central Universities;the Alexander von Humboldt Foundation of Germany。

摘　　要：Dear Editor,Over the past decades,cooperative control and distributed optimization have gained significant research attention due to their broad applications such as signal processing,robotics,and social networks[1],[2].As a fundamental component of distributed control and optimization,the issue of average consensus has become a recurring topic of interest[3],[4].

关 键 词：OPTIMIZATION ROUND Robin 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]