RCOA relaxes big-M obstacle-avoidance binaries into continuous penalties to get a convex MPC, but the approach is a known relaxation and the claimed proof is circular.
On the use of mixed-integer linear programming for predictive control with avoidance constraints,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Convex Obstacle Avoidance Formulation
RCOA relaxes big-M obstacle-avoidance binaries into continuous penalties to get a convex MPC, but the approach is a known relaxation and the claimed proof is circular.