Approximate explicit constrained linear model predictive control via orthogonal search tree

Simple item page
creativework.keywordsConstrained control, Optimal control, Piecewise linear control
dc.contributor.authorJohansen T.
dc.contributor.authorGrancharova A.
dc.date.accessioned2024-07-10T14:27:03Z
dc.date.accessioned2024-07-10T14:46:56Z
dc.date.available2024-07-10T14:27:03Z
dc.date.available2024-07-10T14:46:56Z
dc.date.issued2003-05-01
dc.description.abstractSolutions to constrained linear model predictive control problems can be precomputed offline in an explicit form as a piecewise linear state feedback on a polyhedral partition of the state-space, avoiding real-time optimization. We suggest an algorithm that will determine an approximate explicit piecewise linear state feedback by imposing an orthogonal search tree structure on the partition. This leads to a real-time computational complexity that is logarithmic in the number of regions in the partition, and the algorithm yields guarantees on the suboptimality, asymptotic stability and constraint fulfillment.
dc.identifier.doi10.1109/TAC.2003.811259
dc.identifier.issn0018-9286
dc.identifier.scopusSCOPUS_ID:0037955662en
dc.identifier.urihttps://rlib.uctm.edu/handle/123456789/83
dc.language.isoen
dc.source.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0037955662&origin=inward
dc.titleApproximate explicit constrained linear model predictive control via orthogonal search tree
dc.typeArticle
oaire.citation.issue5
oaire.citation.volume48
Files
Collections
Articles