Journal
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Volume 48, Issue 11, Pages 1908-1919Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2017.2694323
Keywords
Consensus; convergence rate; distributed convex optimization; event-triggered communication; limited data rate; multiagent systems
Funding
- Fundamental Research Funds for the Central Universities [XDJK2016B016]
- Qilu Youth Scholar Discipline Construction Funding from Shandong University
- Natural Science Foundation of China [61403314, 61573220, 61633014]
- Republic of Singapore National Research Foundation through the Berkeley Education Alliance for Research in Singapore
- Republic of Singapore National Research Foundation [NRF2011NRF-CRP001-090, NRF2013EWT-EIRP004-012]
Ask authors/readers for more resources
This paper is concerned with solving a large category of convex optimization problems using a group of agents, each only being accessible to its individual convex cost function. The optimization problems are modeled as minimizing the sum of all the agents' cost functions. The communication process between agents is described by a sequence of time-varying yet balanced directed graphs which are assumed to be uniformly strongly connected. Taking into account the fact that the communication channel bandwidth is limited, for each agent we introduce a vector-valued quantizer with finite quantization levels to preprocess the information to be exchanged. We exploit an event-triggered broadcasting technique to guide information exchange, further reducing the communication cost of the network. By jointly designing the dynamic event-triggered encoding-decoding schemes and the event-triggered sampling rules (to analytically determine the sampling time instant sequence for each agent), a distributed subgradient descent algorithm with constrained information exchange is proposed. By selecting the appropriate quantization levels, all the agents' states asymptotically converge to a consensus value which is also the optimal solution to the optimization problem, without committing saturation of all the quantizers. We find that one bit of information exchange across each connected channel can guarantee that the optimiztion problem can be exactly solved. Theoretical analysis shows that the event-triggered subgradient descent algorithm with constrained data rate of networks converges at the rate of O(ln t/root t). We supply a numerical simulation experiment to demonstrate the effectiveness of the proposed algorithm and to validate the correctness of theoretical results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available