Abstract
ABSTRACTThis paper characterises the geometric structure of receding horizon control (RHC) of linear, discrete‐time systems, subject to a quadratic performance index and linear constraints. The geometric insights so obtained are exploited to derive a closed‐form solution for the case where the total number of constraints is less than or equal to the number of degrees of freedom, represented by the number of control moves. The solution is shown to be a partition of the state space into regions for which an analytic expression is given for the corresponding control law. Both the regions and the control law are characterised in terms of the parameters of the open‐loop optimal control problem that underlies RHC and can be computed off line. The solution for the case where the total number of constraints is greater than the number of degrees of freedom is addressed via an algorithm that iteratively uses the off‐line solution and avoids on‐line optimisation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
