Privacy-Preserved Distributed Optimization for Multi-Agent Systems With Antagonistic Interactions

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on circuits and systems. I, Regular papers Ročník 70; číslo 3; s. 1350 - 1360
Hlavní autori: Luo, Qi, Liu, Shuai, Wang, Licheng, Tian, Engang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
bipartite consensus
differential privacy
Distributed optimization
Graph theory
Linear programming
Multi-agent systems
Multiagent systems
Optimization
Optimization algorithms
Performance analysis
Privacy
signed graph
ISSN:1549-8328, 1558-0806
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1549-8328
1558-0806
DOI:10.1109/TCSI.2022.3226578