Using a Two-Level Structure to Manage the Point Location Problem in Explicit Model Predictive Control

DOI10.1002/asjc.1178zbMath1348.93118OpenAlexW1556844674MaRDI QIDQ2828555

Zuozhang Xie, Biaobiao Hu, Xiaojie Xiu, Ju Zhang

Publication date: 26 October 2016

Published in: Asian Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/asjc.1178

zbMATH Keywords

binary search treepoint locationhash tableexplicit model predictive controlgrid-BSTtwo-level grid

Mathematics Subject Classification ID

Related Items (4)

Fast computation of binary search tree for PWA functions representation using intersection classification ⋮ K-d tree based approach for point location problem in explicit model predictive control ⋮ Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets ⋮ Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

Cites Work

• Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
• Optimal complexity reduction of polyhedral piecewise affine systems
• Evaluation of piecewise affine control via binary search tree
• Efficient On-Line Computation of Constrained Optimal Control
• Approximate explicit constrained linear model predictive control via orthogonal search tree
• Hybrid Model Predictive Control of Exhaust Recompression Hcci
• The explicit linear quadratic regulator for constrained systems

This page was built for publication: Using a Two-Level Structure to Manage the Point Location Problem in Explicit Model Predictive Control