Combinatorial optimization approach to coarse control quantization

Srinivasa Salapaka

Combinatorial optimization approach to coarse control quantization

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper we consider the problem of stabilization of a single input linear discrete time invariant system where the control can take values from a countable set. The problem definition includes the design of a quantization scheme that will produce the coarsest such set while guaranteeing stability. This problem is cast as a static combinatorial resource allocation or coverage problem where in the control values are viewed as resources which have to cover the state space. A relaxed notion of stability is used to represent the coverage cost function. The resulting quantizer on applying Deterministic Annealing algorithm is logarithmic and explicitly gives the partition of the state space.

Original language	English (US)
Title of host publication	Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
Pages	5234-5239
Number of pages	6
State	Published - Dec 1 2006
Event	45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States Duration: Dec 13 2006 → Dec 15 2006

Publication series

Name	Proceedings of the IEEE Conference on Decision and Control
ISSN (Print)	0191-2216

Other

Other	45th IEEE Conference on Decision and Control 2006, CDC
Country	United States
City	San Diego, CA
Period	12/13/06 → 12/15/06

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Fingerprint Dive into the research topics of 'Combinatorial optimization approach to coarse control quantization'. Together they form a unique fingerprint.

Cite this

@inproceedings{218061ecd64c4720b08d4a2cfdb03a07,

title = "Combinatorial optimization approach to coarse control quantization",

abstract = "In this paper we consider the problem of stabilization of a single input linear discrete time invariant system where the control can take values from a countable set. The problem definition includes the design of a quantization scheme that will produce the coarsest such set while guaranteeing stability. This problem is cast as a static combinatorial resource allocation or coverage problem where in the control values are viewed as resources which have to cover the state space. A relaxed notion of stability is used to represent the coverage cost function. The resulting quantizer on applying Deterministic Annealing algorithm is logarithmic and explicitly gives the partition of the state space.",

author = "Srinivasa Salapaka",

year = "2006",

month = dec,

day = "1",

language = "English (US)",

isbn = "1424401712",

series = "Proceedings of the IEEE Conference on Decision and Control",

pages = "5234--5239",

booktitle = "Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC",

note = "45th IEEE Conference on Decision and Control 2006, CDC ; Conference date: 13-12-2006 Through 15-12-2006",

}

TY - GEN

T1 - Combinatorial optimization approach to coarse control quantization

AU - Salapaka, Srinivasa

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In this paper we consider the problem of stabilization of a single input linear discrete time invariant system where the control can take values from a countable set. The problem definition includes the design of a quantization scheme that will produce the coarsest such set while guaranteeing stability. This problem is cast as a static combinatorial resource allocation or coverage problem where in the control values are viewed as resources which have to cover the state space. A relaxed notion of stability is used to represent the coverage cost function. The resulting quantizer on applying Deterministic Annealing algorithm is logarithmic and explicitly gives the partition of the state space.

AB - In this paper we consider the problem of stabilization of a single input linear discrete time invariant system where the control can take values from a countable set. The problem definition includes the design of a quantization scheme that will produce the coarsest such set while guaranteeing stability. This problem is cast as a static combinatorial resource allocation or coverage problem where in the control values are viewed as resources which have to cover the state space. A relaxed notion of stability is used to represent the coverage cost function. The resulting quantizer on applying Deterministic Annealing algorithm is logarithmic and explicitly gives the partition of the state space.

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

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

M3 - Conference contribution

AN - SCOPUS:39649125207

SN - 1424401712

SN - 9781424401710

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 5234

EP - 5239

BT - Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC

T2 - 45th IEEE Conference on Decision and Control 2006, CDC

Y2 - 13 December 2006 through 15 December 2006

ER -

Combinatorial optimization approach to coarse control quantization

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Cite this