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.
Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems,
1 Pith paper cite this work, alongside 179 external citations. Polarity classification is still indexing.
1
Pith paper citing it
179
external citations · OpenAlex
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.