K-d tree based approach for point location problem in explicit model predictive control

DOI10.1016/J.JFRANKLIN.2018.05.040zbMATH Open1451.93112OpenAlexW2809519420WikidataQ129624842 ScholiaQ129624842MaRDI QIDQ1661925FDOQ1661925

Xiaojie Xiu, Ju Zhang

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

Recommendations

• Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
• Using a two-level structure to manage the point location problem in explicit model predictive control
• Reachable partitions algorithm for 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
• Fast model predictive control combining offline method and online optimization with K-D tree

zbMATH Keywords

point location problemexplicit model predictive controlconstructed k-d tree

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Model predictive control (93B45)

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
• Optimal complexity reduction of polyhedral piecewise affine systems
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• Using a two-level structure to manage the point location problem in explicit model predictive control

Cited In (5)

• Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
• Model predictive control for LPV models with maximal stabilizable model range
• Fast computation of binary search tree for PWA functions representation using intersection classification
• Fast model predictive control combining offline method and online optimization with K-D tree
• Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

Uses Software

• MPT

This page was built for publication: K-d tree based approach for point location problem in explicit model predictive control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661925)