Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes

• URL: http://arxiv.org/abs/2603.05916v1
• Date: Fri, 06 Mar 2026 05:10:44 GMT
• Title: Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes
• Abstract summary: 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.
• Score: 3.8436274588467696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Obstacle avoidance of polytopic obstacles by polytopic robots is a challenging problem in optimization-based control and trajectory planning. Many existing methods rely on smooth geometric approximations, such as hyperspheres or ellipsoids, which allow differentiable distance expressions but distort the true geometry and restrict the feasible set. Other approaches integrate exact polytope distances into nonlinear model predictive control (MPC), resulting in nonconvex programs that limit real-time performance. In this paper, we construct linear discrete-time control barrier function (DCBF) constraints by deriving supporting hyperplanes from exact closest-point computations between convex polytopes. We then propose a novel iterative convex MPC-DCBF framework, where local linearization of system dynamics and robot geometry ensures convexity of the finite-horizon optimization at each iteration. The resulting formulation reduces computational complexity and enables fast online implementation for safety-critical control and trajectory planning of general nonlinear dynamics. The framework extends to multi-robot and three-dimensional environments. Numerical experiments demonstrate collision-free navigation in cluttered maze scenarios with millisecond-level solve times.

Related papers

• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles [49.315843050082925]
  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.
  arXiv  Detail & Related papers  (2026-08-03T19:48:24Z)
• GPU-Accelerated Polygonal Signed Distance Functions for Real-Time Collision Avoidance [2.1993185973565113]
  In dense environments, where feasible space is limited, the computational workload often dominates the control-cycle runtime.<n>The proposed Polygonal Signed Distance Function (PSDF) is a geometry-exact signed distance function between a convex polygonal robot footprint and obstacles represented by their boundary edges.<n>PSDF is embedded into model predictive control by locally linearizing the stage-wise safety constraints within a sequential quadratic programming-based real-time iteration scheme.<n>PSDF-MPC maintains real-time feasibility and robust collision avoidance in dense polygonal environments.
  arXiv  Detail & Related papers  (2026-07-05T13:46:59Z)
• Real-Time and Accurate Collision-Free Teleoperation via Differentiable Constraint-Based Trajectory Planning [1.4699455652461726]
  A common strategy to mitigate this issue is to enhance the operator's input using optimal-control-based trajectory planning.<n>We adapt a recent formulation of differentiable collision-avoidance constraints, based on duality in convex optimization, to the teleoperation setting.<n>Results show that our approach achieves lower computation times while enabling more accurate obstacle modeling.
  arXiv  Detail & Related papers  (2026-06-07T16:39:56Z)
• 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)
• Motion Planning for Autonomous Vehicles using Optimization over Graphs of Convex Sets [0.6445605125467574]
  Motion planning for autonomous vehicles requires generating collision-free and dynamically feasible trajectories under real-time constraints.<n>In this paper, we introduce a new geometric control method to approximate nonlinear motion planning problems.<n>The method provides a structured approximation of nonlinear motion planning problems, capturing dominant geometric dynamic effects while preserving convexity in the continuous relaxation.
  arXiv  Detail & Related papers  (2026-05-13T23:29:54Z)
• Adaptive Smooth Tchebycheff Attention for Multi-Objective Policy Optimization [55.338784037660474]
  Multi- curvature reinforcement learning in domains requires balancing complex, non-fragile interference trade-offs between conflicting objectives.<n>In this paper we introduce a novel based real-time based real-time optimization on a robotic visual -- a proxy for monitoring ecosystems.
  arXiv  Detail & Related papers  (2026-05-12T21:32:57Z)
• 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)
• Online Trajectory Optimization for Arbitrary-Shaped Mobile Robots via Polynomial Separating Hypersurfaces [7.859691892608875]
  An emerging class of trajectory optimization methods enforces collision by jointly optimizing the robot's configuration and a separating hyperplane.<n>In this work, we unequivocally remove the limitation by introducing nonlinear separating hyperplanes parameterized by functions.
  arXiv  Detail & Related papers  (2026-01-14T07:07:48Z)
