Abstract
In this article, a supervised clustering-based heuristic is proposed for the real-time implementation of approximate solutions to stochastic nonlinear model predictive control frameworks. The key idea is to update online a low cardinality set of uncertainty vectors to be used in the expression of the stochastic cost and constraints. These vectors are the centers of uncertainty clusters that are built using the optimal control sequences, cost, and constraints indicators as supervision labels. The use of a moving clustering data buffer which accumulates recent past computations enables to reduce the computational burden per sampling period while making available at each period a relevant amount of samples for the clustering task. A relevant example is given to illustrate the contribution and the associated algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.