PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix
Ajay Suresha Sathya, Wilm Decré, Jan Swevers
Abstract
We present PV-OSIMr, an efficient algorithm for computing the Delassus matrix (also known as the inverse operational space inertia matrix) for a kinematic tree, with the lowest order computational complexity known in literature. PV-OSIMr is derived by optimizing the recently proposed PV-OSIM algorithm using the compositionality of the force and motion propagators. It has a computational complexity of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(n+m^{2})$</tex-math></inline-formula> compared to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ O(n + m^{2}d)$</tex-math></inline-formula> of the PV-OSIM algorithm and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(n+md +m^{2})$</tex-math></inline-formula> of the extended force propagator algorithm (EFPA), where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> is the number of joints, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$m$</tex-math></inline-formula> is the number of constraints and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$d$</tex-math></inline-formula> is the depth of the kinematic tree. Since the Delassus matrix is an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$m \times m$</tex-math></inline-formula> sized matrix and its computation must consider all the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> joints, PV-OSIMr's asymptotic computational complexity is optimal. We further benchmark our algorithm and find it to be often more efficient than the PV-OSIM and EFPA in practice.
BibTeX
@inproceedings{ral2024_pvosimralowestor,
title = {PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix},
author = {Ajay Suresha Sathya and Wilm Decré and Jan Swevers},
booktitle = {RA-L 2024},
year = {2024}
}