Plant tuning: A robust Lyapunov approach

Franco Blanchini; Gianfranco Fenu; Giulia Giordano; Felice Andrea Pellegrino

doi:10.1109/CDC.2015.7402365

Plant tuning: A robust Lyapunov approach

Franco Blanchini, Gianfranco Fenu, Giulia Giordano, Felice Andrea Pellegrino

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

5 Citations (Scopus)

Abstract

We consider the problem of tuning the output of a static plant whose model is unknown, under the only information that the input-output function is monotonic in each component or, more in general, that its Jacobian belongs to a known polytope of matrices. As a main result, we show that, if the polytope is robustly non-singular (or has full rank, in the non-square case), then a suitable tuning scheme drives the output to a desired point. The proof is based on the application of a well known theorem concerning the existence of a saddle point for a min-max zero-sum game. Some application examples are suggested.

Original language	English
Title of host publication	54rd IEEE Conference on Decision and Control,CDC 2015
Publisher	IEEE
Pages	1142-1147
Number of pages	6
ISBN (Electronic)	9781479978861
DOIs	https://doi.org/10.1109/CDC.2015.7402365
Publication status	Published - 8 Feb 2015
Externally published	Yes
Event	54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japan Duration: 15 Dec 2015 → 18 Dec 2015 Conference number: 54

Conference

Conference	54th IEEE Conference on Decision and Control, CDC 2015
Abbreviated title	CDC 2015
Country/Territory	Japan
City	Osaka
Period	15/12/15 → 18/12/15

Access to Document

10.1109/CDC.2015.7402365

Cite this

@inproceedings{cee6ecc8e04d4520b29ae06974b12356,

title = "Plant tuning: A robust Lyapunov approach",

abstract = "We consider the problem of tuning the output of a static plant whose model is unknown, under the only information that the input-output function is monotonic in each component or, more in general, that its Jacobian belongs to a known polytope of matrices. As a main result, we show that, if the polytope is robustly non-singular (or has full rank, in the non-square case), then a suitable tuning scheme drives the output to a desired point. The proof is based on the application of a well known theorem concerning the existence of a saddle point for a min-max zero-sum game. Some application examples are suggested.",

author = "Franco Blanchini and Gianfranco Fenu and Giulia Giordano and Pellegrino, {Felice Andrea}",

year = "2015",

month = feb,

day = "8",

doi = "10.1109/CDC.2015.7402365",

language = "English",

pages = "1142--1147",

booktitle = "54rd IEEE Conference on Decision and Control,CDC 2015",

publisher = "IEEE",

address = "United States",

note = "54th IEEE Conference on Decision and Control, CDC 2015, CDC 2015 ; Conference date: 15-12-2015 Through 18-12-2015",

}

TY - GEN

T1 - Plant tuning

T2 - 54th IEEE Conference on Decision and Control, CDC 2015

AU - Blanchini, Franco

AU - Fenu, Gianfranco

AU - Giordano, Giulia

AU - Pellegrino, Felice Andrea

N1 - Conference code: 54

PY - 2015/2/8

Y1 - 2015/2/8

N2 - We consider the problem of tuning the output of a static plant whose model is unknown, under the only information that the input-output function is monotonic in each component or, more in general, that its Jacobian belongs to a known polytope of matrices. As a main result, we show that, if the polytope is robustly non-singular (or has full rank, in the non-square case), then a suitable tuning scheme drives the output to a desired point. The proof is based on the application of a well known theorem concerning the existence of a saddle point for a min-max zero-sum game. Some application examples are suggested.

AB - We consider the problem of tuning the output of a static plant whose model is unknown, under the only information that the input-output function is monotonic in each component or, more in general, that its Jacobian belongs to a known polytope of matrices. As a main result, we show that, if the polytope is robustly non-singular (or has full rank, in the non-square case), then a suitable tuning scheme drives the output to a desired point. The proof is based on the application of a well known theorem concerning the existence of a saddle point for a min-max zero-sum game. Some application examples are suggested.

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

U2 - 10.1109/CDC.2015.7402365

DO - 10.1109/CDC.2015.7402365

M3 - Conference contribution

AN - SCOPUS:84962032907

SP - 1142

EP - 1147

BT - 54rd IEEE Conference on Decision and Control,CDC 2015

PB - IEEE

Y2 - 15 December 2015 through 18 December 2015

ER -

Plant tuning: A robust Lyapunov approach

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this