Efficient Event-Driven Forward Kinematics of Open Kinematic Chains with O(Log n) Complexity
Efficient Event-Driven Forward Kinematics of Open Kinematic Chains with O(Log n) Complexity
复制标题
复杂度为 O(Log n) 的开放运动链的高效事件驱动正向运动学
DOI:
10.1109/icra.2018.8461211
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Kuniyoshi Yasuo
中科院分区:
文献类型:
--
作者:
Wakatabe Ryo;Morita Kohei;Cheng Gordon;Kuniyoshi Yasuo
This paper presents novel event-driven forward kinematics algorithms for open kinematic chains with O(log n) complexity. This event-driven algorithm can efficiently update forward kinematics only when new sensory data comes. This will also contribute to localization of computational resources at sensitive joints to the position of the endpoint (e.g. a fingertip), like a root joint. We constructed 3 event-driven FK algorithms. We proved that the algorithms have the complexity of O(logn) for updating 1 joint angle, and O(logn) for obtaining a homogeneous transformation matrix between links. We compared the 3 algorithms with a conventional forward kinematics algorithm in the viewpoint of complexity, computation time, time-variance and algebraic structures. The results showed that the computation time is well adequate for real-time computation. Computation time is less than 2 us per 1 query, for 40,000 kinematic chains.
DOI:
10.1109/robot.2002.1013413
发表时间:
2002
期刊:
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
影响因子:
--
作者:
K. Yamane;Yoshihiko Nakamura
通讯作者:
Yoshihiko Nakamura
DOI:
10.1109/iscas.2014.6865717
发表时间:
2014
期刊:
2014 IEEE International Symposium on Circuits and Systems (ISCAS)
影响因子:
--
作者:
Stefano Caviglia;M. Valle;C. Bartolozzi
通讯作者:
C. Bartolozzi
DOI:
--
发表时间:
1984
期刊:
IEEE Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
R. Tarjan;U. Vishkin
通讯作者:
U. Vishkin