Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2004 | public
Report Open

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

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.

Files

techreport.pdf
Files (146.5 kB)
Name Size Download all
md5:5f1947bec71279fab0613cd53aa3bb61
146.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024