• Parallel Diffusion Solver via Residual Dirichlet Policy Optimization [88.7827307535107]
  Diffusion models (DMs) have achieved state-of-the-art generative performance but suffer from high sampling latency due to their sequential denoising nature.<n>Existing solver-based acceleration methods often face significant image quality degradation under a low-dimensional budget.<n>We propose the Ensemble Parallel Direction solver (dubbed as EPD-EPr), a novel ODE solver that mitigates these errors by incorporating multiple gradient parallel evaluations in each step.
  arXiv  Detail & Related papers  (2025-12-28T05:48:55Z)
• Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning [56.240199425429445]
  Multi-Robot Motion Planning (MPMP) involves generating trajectories for multiple robots operating in a shared continuous workspace.<n>While discrete multi-agent finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization trajectory quality.<n>This paper tackles limitations of two approaches by introducing discrete MAPF solvers with constrained generative diffusion models.
  arXiv  Detail & Related papers  (2025-08-27T17:59:36Z)
• Data-Driven Motion Planning for Uncertain Nonlinear Systems [9.488752723308957]
  This paper proposes a data-driven motion-planning framework for nonlinear systems.<n>An algorithm constructs a sequence of overlapping invariant polytopes.<n>Control gains are interpolated in real time via simplex-based, keeping the state inside the invariant polytopes throughout the motion.
  arXiv  Detail & Related papers  (2025-07-31T20:41:34Z)
• Custom Non-Linear Model Predictive Control for Obstacle Avoidance in Indoor and Outdoor Environments [0.0]
  This paper introduces a Non-linear Model Predictive Control (NMPC) framework for the DJI Matrice 100. The framework supports various trajectory types and employs a penalty-based cost function for control accuracy in tight maneuvers.
  arXiv  Detail & Related papers  (2024-10-03T17:50:19Z)
• Stochastic Nonlinear Control via Finite-dimensional Spectral Dynamic Embedding [20.43835169613882]
  This paper proposes an approach, Spectral Dynamics Embedding Control (SDEC), to optimal control for nonlinear systems.<n>It reveals an infinite-dimensional feature representation induced by the system's nonlinear dynamics, enabling a linear representation of the state-action value function.<n>For practical implementation, this representation is approximated using finite-dimensional truncations.
  arXiv  Detail & Related papers  (2023-04-08T04:23:46Z)
• Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
  We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm. We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
  arXiv  Detail & Related papers  (2022-09-15T07:22:58Z)
• Robust Constrained Multi-objective Evolutionary Algorithm based on Polynomial Chaos Expansion for Trajectory Optimization [0.0]
  The proposed method rewrites a robust formulation into a deterministic problem via the PCE. As a case study, the landing trajectory design of supersonic transport (SST) with wind uncertainty is optimized.
  arXiv  Detail & Related papers  (2022-05-23T15:33:05Z)
• Non-linear Independent Dual System (NIDS) for Discretization-independent Surrogate Modeling over Complex Geometries [0.0]
  Non-linear independent dual system (NIDS) is a deep learning surrogate model for discretization-independent, continuous representation of PDE solutions. NIDS can be used for prediction over domains with complex, variable geometries and mesh topologies. Test cases include a vehicle problem with complex geometry and data scarcity, enabled by a training method.
  arXiv  Detail & Related papers  (2021-09-14T23:38:41Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• DiffPD: Differentiable Projective Dynamics with Contact [65.88720481593118]
  We present DiffPD, an efficient differentiable soft-body simulator with implicit time integration. We evaluate the performance of DiffPD and observe a speedup of 4-19 times compared to the standard Newton's method in various applications.
  arXiv  Detail & Related papers  (2021-01-15T00:13:33Z)

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.