Solving Geodesic Equations with Composite Bernstein Polynomials for Trajectory Planning

• URL: http://arxiv.org/abs/2602.10365v1
• Date: Tue, 10 Feb 2026 23:33:15 GMT
• Title: Solving Geodesic Equations with Composite Bernstein Polynomials for Trajectory Planning
• Abstract summary: Trajectories are planned over a cost surface that encodes obstacles as continuous fields rather than discrete boundaries.<n>Regions near obstacles are assigned higher costs, naturally encouraging the trajectory to maintain a safe distance while still allowing efficient routing through constrained spaces.<n>The method applies to both two- and three-dimensional environments and is suitable for ground, aerial, underwater, and space systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work presents a trajectory planning method based on composite Bernstein polynomials for autonomous systems navigating complex environments. The method is implemented in a symbolic optimization framework that enables continuous paths and precise control over trajectory shape. Trajectories are planned over a cost surface that encodes obstacles as continuous fields rather than discrete boundaries. Regions near obstacles are assigned higher costs, naturally encouraging the trajectory to maintain a safe distance while still allowing efficient routing through constrained spaces. The use of composite Bernstein polynomials preserves continuity while enabling fine control over local curvature to satisfy geodesic constraints. The symbolic representation supports exact derivatives, improving optimization efficiency. The method applies to both two- and three-dimensional environments and is suitable for ground, aerial, underwater, and space systems. In spacecraft trajectory planning, for example, it enables the generation of continuous, dynamically feasible trajectories with high numerical efficiency, making it well suited for orbital maneuvers, rendezvous and proximity operations, cluttered gravitational environments, and planetary exploration missions with limited onboard computational resources. Demonstrations show that the approach efficiently generates smooth, collision-free paths in scenarios with multiple obstacles, maintaining clearance without extensive sampling or post-processing. The optimization incorporates three constraint types: (1) a Gaussian surface inequality enforcing minimum obstacle clearance; (2) geodesic equations guiding the path along locally efficient directions on the cost surface; and (3) boundary constraints enforcing fixed start and end conditions. The method can serve as a standalone planner or as an initializer for more complex motion planning problems.

Related papers

• Whole-Body Planning for Humanoids Navigating Confined Spaces via Self-Collision Avoidance References [2.8747398859585385]
  Humanoid locomotion in highly confined environments requires navigating dense environmental obstacles and complex self-collision bounds.<n>We propose a three-stage whole-body planning framework that formulates kinematic path planning directly over kinematically reachable rigid-body volumes.<n>Our framework generates feasible trajectories across 12-to-18-second tasks with complex foot and hand contacts where standard baselines fail.
  arXiv  Detail & Related papers  (2026-08-10T20:45:19Z)
• 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)
• AutoPath: Learning Transferable Goal-Conditioned Stochastic Path Prior for Safe Navigation Without Human Demonstrations [103.61864552260316]
  Real-time navigation in dynamic environments requires collision-free and dynamically feasible motion under limited perception.<n>We formulate navigation as learning a transferable goal-aligned path prior that models a reusable distribution over goal-aligned geometry-consistent local paths conditioned on local observations.<n>We develop a structured prior learning framework that parameterizes local paths using a geometry-aware polar action manifold and incorporates risk-sensitive utility shaping with multi-goal distributional rollouts for stable and safety-aware planning.
  arXiv  Detail & Related papers  (2026-07-13T16:00:41Z)
• 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)
• Natural Functional Gradients for Smooth Trajectory Optimization [11.331190543795914]
  We propose a trajectory optimization framework that performs geometry-aware updates directly in function space using natural functional gradients.<n>We derive a practical Monte-Carlo estimator of the natural functional gradient that requires only black-box trajectory evaluations.<n> Experiments on constrained robotic manipulation tasks demonstrate that the proposed method improves trajectory feasibility and produces smoother motions.
  arXiv  Detail & Related papers  (2026-05-27T09:25:57Z)
