Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: Stability and moving-horizon approximations
dc.contributor.author | Keerthi, S. S. | en_US |
dc.contributor.author | Gilbert, Elmer Grant | en_US |
dc.date.accessioned | 2006-09-11T15:49:34Z | |
dc.date.available | 2006-09-11T15:49:34Z | |
dc.date.issued | 1988-05 | en_US |
dc.identifier.citation | Keerthi, S. S.; Gilbert, E. G.; (1988). "Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: Stability and moving-horizon approximations." Journal of Optimization Theory and Applications 57(2): 265-293. <http://hdl.handle.net/2027.42/45231> | en_US |
dc.identifier.issn | 0022-3239 | en_US |
dc.identifier.issn | 1573-2878 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45231 | |
dc.description.abstract | Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and moving-horizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended. | en_US |
dc.format.extent | 1537371 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Plenum Publishing Corporation ; Springer Science+Business Media | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Infinite-horizon Optimal Control | en_US |
dc.subject.other | Stability | en_US |
dc.subject.other | Theory of Computation | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Applications of Mathematics | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Engineering, General | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Discrete-time Systems | en_US |
dc.subject.other | Moving-horizon Control | en_US |
dc.subject.other | State-control Constraints | en_US |
dc.subject.other | Nonquadratic Cost Functions | en_US |
dc.title | Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: Stability and moving-horizon approximations | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Aerospace Engineering, University of Michigan, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationother | School of Automation, Indian Institute of Science, Bangalore, India | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45231/1/10957_2004_Article_BF00938540.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF00938540 | en_US |
dc.identifier.source | Journal of Optimization Theory and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.