Optimal linear-consensus algorithms: an LQR perspective

Authors:
Yongcan Cao;Wei Ren
Affiliations:
Electrical and Computer Engineering Department, Utah State University, Logan, UT;Electrical and Computer Engineering Department, Utah State University, Logan, UT
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Year:
2010

Citing 3
Cited 1

Matrix analysis

Matrix analysis
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
LQR-based optimal linear consensus algorithms

ACC'09 Proceedings of the 2009 conference on American Control Conference

Brief paper: Optimal distributed linear averaging

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Laplacian matrices play an important role in linear-consensus algorithms. This paper studies optimal linear-consensus algorithms for multivehicle systems with single-integrator dynamics in both continuous-time and discrete-time settings. We propose two global cost functions, namely, interaction-free and interaction-related cost functions. With the interaction-free cost function, we derive the optimal (nonsymmetric) Laplacian matrix by using a linear-quadratic-regulator-based method in both continuous-time and discrete-time settings. It is shown that the optimal (nonsymmetric) Laplacian matrix corresponds to a complete directed graph. In addition, we show that any symmetric Laplacian matrix is inverse optimal with respect to a properly chosen cost function. With the interaction-related cost function, we derive the optimal scaling factor for a prespecified symmetric Laplacian matrix associated with the interaction graph in both continuous-time and discrete-time settings. Illustrative examples are given as a proof of concept.