Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
From MaRDI portal
Publication:716135
DOI10.1016/j.automatica.2011.01.009zbMath1216.93045MaRDI QIDQ716135
Publication date: 19 April 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.01.009
Related Items
A patchy approximation of explicit model predictive control, Automatically generated embedded model predictive control: Moving an industrial PC‐based MPC to an embedded platform, Computational burden reduction in min-max MPC, Comments on ``Analytical expression of explicit MPC solution via lattice piecewise-affine function [Automatica 45 (2009) 910-917], Online constraint removal: accelerating MPC with a Lyapunov function, Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A logarithmic-time solution to the point location problem for parametric linear programming
- Set membership approximation theory for fast implementation of model predictive control laws
- Analytical expression of explicit MPC solution via lattice piecewise-affine function
- Evaluation of piecewise affine control via binary search tree
- Approximate explicit receding horizon control of constrained nonlinear systems.
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- 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
