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

DOI10.1016/J.AUTOMATICA.2022.110217zbMATH Open1491.93037OpenAlexW4221001139MaRDI QIDQ2139368FDOQ2139368

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

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)

Cites Work

• The explicit linear quadratic regulator for constrained systems
• Evaluation of piecewise affine control via binary search tree
• Efficient On-Line Computation of Constrained Optimal Control
• 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
• Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC

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)