A Unified Calibration Framework for Coordinate and Kinematic Parameters in Dual-Arm Robots

• URL: http://arxiv.org/abs/2603.14809v1
• Date: Mon, 16 Mar 2026 04:25:40 GMT
• Title: A Unified Calibration Framework for Coordinate and Kinematic Parameters in Dual-Arm Robots
• Abstract summary: We present a novel framework for unified calibration of the coordinate transformations and kinematic parameters in both robot arms.<n>Our key idea is to unify all the tightly coupled parameters within a single Lie-algebraic formulation.<n>Our algorithm can yield a reliable estimate whose near-global optimality can be verified a posteriori.
• Score: 23.991712799218217
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Precise collaboration in vision-based dual-arm robot systems requires accurate system calibration. Recent dual-robot calibration methods have achieved strong performance by simultaneously solving multiple coordinate transformations. However, these methods either treat kinematic errors as implicit noise or handle them through separated error modeling, resulting in non-negligible accumulated errors. In this paper, we present a novel framework for unified calibration of the coordinate transformations and kinematic parameters in both robot arms. Our key idea is to unify all the tightly coupled parameters within a single Lie-algebraic formulation. To this end, we construct a consolidated error model grounded in the product-of-exponentials formula, which naturally integrates the coordinate and kinematic parameters in twist forms. Our model introduces no artificial error separation and thus greatly mitigates the error propagation. In addition, we derive a closed-form analytical Jacobian from this model using Lie derivatives. By exploring the Jacobian rank property, we analyze the identifiability of all calibration parameters and show that our joint optimization is well-posed under mild conditions. This enables off-the-shelf iterative solvers to stably optimize these parameters on the manifold space. Besides, to ensure robust convergence of our joint optimization, we develop a certifiably correct algorithm for initializing the unknown coordinates. Relying on semidefinite relaxation, our algorithm can yield a reliable estimate whose near-global optimality can be verified a posteriori. Extensive experiments validate the superior accuracy of our approach over previous baselines under identical visual measurements. Meanwhile, our certifiable initialization consistently outperforms several coordinate-only baselines, proving its reliability as a starting point for joint optimization.

Related papers

• PLS-Calib: A Partial Least Squares Framework for Event Camera and Odometry Calibration under Ground Motion Constraints [27.568640844773338]
  Most existing calibration techniques rely on full 6-DoF motion to excite all degrees of freedom.<n>We present a novel rotation calibration framework named PLS-Calib.<n>We show significant improvements in calibration robustness and accuracy over state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-08-04T08:07:07Z)
• Zeta: Dual Whitening for Matrix Optimization via Coordinate-Adaptive Preconditioning [56.24532075189964]
  We propose Zeta, a dual whitening that applies coordinate whitening and spectral whitening in a strictly ordered pipeline.<n>We prove that Zeta matches or surpasses strong baselines across language modeling (0.6B to 8B parameters), mixture-of-experts architectures, and vision tasks.
  arXiv  Detail & Related papers  (2026-06-12T07:10:17Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Sensor Design for Accuracy-Bounded Estimation via Maximum-Entropy Likelihood Synthesis [0.0]
  Given an error budget, we synthesize the measurement likelihood that enforces it while injecting minimal information beyond the dynamical prior.<n>The framework accommodates arbitrary discrepancies and is instantiated for Wasserstein distance, mean discrepancy, $f$divergences, moment constraints, and hybrid metrics.
  arXiv  Detail & Related papers  (2026-05-11T18:28:45Z)
• Optimal Uncertainty-Aware Calibration for the AX=YB Problem [7.193339960011095]
  This article proposes a general optimization framework for solving hand-eye calibration problem.<n>An iterative algorithm based on Lie algebra that achieves approximately global optimal solutions is developed.<n> Numerical simulations and real-world experiments validate the effectiveness of the proposed approach.
  arXiv  Detail & Related papers  (2026-05-06T12:00:03Z)
• DLBAcalib: Robust Extrinsic Calibration for Non-Overlapping LiDARs Based on Dual LBA [11.721420447780032]
  This paper presents a novel targetless extrinsic calibration framework for multi-LiDAR systems.<n>The proposed method constructs an accurate reference point cloud map via continuous scanning from the target LiDAR.<n>Our framework achieves an average translational error of 5 mm and a rotational error of 0.2deg, with an initial error tolerance of up to 0.4 m/30deg.
  arXiv  Detail & Related papers  (2025-07-12T07:48:02Z)
• Towards Initialization-free Calibrated Bundle Adjustment [8.698137120086065]
  We present a method that is able to use the known camera calibration thereby producing near metric solutions.<n>Our method can be seen as integrating rotation averaging into the pOSE framework.
  arXiv  Detail & Related papers  (2025-06-30T12:55:44Z)
• Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models [57.52124921268249]
  We propose a Trust Sequential Quadratic Programming method to find both first and second-order stationary points. To converge to first-order stationary points, our method computes a gradient step in each iteration defined by minimizing a approximation of the objective subject. To converge to second-order stationary points, our method additionally computes an eigen step to explore the negative curvature the reduced Hessian matrix.
  arXiv  Detail & Related papers  (2024-09-24T04:39:47Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid 3D Registration [77.13381026159111]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration.<n>The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Differentiable DG with Neural Operator Source Term Correction [0.0]
  We introduce an end-to-end differentiable framework for solving the compressible Navier-Stokes equations.<n>This integrated approach combines a differentiable discontinuous Galerkin solver with a neural network source term.<n>We demonstrate the performance of the proposed framework through two examples.
  arXiv  Detail & Related papers  (2023-10-29T04:26:23Z)
• Globally Optimal Multi-Scale Monocular Hand-Eye Calibration Using Dual Quaternions [9.287964414592826]
  We present an approach for monocular hand-eye calibration from per-sensor ego-motion based on dual quaternions. Our algorithms are evaluated and compared to state-of-the-art approaches on simulated and real-world data.
  arXiv  Detail & Related papers  (2022-01-12T13:48:04Z)
• Square Root Bundle Adjustment for Large-Scale Reconstruction [56.44094187152862]
  We propose a new formulation for the bundle adjustment problem which relies on nullspace marginalization of landmark variables by QR decomposition. Our approach, which we call square root bundle adjustment, is algebraically equivalent to the commonly used Schur complement trick. We show in real-world experiments with the BAL datasets that even in single precision the proposed solver achieves on average equally accurate solutions.
  arXiv  Detail & Related papers  (2021-03-02T16:26:20Z)
• Neural Control Variates [71.42768823631918]
  We show that a set of neural networks can face the challenge of finding a good approximation of the integrand. We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice. Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
  arXiv  Detail & Related papers  (2020-06-02T11:17:55Z)

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.