The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Sub-Optimality Bound on a Gradient Method for Iterative Distributed Control Synthesis

På svenska

Author

Summary, in English

A previous paper introduced an online gradient method to iteratively update local controllers for improved performance. In this paper we modify that method to get an offline method for distributed control synthesis. The complexity of the method is linear in the number of neighbors to each agent.



Since the controllers are constructed to be distributed and the method is an iterative scheme, the controllers will always be sub-optimal compared to a centralized controller. We describe a method to calculate bounds of the sub-optimality of the controllers, using the same variables that take part in the update scheme.

Publishing year

2010

Language

English

Document type

Conference paper

Topic

  • Control Engineering

Keywords

  • sub-optimality bounds
  • distributed control
  • control synthesis

Conference name

19th International Symposium on Mathematical Theory of Networks and Systems, 2010

Conference date

2010-07-05 - 2010-07-09

Conference place

Budapest, Hungary

Status

Published

Research group

  • LCCC