Distributed Quantized Optimization Design of Continuous-Time Multiagent Systems Over Switching Graphs

Distributed optimization of high‐order nonlinear multi‐agent systems with disturbance under switching topologies

“…Above phenomenon can cause switching graphs of MASs. For adapting to such problems, the distributed optimization of MASs under switching graphs was investigated in literatures, [13][14][15] where the switching graphs element of matrix Q. Diagonal matrix is represented by P = diag{p 1 , p 2 , … , p N } ∈ R N×N , where p i ∈ R. Notation 1 N ∈ R N represent N-dimension column vector which all elements are 1, and notation 0 N ∈ R N represent N-dimension column vector which all elements are 0. Notations I N ∈ R N×N and 0 N ∈ R N×N denotes N × N-dimension identity matrix and N × N-dimension null matrix, respectively.…”

“…Based on the background mentioned above, researchers conducted many distributed optimization algorithms. [9][10][11][12][13][14][15][16][17] The authors of results 9,10 proposed distributed discrete-time optimization algorithms for MASs under fixed undirected/directed graphs. Technically, as MASs can be formulated as continuous-time model, then the continuous-time distributed optimization problems were investigated as well.…”

“…Based on the background mentioned above, researchers conducted many distributed optimization algorithms 9‐17 . The authors of results 9,10 proposed distributed discrete‐time optimization algorithms for MASs under fixed undirected/directed graphs.…”

Distributed Nash Equilibrium Seeking under Quantization Communication

“…This quantization operation overcomes the communication constraint and significantly reduces the storage consumption (Rabbat & Nowak, 2005;Nedić, Olshevsky, Ozdaglar, & Tsitsiklis, 2008). Hence, quantization scheme has been widely studied in distributed consensus and distributed optimization problems recently (Yi & Hong, 2014;Li, Liu, Soh, & Xie, 2017;Ma, Ji, Sun, & Feng, 2018;Lei, Yi, Shi, & Anderson, 2020;Chen & Ji, 2020). Generally speaking, the related quantization works mainly focus on the following three problems: i) How can it ensure convergence even with inexact iterations throughout the distributed and quantized algorithm?…”

“…It is still a centralized method in essence. Thus, in this paper, we take a step from our previous works on distributed NE seeking problem (Liang, Yi, & Hong, 2017) and distributed and quantized cooperative problems (Ma et al, 2018;Chen & Ji, 2020) toward distributed NE seeking with quantization.…”