By Topic

Convergence of an algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and states

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
$33 $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

2 Author(s)
M. Cwikel ; Technion-Israel Institute of Technology, Haifa, Israel ; P. -O. Gutman

In [1] an algorithm was presented to find an approximant to the maximal state constraint set for a linear discrete-time dynamical system with polyhedral state and input hounds. Here it is shown that the algorithm will yield an approximant arbitrarily close to the maximal state constraint set and the number of iterations is given as a function of the prescribed precision of the approximant.

Published in:

IEEE Transactions on Automatic Control  (Volume:31 ,  Issue: 5 )