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

DOI10.1002/RNC.4248MaRDI QIDQ4556337zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Approximate cutting plane approaches for exact solutions to robust optimization problems
• Exact approaches for the cutting path determination problem
• Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
• Approximation of corner polyhedra with families of intersection cuts
• Approximation of corner polyhedra with families of intersection cuts
• Corner cutting algorithms associated with optimal shape preserving representations
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• Cutting plane algorithms for robust conic convex optimization problems
• Approximate algorithms for constrained circular cutting problems
• A Müntz type theorem for a family of corner cutting schemes

Cited in

(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

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