Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
From MaRDI portal
Publication:5221383
DOI10.1080/00207179.2018.1493536zbMath1436.93044OpenAlexW2811139923WikidataQ129599362 ScholiaQ129599362MaRDI QIDQ5221383
Publication date: 25 March 2020
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2018.1493536
binary search treepoint locationexplicit model predictive control\(k\)-\(d\) treegrid \(k\)-\(d\) tree
Related Items (1)
Uses Software
Cites Work
- A parametric branch and bound approach to suboptimal explicit hybrid MPC
- An improved algorithm for combinatorial multi-parametric quadratic programming
- Explicit model predictive control: a connected-graph approach
- Complexity reduction of explicit model predictive control via separation
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- Explicit hybrid model-predictive control: the exact solution
- Enumeration-based approach to solving parametric linear complementarity problems
- Optimal complexity reduction of polyhedral piecewise affine systems
- Analytical expression of explicit MPC solution via lattice piecewise-affine function
- Evaluation of piecewise affine control via binary search tree
- Using a Two-Level Structure to Manage the Point Location Problem in Explicit Model Predictive Control
- Efficient On-Line Computation of Constrained Optimal Control
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Model predictive control based on linear programming - the explicit solution
- Hybrid Systems: Computation and Control
- The explicit linear quadratic regulator for constrained systems
This page was built for publication: Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
