Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
DOI10.1080/00207179.2018.1493536zbMATH Open1436.93044OpenAlexW2811139923WikidataQ129599362 ScholiaQ129599362MaRDI QIDQ5221383FDOQ5221383
Authors: Xiaojie Xiu, Ju Zhang 
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
Recommendations
- K-d tree based approach for point location problem in explicit model predictive control
- EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
- Reachable partitions algorithm for the point location problem in explicit model predictive control
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- Generalized comparison trees for point-location problems
- On Point Location and Motion Planning among Simplices
- On point location and motion planning among simplices
- Efficient Point Location in a Convex Spatial Cell-Complex
point locationbinary search treeexplicit model predictive control\(k\)-\(d\) treegrid \(k\)-\(d\) tree
Cites Work
- Hybrid Systems: Computation and Control
- Model predictive control based on linear programming - the explicit solution
- The explicit linear quadratic regulator for constrained systems
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Analytical expression of explicit MPC solution via lattice piecewise-affine function
- Evaluation of piecewise affine control via binary search tree
- Efficient On-Line Computation of Constrained Optimal Control
- Enumeration-based approach to solving parametric linear complementarity problems
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- 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
- Explicit hybrid model-predictive control: the exact solution
- Complexity reduction of explicit model predictive control via separation
- Optimal complexity reduction of polyhedral piecewise affine systems
- Using a two-level structure to manage the point location problem in explicit model predictive control
Cited In (6)
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- Reachable partitions algorithm for the point location problem in explicit model predictive control
- Fast computation of binary search tree for PWA functions representation using intersection classification
- A logarithmic-time solution to the point location problem for parametric linear programming
- K-d tree based approach for point location problem in explicit model predictive control
- Using a two-level structure to manage the point location problem in explicit model predictive control
Uses Software
This page was built for publication: Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221383)
