A biconvex alternating method computes near time-optimal, dynamically feasible trajectories through sequences of convex sets, with completeness and anytime guarantees.
Online gener- ation of collision-free trajectories for quadrotor flight in unknown cluttered environments
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A biconvex method for minimum-time motion planning through sequences of convex sets
A biconvex alternating method computes near time-optimal, dynamically feasible trajectories through sequences of convex sets, with completeness and anytime guarantees.