A method converts arbitrary logic constraints into smooth max-min constraints via auxiliary simplex variables, claimed to preserve the solution set, demonstrated on quadrotor control.
Title resolution pending
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
-
Smooth Logic Constraints in Nonlinear Optimization and Optimal Control Problems
A method converts arbitrary logic constraints into smooth max-min constraints via auxiliary simplex variables, claimed to preserve the solution set, demonstrated on quadrotor control.