Combinatorial optimization approach to coarse control quantization

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
Pages5234-5239
Number of pages6
StatePublished - Dec 1 2006
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

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

Other

Other45th IEEE Conference on Decision and Control 2006, CDC
CountryUnited States
CitySan Diego, CA
Period12/13/0612/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