Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
From MaRDI portal
Publication:5221383
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
Cites work
- A parametric branch and bound approach to suboptimal explicit hybrid MPC
- An improved algorithm for combinatorial multi-parametric quadratic programming
- Analytical expression of explicit MPC solution via lattice piecewise-affine function
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Complexity reduction of explicit model predictive control via separation
- Efficient On-Line Computation of Constrained Optimal Control
- Enumeration-based approach to solving parametric linear complementarity problems
- Evaluation of piecewise affine control via binary search tree
- Explicit hybrid model-predictive control: the exact solution
- Explicit model predictive control: a connected-graph approach
- Hybrid Systems: Computation and Control
- Model predictive control based on linear programming - the explicit solution
- Optimal complexity reduction of polyhedral piecewise affine systems
- The explicit linear quadratic regulator for constrained systems
- Using a two-level structure to manage the point location problem in explicit model predictive control
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
Cited in
(6)- Using a two-level structure to manage 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 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
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)
