Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles

• URL: http://arxiv.org/abs/2608.02834v1
• Date: Mon, 03 Aug 2026 19:48:24 GMT
• Title: Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles
• Abstract summary: We present a bi approach for minimum-time motion planning convex obstacles that is guaranteed to converge.<n>We find that the proposed method produces high-quality trajectories with times to produce state-of-the-art decomposition of variables.
• Score: 49.315843050082925
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We present a biconvex approach for minimum-time motion planning around convex obstacles that is guaranteed to converge, is anytime, and supports derivative constraints to arbitrary order. We jointly convexify the minimum-time objective and all derivative constraints through a change of variables, and handle collision avoidance via time-varying separating planes, reducing the problem to a biconvex program. This program is solved by alternating between computing maximum-margin separating planes and optimizing the trajectory. By only adding planes for obstacles that the current iterate collides with, the trajectory can jump around obstacles and escape local minima. The method is guaranteed to converge starting from a simple collision-free polygonal curve. In our experiments on drone navigation and dual-arm bin unloading, we find that the proposed method reliably produces high-quality trajectories with computation times comparable to state-of-the-art decomposition-based motion planners, while handling a larger class of problems and being substantially more robust to bad initialization. Project page:https://wernerpe.github.io/bmtp-website/

Related papers

• Some Modifications to Our End-to-End UAV Planner [2.3190673374277524]
  The one-stage planner maps a single depth image and the robot state directly to a set of candidate trajectories.<n>We show that YOPO's multi-modal prediction span to distinct homotopy classes, treating each motion as a trajectory that confines the trajectory to a feasible - without explicit safe-building or construction penalties.
  arXiv  Detail & Related papers  (2026-08-16T13:39:46Z)
• Nonlinear Model Predictive Control via Sequential Convex Programming for Drone-to-Drone Docking [0.0]
  This work formulates the docking task as a finite-horizon optimal control problem based on a reduced-order nonlinear model augmented with disturbance states.<n>The resulting problem is solved using sequential convex programming within a receding-horizon framework to generate dynamically feasible docking trajectories.
  arXiv  Detail & Related papers  (2026-08-11T06:27:45Z)
• Semidefinite Relaxations for Collision-Free Motion Planning [53.160637667144876]
  We focus on a point robot moving from start to goal through inmathbbRn constraints in terms of $C4 trajectories.<n>We demonstrate its effectiveness as a planner for minimum-snap continuous planning with $C4 trajectories.
  arXiv  Detail & Related papers  (2026-06-12T03:18:03Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Accelerated Spline-Based Time-Optimal Motion Planning with Continuous Safety Guarantees for Non-Differentially Flat Systems [6.862015448582809]
  State-of-the-art approaches formulate spline-based motion planning as a single Control Problem (OCP)<n>By treating separation as an independent classification problem solvable via a linear system or quadratic program, the proposed method eliminates hyperplane parameters from the OCP variables.<n> Experimental validation demonstrates that this decoupled approach reduces trajectory times up to almost 60% compared to fully-rich environments.
  arXiv  Detail & Related papers  (2026-03-25T09:53:04Z)
• Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes [3.8436274588467696]
  Obstacle avoidance by polytopic robots is a challenging problem in optimization-based control and trajectory planning.<n>Existing methods rely on hyperiable distance approximations, such as ellipsoids, which distort geometric dynamics.<n>In this paper, we propose a novel iterative convexity- finite-horizon optimization framework for safety-critical navigation programs.
  arXiv  Detail & Related papers  (2026-03-06T05:10:44Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid 3D Registration [77.13381026159111]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration.<n>The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Constrained Stein Variational Trajectory Optimization [5.317624228510749]
  We present CSVTO, an algorithm for performing trajectory optimization with constraints on a set of trajectories in parallel. By explicitly generating diverse sets of trajectories, CSVTO is better able to avoid poor local minima. We demonstrate that CSVTO outperforms baselines in challenging highly-constrained tasks.
  arXiv  Detail & Related papers  (2023-08-23T12:58:40Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Accelerated First-Order Optimization under Nonlinear Constraints [61.98523595657983]
  We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms.<n>An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
  arXiv  Detail & Related papers  (2023-02-01T08:50:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.