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.

Dynamic Dual Decomposition for Distributed Control

Author

Summary, in English

We show how dynamic price mechanisms can be used for decomposition and distributed optimization of control systems.



A classical method to deal with optimization constraints is Lagrange relaxation, where dual variables are introduced in the optimization objective. When variables of different subproblems are connected by such constraints, the dual variables can be interpreted as prices in a market mechanism serving to achieve mutual agreement between the subproblems. In this paper, the same idea is used for decomposition of optimal control problems, with dynamics in both decision variables and prices. We show how the prices can be used for decentralized verification that a control law or trajectory stays within a prespecified distance from optimality. For example, approximately optimal decentralized controllers can be obtained by using simplified models for decomposition and more accurate local models for control.

Publishing year

2009

Language

English

Pages

884-888

Document type

Conference paper

Topic

  • Control Engineering

Conference name

American Control Conference 2009

Conference date

2009-06-10 - 2009-06-12

Conference place

St Louis, MO, United States

Status

Published

Project

  • CHAT
  • AEOLUS
  • LCCC-distributed

Research group

  • LCCC