SOURCE-LINKED INTELLIGENCE

Induced Riemannian Metrics for Motion Planning with Constraints

arXiv · AI, language, vision and robotics · article · Sep 22, 2026 · UTC

In constrained motion planning problems, task and loop-closure constraints restrict a robot's motion to a curved, lower-dimensional submanifold of its configuration space. Planners measure path length with a metric, which sets the cost of moving in each direction. Under the Euclidean metric, this cost is the same everywhere, whereas under a general Riemannian metric, such as the kinetic-energy metric, the cost can vary with direction and configuration. Existing methods often describe the submanifold either implicitly, as a constraint level set, or explicitly, through a parameterization. The im

Read original source ↗ Open in workspace

recordType

paper

region

Global