Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 60, Issue 7, Pages 2004-2009Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2014.2365686
Keywords
Alternating direction method of multipliers; distributed algorithms; model predictive control; network flows
Funding
- Fundacao para a Ciencia e Tecnologia [CMU-PT/SIA/0026/2009, PEst-OE/EEI/LA0009/2011, SFRH/BD/33520/2008]
- Fundação para a Ciência e a Tecnologia [SFRH/BD/33520/2008] Funding Source: FCT
Ask authors/readers for more resources
We consider a network where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorithm that finds a vector x(star) minimizing the sum of all the functions. We make the additional assumption that the functions have intersecting local domains, i.e., each function depends only on some components of the variable. Consequently, each node is interested in knowing only some components of x(star), not the entire vector. This allows improving communication-efficiency. We apply our algorithm to distributed model predictive control (D-MPC) and to network flow problems and show, through experiments on large networks, that the proposed algorithm requires less communications to converge than prior state-of-the-art algorithms.
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