• TCBiRRT: Rapid Motion Planning for Tightly Coupled Dual-arm Space Manipulator Using Task-space Random Expansion [13.227911126048731]
  Planning the motion path for a tightly coupled dual-arm space manipulator under closed-chain constraints is a fundamental yet challenging problem.<n>This paper proposes a task-space constrained bidirectional rapidly-exploring random tree algorithm, termed TCBiRRT.
  arXiv  Detail & Related papers  (2026-05-26T15:24:07Z)
• 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)
• Hierarchical Trajectory Planning of Floating-Base Multi-Link Robot for Maneuvering in Confined Environments [9.325443556436436]
  Floating-base multi-link robots can change their shape during flight, making them well-suited for applications in confined environments.<n>This work introduces a hierarchical trajectory planning framework that integrates global guidance with configuration-aware local optimization.<n>To the best of our knowledge, this is the first planning framework for floating-base multi-link robots that has been demonstrated on a real robot.
  arXiv  Detail & Related papers  (2026-02-25T22:49:54Z)
• Fast Near Time-Optimal Motion Planning for Holonomic Vehicles in Structured Environments [8.195916347194315]
  The approach aims to solve the problem of motion planning for planar motion systems using magnetic levitation.<n>The presented approach encodes the environment representation using free-space corridors and represents the motion of the vehicle through such a corridor using a motion primitive.<n>The method achieves significantly lower times compared to the state-of-the-art and is validated on a real-world Beckhoff XPlanar system.
  arXiv  Detail & Related papers  (2026-02-02T21:26:30Z)
• Optimal Trajectory Planning for Orbital Robot Rendezvous and Docking [2.666234597824067]
  Approaching a tumbling target safely is a critical challenge in space debris removal missions utilizing robotic manipulators onboard servicing satellites.<n>We propose a trajectory planning method based on nonlinear optimization for a close-range rendezvous to bring a free-floating, rotating debris object into the manipulator's workspace.<n>The proposed method introduces a dynamic keep-out sphere that adapts depending on the approach conditions, allowing for closer and safer access to the target.
  arXiv  Detail & Related papers  (2025-12-26T06:11:54Z)
• 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)
• TLE-Based A2C Agent for Terrestrial Coverage Orbital Path Planning [0.0]
  The congestion of Low Earth Orbit (LEO) poses persistent challenges to the efficient deployment and safe operation of Earth observation satellites.<n>This work presents a reinforcement learning framework using the Advantage Actor-Critic (A2C) algorithm to optimize satellite orbital parameters for precise terrestrial coverage.
  arXiv  Detail & Related papers  (2025-08-14T17:44:51Z)
• LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning [91.95362946266577]
  Path planning is a fundamental scientific problem in robotics and autonomous navigation.<n>Traditional algorithms like A* and its variants are capable of ensuring path validity but suffer from significant computational and memory inefficiencies as the state space grows.<n>We propose a new LLM based route planning method that synergistically combines the precise pathfinding capabilities of A* with the global reasoning capability of LLMs.<n>This hybrid approach aims to enhance pathfinding efficiency in terms of time and space complexity while maintaining the integrity of path validity, especially in large-scale scenarios.
  arXiv  Detail & Related papers  (2024-06-20T01:24:30Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Path Signatures for Diversity in Probabilistic Trajectory Optimisation [24.101232487591094]
  Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. Recent advancements in computing hardware allow for parallel trajectory optimisation where multiple solutions are obtained simultaneously. We propose an algorithm for parallel trajectory optimisation that promotes diversity over the range of solutions, therefore avoiding mode collapses.
  arXiv  Detail & Related papers  (2023-08-08T06:10:53Z)
• First Steps: Latent-Space Control with Semantic Constraints for Quadruped Locomotion [73.37945453998134]
  Traditional approaches to quadruped control employ simplified, hand-derived models. This significantly reduces the capability of the robot since its effective kinematic range is curtailed. In this work, these challenges are addressed by framing quadruped control as optimisation in a structured latent space. A deep generative model captures a statistical representation of feasible joint configurations, whilst complex dynamic and terminal constraints are expressed via high-level, semantic indicators. We validate the feasibility of locomotion trajectories optimised using our approach both in simulation and on a real-worldmal quadruped.
  arXiv  Detail & Related papers  (2020-07-03T07:04:18Z)

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.