A deterministic optimization framework that maximizes how long multiple candidate targets remain reachable, shown equivalent to a cardinality minimization problem and solved via QCVX, MICP, and SCP methods.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Deferred-Decision Trajectory Optimization
A deterministic optimization framework that maximizes how long multiple candidate targets remain reachable, shown equivalent to a cardinality minimization problem and solved via QCVX, MICP, and SCP methods.