Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Publiceringsår

2010

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • Control Engineering

Nyckelord

  • 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

Forskningsgrupp

  • LCCC