aiqbench analysis
This research advances sampling-based motion planning by integrating Riemannian geometry directly into the algorithm, enabling robots to navigate high-dimensional spaces more efficiently than standard Euclidean methods. By leveraging natural gradients and retraction techniques on configuration manifolds, the approach achieves lower-cost trajectories for complex manipulators while maintaining scalability that numerical solvers lack.
Geometry-Aware Sampling-Based Motion Planning on Riemannian Manifolds
arXiv:2602.00992v3 Announce Type: replace Abstract: In many robot motion planning problems, task objectives and physical constraints induce non-Euclidean geometry on the configuration space, yet many planners operate using Euclidean distances that ignore this structure. We address the problem of planning collision-free motions that minimize length under configuration-dependent Riemannian metrics, corresponding to geodesics on the configuration manifold. Conventional numerical methods for computing such paths do not scale well to high-dimensional systems, while sampling-based planners trade scalability for geometric fidelity. To bridge this gap, we propose a sampling-based motion planning framework that operates directly on Riemannian manifolds. We introduce a computationally efficient midpoint-based approximation of the Riemannian geodesic distance and prove that it matches the true Riemannian distance with third-order accuracy. Building on this approximation, we design a local planner that traces the manifold using first-order retractions guided by Riemannian natural gradients. Experiments on a two-link planar arm and a 7-DoF Franka manipulator under a kinetic-energy metric, as well as on rigid-body planning in $\mathrm{SE}(2)$ with non-holonomic motion constraints, demonstrate that our approach consistently produces lower-cost trajectories than Euclidean-based planners and classical numerical geodesic-solver baselines.
Abstract:In many robot motion planning problems, task objectives and physical constraints induce non-Euclidean geometry on the configuration space, yet many planners operate using Euclidean distances that ignore this structure. We address the problem of planning collision-free motions that minimize length under configuration-dependent Riemannian metrics, corresponding to geodesics on the configuration manifold. Conventional numerical methods for computing such paths do not scale well to high-dimensional systems, while sampling-based planners trade scalability for geometric fidelity. To bridge this gap, we propose a sampling-based motion planning framework that operates directly on Riemannian manifolds. We introduce a computationally efficient midpoint-based approximation of the Riemannian geodesic distance and prove that it matches the true Riemannian distance with third-order accuracy. Building on this approximation, we design a local planner that traces the manifold using first-order retractions guided by Riemannian natural gradients. Experiments on a two-link planar arm and a 7-DoF Franka manipulator under a kinetic-energy metric, as well as on rigid-body planning in $\mathrm{SE}(2)$ with non-holonomic motion constraints, demonstrate that our approach consistently produces lower-cost trajectories than Euclidean-based planners and classical numerical geodesic-solver baselines.
Robotics (cs.RO)
arXiv:2602.00992 [cs.RO]
(or arXiv:2602.00992v3 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2602.00992 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 269 words
Related coverage
RMRRT: Riemannian Barrier Metric RRT for Inequality-Aware Steering on Equality Manifolds
arXiv · Oct 7, 2026
geodex: A Library for Motion Planning on Riemannian Manifolds
arXiv · Oct 8, 2026
PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026
Manifold Generative Annealing for Contact Constraint-aware Impedance Control with Reinforcement Learning Prior
arXiv · Oct 16, 2026