A Recursive Approach for Analysis of Snake Robots Using Kane’s Equations
Keyword(s):
Cpu Time
◽
This paper presents a recursive approach for solving kinematic and dynamic problem in snake-like robots using Kane’s equations. An n-link model with n-nonholonomic constraints is used as the snake robot model in our analysis. The proposed algorithm which is used to derive kinematic and dynamic equations recursively enhances the computational efficiency of our analysis. Using this method we can determine the number of additions and multiplications as a function of n. The proposed method is compared with the Lagrange and Newton-Euler’s method in three different aspects: Number of operations, CPU time and error in the computational procedures.