期刊
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS
卷 70, 期 3, 页码 1350-1360出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSI.2022.3226578
关键词
Distributed optimization; multi-agent systems; differential privacy; bipartite consensus; signed graph
This paper addresses the privacy-preserving distributed optimization problem for a class of cooperative-competitive multi-agent systems. By utilizing signed graph theory and gauge transformation technique, a novel privacy-preserving distributed optimization algorithm is proposed to tackle the issues of information leakage and cooperative-competitive relationships.
This paper is concerned with the privacy-preserving distributed optimization problem for a class of cooperative-competitive multi-agent systems. Each agent only knows its own local objective function and interacts the state information with neighbors through a communication network. By means of the signed graph theory, the antagonistic interactions among agents are considered to characterize both the cooperative and the competitive relationships. With the help of the gauge transformation technique, a structurally balanced undirected signed graph is firstly transformed into a standard undirected graph. Then, the distributed optimization problem subject to signed network is converted into the traditional distributed optimization problem. Subsequently, a novel privacy-preserving distributed optimization algorithm is put forward to 1) minimize the sum of local objective functions; 2) achieve the bipartite consensus for all agents; and 3) avoid the information leakage caused by message exchange among agents, simultaneously. Finally, a simulation example is given to verify the effectiveness of the proposed optimization algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据