K-d tree based approach for point location problem in explicit model predictive control
From MaRDI portal
Publication:1661925
DOI10.1016/j.jfranklin.2018.05.040zbMath1451.93112OpenAlexW2809519420WikidataQ129624842 ScholiaQ129624842MaRDI QIDQ1661925
Publication date: 17 August 2018
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2018.05.040
Related Items (2)
Fast computation of binary search tree for PWA functions representation using intersection classification ⋮ Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
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
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- 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
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- 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: K-d tree based approach for point location problem in explicit model predictive control
