Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
A new method for informed sampling on Riemannian manifolds uses Loewner order lower bounds to produce tighter informed sets, accelerating motion planning for robotic manipulators.
[2606.02879] Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
[Submitted on 1 Jun 2026]
Title:Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
View a PDF of the paper titled Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds, by Phone Thiha Kyaw and Jonathan Kelly
View PDF HTML (experimental)
Abstract:Informed sampling techniques accelerate sampling-based motion planners by focusing the search on promising regions of the state space, yet most existing methods rely on Euclidean heuristics that become inadmissible under configuration-dependent Riemannian metrics. While scalar eigenvalue bounds restore admissibility by uniformly scaling the Euclidean distance, they discard the directional structure of the metric, producing overly conservative informed sets. We propose a matrix-valued admissible heuristic that exploits the Loewner order on symmetric positive definite matrices to compute the tightest constant lower bound on the metric tensor while preserving its full directional structure. The Cholesky factorization of this bound defines a linear map to an isotropic Euclidean space in which the Riemannian informed set reduces to a standard prolate hyperspheroid, enabling direct, rejection-free sampling using existing algorithms. Experiments on manipulation tasks with a 6-DoF UR5, 7-DoF Franka, and 14-DoF PR2 under three distinct Riemannian metrics show that our heuristic produces consistently tighter informed sets than both the Euclidean and scalar eigenvalue bounds, accelerating convergence across multiple state-of-the-art asymptotically optimal planners.
Comments: Submitted to IEEE Robotics and Automation Letters (RA-L)
Subjects:
Robotics (cs.RO)
Cite as: arXiv:2606.02879 [cs.RO]
(or arXiv:2606.02879v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2606.02879
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Phone Thiha Kyaw [view email] [v1] Mon, 1 Jun 2026 20:51:01 UTC (1,386 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds, by Phone Thiha Kyaw and Jonathan Kelly
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.RO
new | recent | 2026-06
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
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.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)