2019/02/28 by Danylo Malyuta, Behçet Açıkmeşe, Malyuta, Danylo +5
Chemistry · Engineering · #Advanced Control Systems Optimization #FOS: Mathematics #Fault Detection and Control Systems #Metal-Organic Frameworks: Synthesis and Applications #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.1902.10989
openalex publication_date 2019/02/28 · openalex created_date 2022/07/29 · openalex updated_date 2026/07/28
For multiparametric mixed-integer convex programming problems such as those\nencountered in hybrid model predictive control, we propose an algorithm for\ngenerating a feasible partition of a subset of the parameter space. The result\nis a static map from the current parameter to a suboptimal integer solution\nsuch that the remaining convex program is feasible. Convergence is proven with\na new insight that the overlap among the feasible parameter sets of each\ninteger solution governs the partition complexity. The partition is stored as a\ntree which makes querying the feasible solution efficient. The algorithm can be\nused to warm start a mixed integer solver with a real-time guarantee or to\nprovide a reference integer solution in several suboptimal MPC schemes. The\nalgorithm is tested on randomly generated systems with up to six states,\ndemonstrating the effectiveness of the approach.\n