Abstract

This paper presents a new geometric algorithm to efficiently compute the analytical differentiation of the Articulated-body Algorithm (ABA) with respect to the state variables. Despite the fact that ABA solves the forward-dynamics problem in linear time for branched-multibody systems, its explicit differentiation is not straightforward, and computationally demanding tensor products and contractions appear. The proposed algorithm makes use of Lie algebraic and multilinear operations to recursively exploit the underlying sparsity of the linearization problem. As a result, the arithmetic complexity is dramatically reduced without affecting the analytical solution. Since the linealization of forward dynamics is of great importance in robot-trajectory optimization, a differential dynamic programming solver is employed to demonstrate the performance of our algorithm with humanoid robot models such as NAO and HRP-2. In addition, we provide the computational cost with different robots using an optimized C++ implementation that can be found at https://github.com/garechav/geombd_crtp.git .

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.