Optimal least-squares solution to the hand-eye calibration problem
- URL: http://arxiv.org/abs/2002.10838v2
- Date: Tue, 19 May 2020 15:14:39 GMT
- Title: Optimal least-squares solution to the hand-eye calibration problem
- Authors: Amit Dekel, Linus H\"arenstam-Nielsen, Sergio Caccamo
- Abstract summary: We propose a least-squares formulation to the noisy hand-eye calibration problem using dual-quaternions.
We introduce efficient algorithms to find the exact optimal solution, based on analytic properties of the problem, avoiding non-linear optimization.
- Score: 3.6525095710982916
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a least-squares formulation to the noisy hand-eye calibration
problem using dual-quaternions, and introduce efficient algorithms to find the
exact optimal solution, based on analytic properties of the problem, avoiding
non-linear optimization. We further present simple analytic approximate
solutions which provide remarkably good estimations compared to the exact
solution. In addition, we show how to generalize our solution to account for a
given extrinsic prior in the cost function. To the best of our knowledge our
algorithm is the most efficient approach to optimally solve the hand-eye
calibration problem.
Related papers
- Predict-Then-Optimize by Proxy: Learning Joint Models of Prediction and
Optimization [59.386153202037086]
Predict-Then- framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving.
This approach can be inefficient and requires handcrafted, problem-specific rules for backpropagation through the optimization step.
This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by predictive models.
arXiv Detail & Related papers (2023-11-22T01:32:06Z) - Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
We present an end-to-end method to learn the proximal operator across non-family problems.
We show that for weakly-ized objectives and under mild conditions, the method converges globally.
arXiv Detail & Related papers (2022-01-28T05:53:28Z) - Outlier-Robust Sparse Estimation via Non-Convex Optimization [73.18654719887205]
We explore the connection between high-dimensional statistics and non-robust optimization in the presence of sparsity constraints.
We develop novel and simple optimization formulations for these problems.
As a corollary, we obtain that any first-order method that efficiently converges to station yields an efficient algorithm for these tasks.
arXiv Detail & Related papers (2021-09-23T17:38:24Z) - Saddle Point Optimization with Approximate Minimization Oracle and its
Application to Robust Berthing Control [7.347989843033034]
We propose an approach to saddle point optimization relying only on oracles that solve minimization problems approximately.
We analyze its convergence property on a strongly convex--concave problem and show its linear convergence toward the global min-max saddle point.
An implementation of the developed approach using the (1+1)-CMA-ES as the minimization oracle, namely Adversarial-CMA-ES, is shown to outperform several existing approaches on test problems.
arXiv Detail & Related papers (2021-05-25T00:08:47Z) - PAMELI: A Meta-Algorithm for Computationally Expensive Multi-Objective
Optimization Problems [0.0]
The proposed algorithm is based on solving a set of surrogate problems defined by models of the real one.
Our algorithm also performs a meta-search for optimal surrogate models and navigation strategies for the optimization landscape.
arXiv Detail & Related papers (2021-03-19T11:18:03Z) - Learning the Solution Manifold in Optimization and Its Application in
Motion Planning [4.177892889752434]
We learn manifold on the variable such as the variable such model represents an infinite set of solutions.
In our framework, we reduce problem estimation by using this importance.
We apply to motion-planning problems, which involve the optimization of high-dimensional parameters.
arXiv Detail & Related papers (2020-07-24T08:05:36Z) - Follow the bisector: a simple method for multi-objective optimization [65.83318707752385]
We consider optimization problems, where multiple differentiable losses have to be minimized.
The presented method computes descent direction in every iteration to guarantee equal relative decrease of objective functions.
arXiv Detail & Related papers (2020-07-14T09:50:33Z) - Automatically Learning Compact Quality-aware Surrogates for Optimization
Problems [55.94450542785096]
Solving optimization problems with unknown parameters requires learning a predictive model to predict the values of the unknown parameters and then solving the problem using these values.
Recent work has shown that including the optimization problem as a layer in a complex training model pipeline results in predictions of iteration of unobserved decision making.
We show that we can improve solution quality by learning a low-dimensional surrogate model of a large optimization problem.
arXiv Detail & Related papers (2020-06-18T19:11:54Z) - Convergence of adaptive algorithms for weakly convex constrained
optimization [59.36386973876765]
We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope.
Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
arXiv Detail & Related papers (2020-06-11T17:43:19Z) - Tightly Robust Optimization via Empirical Domain Reduction [22.63829081634384]
We propose an algorithm to determine the scale such that the solution has a good objective value.
Under some regularity conditions, the scale obtained by our algorithm is $O(sqrtn)$, whereas the scale obtained by a standard approach is $O(sqrtd/n)$.
arXiv Detail & Related papers (2020-02-29T12:24:56Z)
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.