ArXiv TLDR

State and Trajectory Estimation of Tensegrity Robots via Factor Graphs and Chebyshev Polynomials

🐦 Tweet
2604.08185

Edgar Granados, Patrick Meng, Charles Tang, Shrimed Sangani, William R. Johnson + 2 more

cs.RO

TLDR

This paper proposes a novel factor-graph-based method using Chebyshev polynomials for robust state and trajectory estimation of tensegrity robots.

Key contributions

  • Introduces a novel factor-graph-based method for tensegrity robot state/trajectory estimation.
  • Fuses RGB-D camera and cable length sensor data, exploiting robot structural properties.
  • Utilizes Mahalanobis distance clustering and Chebyshev polynomials for robust estimation.
  • Achieves high-fidelity, continuous-time estimates for complex motions on real-world data.

Why it matters

Tensegrity robots are challenging to control due to their complex dynamics. This work provides a robust, continuous-time state estimation solution crucial for their control and further development. By leveraging factor graphs and advanced polynomial methods, it enables more reliable operation and future applications.

Original Abstract

Tensegrity robots offer compliance and adaptability, but their nonlinear, and underconstrained dynamics make state estimation challenging. Reliable continuous-time estimation of all rigid links is crucial for closed-loop control, system identification, and machine learning; however, conventional methods often fall short. This paper proposes a two-stage approach for robust state or trajectory estimation (i.e., filtering or smoothing) of a cable-driven tensegrity robot. For online state estimation, this work introduces a factor-graph-based method, which fuses measurements from an RGB-D camera with on-board cable length sensors. To the best of the authors' knowledge, this is the first application of factor graphs in this domain. Factor graphs are a natural choice, as they exploit the robot's structural properties and provide effective sensor fusion solutions capable of handling nonlinearities in practice. Both the Mahalanobis distance-based clustering algorithm, used to handle noise, and the Chebyshev polynomial method, used to estimate the most probable velocities and intermediate states, are shown to perform well on simulated and real-world data, compared to an ICP-based algorithm. Results show that the approach provides high fidelity, continuous-time state and trajectory estimates for complex tensegrity robot motions.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.