A Sub-optimal Algorithm to Synthesize Control Laws for a Network of Dynamic Agents

Gupta, Vijay and Hassibi, Babak and Murray, Richard M. (2004) A Sub-optimal Algorithm to Synthesize Control Laws for a Network of Dynamic Agents. Technical Report. California Institute of Technology, Pasadena, USA. [CaltechCDSTR:2004.006]

Full text available as:

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

We study the synthesis problem of an LQR controller when the matrix describing the control law is constrained to lie in a particular vector space. Our motivation is the use of such control laws to stabilize networks of autonomous agents in a decentralized fashion; with the information flow being dictated by the constraints of a pre-specified topology. In this paper, we consider the finite-horizon version of the problem and provide both a computationally intensive optimal solution and a sub-optimal solution that is computationally more tractable. Then we apply the technique to the decentralized vehicle formation control problem and show that the loss in performance due to the use of the sub-optimal solution is not huge; however the topology can have a large effect on performance.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	47
Deposited By:	Vijay Gupta
Deposited On:	30 August 2004
Unique Identifier:	CaltechCDSTR:2004.006
Official Persistent URL:	http://resolver.caltech.edu/CaltechCDSTR:2004.006
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record