Separable problems in optimal cooperative control of networked systems

Placeholder Show Content

Abstract/Contents

Abstract
This thesis characterizes a class of separable optimal cooperative control problems. We show that a simple factorization condition provides a unified technique that allows the problem to separate into several independent subproblems. The technique generalizes many of the previously known computational approaches and further enables us to solve a new class of previously unsolvable problems. The optimal solutions are computed explicitly in a distributed fashion via a series of Riccati equations whose size grows linearly with the problem size, therefore the optimal cooperative control can be easily computed via standard techniques for conventional optimal control problems. Furthermore, the separated problems provide a better understanding of the dynamics of the optimal controller. We illustrate two application examples including a salvo guidance problem and a network design problem for a team of networked missiles.

Description

Type of resource text
Form electronic; electronic resource; remote
Extent 1 online resource.
Publication date 2012
Issuance monographic
Language English

Creators/Contributors

Associated with Kim, Jong-Han
Associated with Stanford University, Department of Aeronautics and Astronautics
Primary advisor Lall, Sanjay
Thesis advisor Lall, Sanjay
Thesis advisor Boyd, Stephen P
Thesis advisor Rock, Stephen M
Advisor Boyd, Stephen P
Advisor Rock, Stephen M

Subjects

Genre Theses

Bibliographic information

Statement of responsibility Jong-Han Kim.
Note Submitted to the Department of Aeronautics and Astronautics.
Thesis Thesis (Ph.D.)--Stanford University, 2012.
Location electronic resource

Access conditions

Copyright
© 2012 by Jong-Han Kim
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...