期刊
MECHANISM AND MACHINE THEORY
卷 107, 期 -, 页码 324-337出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mechmachtheory.2016.09.016
关键词
Walking robots; Position model; Computational complexity
资金
- National Basic Research Program of China [2013CB035501]
This article studies computational complexity of kinematic models for 2 patterns of 1UP-2UPS parallel mechanisms. These mechanisms are designed for hexapod walking robots applying real time control systems, which require the computing speed of kinematic models to be as swift as possible. The difference of these 2 patterns is that rotational axes of universal joints on limb 1 are reversed. In this paper, both forward and inverse kinematic models are formulated and it will be shown that both pattern I and II have analytical solutions for inverse kinematic problems. However, the forward models can be derived to univariate polynomial equations with different orders: 8th for pattern I and 4th for pattern II. It is known that the highest degree of polynomials can be solved analytically is 4, thus the computational complexity of pattern I is much higher than pattern II. In our prototypes, the forward kinematic model of pattern I costs 10 times more time than pattern II, hence pattern II is preferred for mobile robots.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据