By Topic

Combinatorial Optimization Approach to Coarse Control Quantization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Salapaka, S. ; Dept. of Mech. Sci. & Eng., Illinois Univ., Urbana-Champaign, Urbana, IL

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

Published in:

Decision and Control, 2006 45th IEEE Conference on

Date of Conference:

13-15 Dec. 2006