Fast computation of binary search tree for PWA functions representation using intersection classification

DOI10.1016/J.AUTOMATICA.2022.110217MaRDI QIDQ2139368zbMATH OpenOpenAlexFDO

Authors Lucas Schulze, Douglas W. Bertol, Guilherme V. Raffo

Publication date 17 May 2022

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2022.110217

zbMATH Keywords

piecewise affine functionpoint location problemexplicit model predictive control

Mathematics Subject Classification ID

Model predictive control (93B45)

Recommendations

• Evaluation of piecewise affine control via binary search tree
• Fast model predictive control combining offline method and online optimization with K-D tree
• Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
• An efficient algorithm for optimal control of PWA systems with polyhedral performance indices
• K-d tree based approach for point location problem in explicit model predictive control

Cites work

• Efficient On-Line Computation of Constrained Optimal Control
• Evaluation of piecewise affine control via binary search tree
• Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
• K-d tree based approach for point location problem in explicit model predictive control
• The explicit linear quadratic regulator for constrained systems
• Using a two-level structure to manage the point location problem in explicit model predictive control

Describes a project that uses

Uses Software

• YALMIP
• MPT
• Robotics

This page was built for publication: Fast computation of binary search tree for PWA functions representation using intersection classification

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