Decentralized control for discrete-time LTI systems: Lower bound analysis of H performance achievable via LTI controllers

Yoshio Ebihara, Noboru Sebe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper is concerned with the decentralized H controller synthesis problem for discrete-time linear time-invariant (LTI) systems. In spite of intensive research efforts over the last several decades, this problem is believed to be non-convex and still outstanding in general. Therefore most existing approaches resort to heuristic optimization algorithms that do not allow us to draw any definite conclusion on the quality of the designed controllers. To get around this difficult situation, in this paper, we propose convex optimization procedures for computing lower bounds of the H performance that is achievable via decentralized LTI controllers of any order. In particular, we show that sharpened lower bounds can be obtained by making good use of structures of the LTI plant typically observed in the decentralized control setting. We illustrate via numerical examples that these lower bounds are indeed useful to ensure the good quality of decentralized controllers designed by a heuristic optimization.

Original languageEnglish
Title of host publicationProceedings of the 2010 American Control Conference, ACC 2010
Pages5602-5607
Number of pages6
Publication statusPublished - Oct 15 2010
Externally publishedYes
Event2010 American Control Conference, ACC 2010 - Baltimore, MD, United States
Duration: Jun 30 2010Jul 2 2010

Publication series

NameProceedings of the 2010 American Control Conference, ACC 2010

Conference

Conference2010 American Control Conference, ACC 2010
CountryUnited States
CityBaltimore, MD
Period6/30/107/2/10

Fingerprint

Decentralized control
Controllers
Convex optimization

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Cite this

Ebihara, Y., & Sebe, N. (2010). Decentralized control for discrete-time LTI systems: Lower bound analysis of H performance achievable via LTI controllers. In Proceedings of the 2010 American Control Conference, ACC 2010 (pp. 5602-5607). [5531032] (Proceedings of the 2010 American Control Conference, ACC 2010).

Decentralized control for discrete-time LTI systems : Lower bound analysis of H performance achievable via LTI controllers. / Ebihara, Yoshio; Sebe, Noboru.

Proceedings of the 2010 American Control Conference, ACC 2010. 2010. p. 5602-5607 5531032 (Proceedings of the 2010 American Control Conference, ACC 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ebihara, Y & Sebe, N 2010, Decentralized control for discrete-time LTI systems: Lower bound analysis of H performance achievable via LTI controllers. in Proceedings of the 2010 American Control Conference, ACC 2010., 5531032, Proceedings of the 2010 American Control Conference, ACC 2010, pp. 5602-5607, 2010 American Control Conference, ACC 2010, Baltimore, MD, United States, 6/30/10.
Ebihara Y, Sebe N. Decentralized control for discrete-time LTI systems: Lower bound analysis of H performance achievable via LTI controllers. In Proceedings of the 2010 American Control Conference, ACC 2010. 2010. p. 5602-5607. 5531032. (Proceedings of the 2010 American Control Conference, ACC 2010).
Ebihara, Yoshio ; Sebe, Noboru. / Decentralized control for discrete-time LTI systems : Lower bound analysis of H performance achievable via LTI controllers. Proceedings of the 2010 American Control Conference, ACC 2010. 2010. pp. 5602-5607 (Proceedings of the 2010 American Control Conference, ACC 2010).
@inproceedings{82104775742f4c198ede4042c54cf484,
title = "Decentralized control for discrete-time LTI systems: Lower bound analysis of H∞ performance achievable via LTI controllers",
abstract = "This paper is concerned with the decentralized H∞ controller synthesis problem for discrete-time linear time-invariant (LTI) systems. In spite of intensive research efforts over the last several decades, this problem is believed to be non-convex and still outstanding in general. Therefore most existing approaches resort to heuristic optimization algorithms that do not allow us to draw any definite conclusion on the quality of the designed controllers. To get around this difficult situation, in this paper, we propose convex optimization procedures for computing lower bounds of the H ∞ performance that is achievable via decentralized LTI controllers of any order. In particular, we show that sharpened lower bounds can be obtained by making good use of structures of the LTI plant typically observed in the decentralized control setting. We illustrate via numerical examples that these lower bounds are indeed useful to ensure the good quality of decentralized controllers designed by a heuristic optimization.",
author = "Yoshio Ebihara and Noboru Sebe",
year = "2010",
month = "10",
day = "15",
language = "English",
isbn = "9781424474264",
series = "Proceedings of the 2010 American Control Conference, ACC 2010",
pages = "5602--5607",
booktitle = "Proceedings of the 2010 American Control Conference, ACC 2010",

}

TY - GEN

T1 - Decentralized control for discrete-time LTI systems

T2 - Lower bound analysis of H∞ performance achievable via LTI controllers

AU - Ebihara, Yoshio

AU - Sebe, Noboru

PY - 2010/10/15

Y1 - 2010/10/15

N2 - This paper is concerned with the decentralized H∞ controller synthesis problem for discrete-time linear time-invariant (LTI) systems. In spite of intensive research efforts over the last several decades, this problem is believed to be non-convex and still outstanding in general. Therefore most existing approaches resort to heuristic optimization algorithms that do not allow us to draw any definite conclusion on the quality of the designed controllers. To get around this difficult situation, in this paper, we propose convex optimization procedures for computing lower bounds of the H ∞ performance that is achievable via decentralized LTI controllers of any order. In particular, we show that sharpened lower bounds can be obtained by making good use of structures of the LTI plant typically observed in the decentralized control setting. We illustrate via numerical examples that these lower bounds are indeed useful to ensure the good quality of decentralized controllers designed by a heuristic optimization.

AB - This paper is concerned with the decentralized H∞ controller synthesis problem for discrete-time linear time-invariant (LTI) systems. In spite of intensive research efforts over the last several decades, this problem is believed to be non-convex and still outstanding in general. Therefore most existing approaches resort to heuristic optimization algorithms that do not allow us to draw any definite conclusion on the quality of the designed controllers. To get around this difficult situation, in this paper, we propose convex optimization procedures for computing lower bounds of the H ∞ performance that is achievable via decentralized LTI controllers of any order. In particular, we show that sharpened lower bounds can be obtained by making good use of structures of the LTI plant typically observed in the decentralized control setting. We illustrate via numerical examples that these lower bounds are indeed useful to ensure the good quality of decentralized controllers designed by a heuristic optimization.

UR - http://www.scopus.com/inward/record.url?scp=77957790375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957790375&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:77957790375

SN - 9781424474264

T3 - Proceedings of the 2010 American Control Conference, ACC 2010

SP - 5602

EP - 5607

BT - Proceedings of the 2010 American Control Conference, ACC 2010

ER -