Abstract

This paper considers the computational efficiency of using generalised function parameterisations for multi-parametric quadratic programming (mp-QP) solutions to MPC. Earlier work demonstrated the potential of Laguerre parameterisations for improving computational efficiency in that the parametric solutions either required fewer regions and/or gave larger volumes. This paper considers the potential of extending this concept to more general function parameterisations. Specifically the aim is to consider to what extent different function parameterisations affect the parametric solution complexity and feasible volumes. Extensive simulation results which suggest there are indeed benefits from using more general parameterisations than Laguerre.

Full Text
Paper version not known

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 call

Disclaimer: 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.