- Title
- Distributed consensus optimization in multiagent networks with time-varying directed topologies and quantized communication
- Creator
- Li, Huaqing; Huang, Chicheng; Chen, Guo; Liao, Xiaofeng; Huang, Tingwen
- Relation
- IEEE Transactions on Cybernetics Vol. 47, Issue 8, p. 2044-2057
- Publisher Link
- http://dx.doi.org/10.1109/TCYB.2017.2681119
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2017
- Description
- This paper considers solving a class of optimization problems which are modeled as the sum of all agents' convex cost functions and each agent is only accessible to its individual function. Communication between agents in multiagent networks is assumed to be limited: each agent can only interact information with its neighbors by using time-varying communication channels with limited capacities. A technique which overcomes the limitation is to implement a quantization process to the interacted information. The quantized information is first encoded as a binary sequence at the side of each agent before sending. After the binary sequence is received by the neighboring agent, corresponding decoding scheme is utilized to resume the original information with a certain degree of error which is caused by the quantization process. With the availability of each agent's encoding states (associated with its out-channels) and decoding states (associated with its in-channels), we devise a set of distributed optimization algorithms that generate two iterative sequences, one of which converges to the optimal solution and the other of which reaches to the optimal value. We prove that if the parameters satisfy some mild conditions, the quantization errors are bounded and the consensus optimization can be achieved. How to minimize the number of quantization level of each connected communication channel in fixed networks is also explored thoroughly. It is found that, by properly choosing system parameters, one bit information exchange suffices to ensure consensus optimization. Finally, we present two numerical simulation experiments to illustrate the efficacy of the algorithms as well as to validate the theoretical findings.
- Subject
- quantization (signal); algorithm design and analysis; network topology; topology; linear programming; cost function
- Identifier
- http://hdl.handle.net/1959.13/1397143
- Identifier
- uon:34193
- Identifier
- ISSN:2168-2267
- Language
- eng
- Reviewed
- Hits: 2104
- Visitors: 2226
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|