By Topic

A multi-level algorithm for the finite horizon LQ optimal control problem with assigned final state: additive and multiplicative procedures

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

1 Author(s)
E. Zattoni ; Department of Electronics, Computer Science, and Systems, University of Bologna, Italy. ezattoni@deis.unibo.it

A multi-level computational framework which overcomes the dimensionality constraint intrinsic in the solution by pseudoinversion of the discrete-time finite horizon LQ optimal control problem with assigned final state is presented. Depending on design priorities, the algorithm can be based on either of two different nesting procedures: an additive procedure or a multiplicative procedure. In both cases, the solution of the infinite horizon problem can be retrieved if some rather extensive conditions are met. The algorithmic framework holds independently of the control weighting matrix being regular, singular, or zero. Moreover, the devised algorithm differs from those available in the literature in that it handles non-left-invertible systems with no further complications

Published in:

2006 14th Mediterranean Conference on Control and Automation

Date of Conference:

28-30 June 2006