LQR-type distributed linear iterative averaging strategies

A new LQR-type optimal distributed linear averaging (ODLA) problem is presented in this paper. This problem is motivated from the distributed averaging problem which arises in the context of distributed algorithms in computer science and coordination of groups of autonomous agents in engineering. The aim of the ODLA problem is to compute the average of the initial values at nodes of a graph through an LQR-type optimal distributed algorithm in which the nodes in the graph can only communicate with their neighbors. Optimality is given by a minimization problem of an LQR-type quadratic cost functional under finite horizon. We show that this problem has a very close relationship with the notion of semistability. By developing new necessary and sufficient conditions for semistability of linear discrete-time systems, we convert the original ODLA problem into two equivalent optimization problems. One of them is a convex optimization problem and can be solved by using semidefinite programming methods.