Factor Graph-Based Shape Estimation for Continuum Robots via Magnus Expansion
- URL: http://arxiv.org/abs/2604.15619v1
- Date: Fri, 17 Apr 2026 01:52:07 GMT
- Title: Factor Graph-Based Shape Estimation for Continuum Robots via Magnus Expansion
- Abstract summary: This letter combines the strength of both paradigms by estimating the coefficients of a low-dimensional Geometric Variable Strain (GVS) parameterization within a factor graph framework.<n>A novel kinematic factor, derived from the Magnus expansion of the strain field, encodes the closed-form rod geometry as a prior constraint linking the GVS strain coefficients to the backbone pose variables.<n>The resulting formulation yields a compact state vector amenable directly to model-based control, while retaining the continuum, probabilistic treatment and computational efficiency of factor graph inference.
- Score: 19.359841144204115
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Reconstructing the shape of continuum manipulators from sparse, noisy sensor data is a challenging task, owing to the infinite-dimensional nature of such systems. Existing approaches broadly trade off between parametric methods that yield compact state representations but lack probabilistic structure, and Cosserat rod inference on factor graphs, which provides principled uncertainty quantification at the cost of a state dimension that grows with the spatial discretization. This letter combines the strength of both paradigms by estimating the coefficients of a low-dimensional Geometric Variable Strain (GVS) parameterization within a factor graph framework. A novel kinematic factor, derived from the Magnus expansion of the strain field, encodes the closed-form rod geometry as a prior constraint linking the GVS strain coefficients to the backbone pose variables. The resulting formulation yields a compact state vector directly amenable to model-based control, while retaining the modularity, probabilistic treatment and computational efficiency of factor graph inference. The proposed method is evaluated in simulation on a 0.4 m long tendon-driven continuum robot under three measurement configurations, achieving mean position errors below 2 mm for all three scenarios and demonstrating a sixfold reduction in orientation error compared to a Gaussian process regression baseline when only position measurements are available.
Related papers
- Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
arXiv Detail & Related papers (2026-06-01T18:28:56Z) - Mode-Shape Expansion Using Physics-Constrained Gaussian Process Regression [0.0]
This paper addresses the challenge of reconstructing full-field structural mode shapes from sparse sensor data.<n>The proposed method overcomes existing limitations in GP-based prediction, providing more accurate and reliable expanded mode shapes.
arXiv Detail & Related papers (2026-05-21T23:33:59Z) - Riemannian geometry meets fMRI: the advantages of modeling correlation manifolds and eigenvector subspaces [0.0]
Correlation matrices are fundamental summaries of functional brain networks.<n>Existing geometric methods frequently lack closed-form operations or depend on arbitrary region ordering.<n>We introduce a scalable geometric framework with two components: the Off-log metric and Grassmannian subspace discrimination.
arXiv Detail & Related papers (2026-05-21T11:22:31Z) - Topo-GS: Continuous Volumetric Embedding of High-Dimensional Data via Topological Gaussian Splatting [4.621191941382847]
Topo-GS is a framework that repurposes 3D Gaussian Splatting (3DGS) to cast multidimensional projection as a meshless volumetric reconstruction process.<n>We show that Topo-GS successfully transforms discrete scatter plots into continuous volumetric representations.
arXiv Detail & Related papers (2026-05-16T14:21:08Z) - Robust 4D Visual Geometry Transformer with Uncertainty-Aware Priors [38.939519059502025]
We present a framework designed to disentangle dynamic and static components by modeling uncertainty across different stages of the reconstruction process.<n>Our approach reduces Mean Accuracy error by 13.43% and improves segmentation F-measure by 10.49%.<n>Our framework maintains the efficiency of feed-forward inference and requires no task-specific fine-tuning or per-scene optimization.
arXiv Detail & Related papers (2026-04-10T14:36:50Z) - Constraint-Free Static Modeling of Continuum Parallel Robot [2.1933060555769073]
Continuum parallel robots (CPR) combine rigid actuation mechanisms with multiple elastic rods in a closed-loop topology.<n>This paper presents a geometric exact, configuration-based and constraint-free static model of CPR that remains valid under geometrically nonlinear, large-deformation and large-rotation conditions.
arXiv Detail & Related papers (2026-03-05T15:49:30Z) - An approach to Fisher-Rao metric for infinite dimensional non-parametric information geometry [0.6138671548064355]
Being infinite dimensional, non-parametric information geometry has long faced an "intractability barrier"<n>This paper introduces a novel framework to resolve the intractability with an Orthogonal Decomposition of the Tangent Space.<n>By defining the Information Capture Ratio, we provide a rigorous method for estimating intrinsic dimensionality in high-dimensional data.
arXiv Detail & Related papers (2025-12-25T00:18:41Z) - Enabling Probabilistic Learning on Manifolds through Double Diffusion Maps [3.081704060720176]
We present a generative learning framework for probabilistic sampling based on an extension of the Probabilistic Learning on Manifolds (PLoM) approach.<n>We solve a full-order ISDE directly in the latent space, preserving the full dynamical complexity of the system.
arXiv Detail & Related papers (2025-06-02T20:58:49Z) - Robust Second-order LiDAR Bundle Adjustment Algorithm Using Mean Squared Group Metric [5.153195958837083]
We propose a novel mean square group metric (MSGM) to build the optimization objective in the LiDAR BA algorithm.
By integrating a robust kernel function, the metrics involved in the BA algorithm are reweighted, and thus enhancing the robustness of the solution process.
arXiv Detail & Related papers (2024-09-03T12:53:39Z) - Data-free Weight Compress and Denoise for Large Language Models [96.68582094536032]
We propose a novel approach termed Data-free Joint Rank-k Approximation for compressing the parameter matrices.<n>We achieve a model pruning of 80% parameters while retaining 93.43% of the original performance without any calibration data.
arXiv Detail & Related papers (2024-02-26T05:51:47Z) - Shape And Structure Preserving Differential Privacy [70.08490462870144]
We show how the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism.
We also show how using the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism.
arXiv Detail & Related papers (2022-09-21T18:14:38Z) - Counting Phases and Faces Using Bayesian Thermodynamic Integration [77.34726150561087]
We introduce a new approach to reconstruction of the thermodynamic functions and phase boundaries in two-parametric statistical mechanics systems.
We use the proposed approach to accurately reconstruct the partition functions and phase diagrams of the Ising model and the exactly solvable non-equilibrium TASEP.
arXiv Detail & Related papers (2022-05-18T17:11:23Z) - Relative Pose from SIFT Features [50.81749304115036]
We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale.
The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
arXiv Detail & Related papers (2022-03-15T14:16:39Z) - Semiparametric Nonlinear Bipartite Graph Representation Learning with
Provable Guarantees [106.91654068632882]
We consider the bipartite graph and formalize its representation learning problem as a statistical estimation problem of parameters in a semiparametric exponential family distribution.
We show that the proposed objective is strongly convex in a neighborhood around the ground truth, so that a gradient descent-based method achieves linear convergence rate.
Our estimator is robust to any model misspecification within the exponential family, which is validated in extensive experiments.
arXiv Detail & Related papers (2020-03-02T16:40:36Z)
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.