BMTP is a biconvex minimum-time planner that convexifies time and derivative constraints jointly, replaces convex decomposition with time-varying separating planes, and guarantees monotone duration decrease on every feasible iterate.
Analysis and observations from the first Amazon picking challenge,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles
BMTP is a biconvex minimum-time planner that convexifies time and derivative constraints jointly, replaces convex decomposition with time-varying separating planes, and guarantees monotone duration decrease on every feasible iterate.