Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-18T13:06:06.894Z Has data issue: false hasContentIssue false
  • English
  • Français

A recursive approach for the analysis of snake robots using Kane's equations

Published online by Cambridge University Press:  28 March 2006

H. Tavakoli Nia ,
H. N. Pishkenari  and
A. Meghdari
H. Tavakoli Nia
Affiliation:
Center of Excellence in Design, Robotics and Automation (CEDRA), School of Mechanical Engineering, Sharif University of Technology, Tehran (Iran)
H. N. Pishkenari
Affiliation:
Center of Excellence in Design, Robotics and Automation (CEDRA), School of Mechanical Engineering, Sharif University of Technology, Tehran (Iran)
A. Meghdari
Affiliation:
Center of Excellence in Design, Robotics and Automation (CEDRA), School of Mechanical Engineering, Sharif University of Technology, Tehran (Iran)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents a recursive approach for solving kinematic and dynamic problems 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.

Keywords

Snake robotNonholonomic constraintsKane's equationsComputational efficiency
Type
Article
Information
Robotica , Volume 24 , Issue 2 , March 2006 , pp. 251 - 256
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)