LQR-based optimal linear consensus algorithms

Authors:
Yongcan Cao;Wei Ren
Affiliations:
Department of Electrical and Computer Engineering, Utah State University, Logan, UT;Department of Electrical and Computer Engineering, Utah State University, Logan, UT
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 0
Cited 1

Optimal linear-consensus algorithms: an LQR perspective

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Laplacian matrices play an important role in linear consensus algorithms. This paper studies linear-quadratic regulator (LQR) based optimal linear consensus algorithms for multi-vehicle systems with single-integrator kinematics in a continuous-time setting. 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. 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 pre-specified symmetric Laplacian matrix associated with the interaction graph. Illustrative examples are given as a proof of concept.