Abstract

This paper proposes an algorithm for the automatic selection of a non-uniform simplicial partition of the domain of a piecewise-affine function used as an approximate Model Predictive Control law. The main goal is to obtain good approximations reducing the so-called “curse of dimensionality”, which affects the uniform partition case. The partition is chosen according to geometric considerations and by minimizing a proper cost function. The effectiveness of the algorithm and its advantages with respect to employing uniform domain partitions are discussed through an example.

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.