Estimating Symmetric, Positive Definite Matrices in Robotic Control
نویسندگان
چکیده
In a number of contexts relevant to control problems, including estimation of robot dynamics, covariance, and smart structure mass and stiffness matrices, we need to solve an over-determined set of linear equations AX ≈ B with the constraint that the matrix X be symmetric and positive definite. In the classical least squares method, the measurements of A are assumed to be free of error. Hence, all errors are confined to B. Thus, the “optimal” solution is given by minimizing ‖AX − B‖F . However, this assumption is often impractical. Sampling errors, modeling errors, and, sometimes, human errors bring inaccuracies to A as well. In this paper, we introduce a different optimization criterion, based on area, which takes the errors in both A and B into consideration. The analytic expression of the global optimizer is derived. The algorithm is applied to identify the joint space mass-inertia matrix of a Gough-Stewart platform. Experimental results indicate that the new approach is practical, and improves performance. Keywords— Mass-inertia estimation, covariance estimation, stiffness estimation, symmetric positive definite matrix.
منابع مشابه
A Schur–based algorithm for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of symmetric positive definite Toeplitz matrices. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...
متن کاملA fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...
متن کاملSQP algorithms for solving Toeplitz matrix approximation problem
The problem we are interested in is the best approximation of a given matrix by a positive semi–definite symmetric Toeplitz matrix. Toeplitz matrices appear naturally in a variety of problems in engineering. Since positive semi–definite Toeplitz matrices can be viewed as shift invariant autocorrelation matrices, considerable attention has been paid to them, especially in the areas of stochastic...
متن کاملar X iv : m at h / 02 09 39 9 v 1 [ m at h . R A ] 2 9 Se p 20 02 SYMMETRIC WORD EQUATIONS IN TWO POSITIVE DEFINITE LETTERS
A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fixed B, we can view a symmetric word, S(A, B), as a map from the set of positive definite matrices into itself. Given positive definite P , B, and a symmetric word, S(A, B), with positive powers of A, ...
متن کاملDeconvolution Density Estimation on Spaces of Positive Definite Symmetric Matrices
Motivated by applications in microwave engineering and diffusion tensor imaging, we study the problem of deconvolution density estimation on the space of positive definite symmetric matrices. We develop a nonparametric estimator for the density function of a random sample of positive definite matrices. Our estimator is based on the Helgason-Fourier transform and its inversion, the natural tools...
متن کامل