Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment

DOI10.1002/rnc.4248zbMath1401.93074OpenAlexW2827157400WikidataQ129563712 ScholiaQ129563712MaRDI QIDQ4556337

Florin Stoican, Ionela Prodan, Esten Ingar Grøtli

Publication date: 15 November 2018

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rnc.4248

zbMATH Keywords

hyperplane arrangementmodel predictive control (MPC)mixed-integer programming (MIP)corner cutting problemmultiobstacle avoidance

Mathematics Subject Classification ID

Mixed integer programming (90C11) Application models in control theory (93C95) Geometric methods (93B27)

Related Items (1)

Robust intersample crossing of target sets with mixed‐integer linear programming

This page was built for publication: Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment