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
期刊:
2018 IEEE International Conference on Robotics and Automation (ICRA)
影响因子:
--
通讯作者:
Kuniyoshi Yasuo
Kuniyoshi Yasuo
中科院分区:
--
文献类型:
--
作者:
Wakatabe Ryo;Morita Kohei;Cheng Gordon;Kuniyoshi Yasuo

文献摘要

参考文献

相似文献

提出了一种新的基于事件驱动的开放运动链正解算法,其复杂度为O(log n)。这种事件驱动的算法可以有效地更新正向运动学只有当新的传感器数据来。这也将有助于将敏感关节处的计算资源定位到端点(例如,指尖)的位置,如根关节。我们构造了3个事件驱动的FK算法。我们证明了算法的复杂度为O(logn)更新1关节角度,和O(logn)获得齐次变换矩阵之间的链接。从算法复杂度、计算时间、时变性和代数结构等方面与传统的正运动学算法进行了比较。结果表明,计算时间是足够的实时计算。对于40,000个运动链,每个查询的计算时间小于2 us。
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
用于触觉传感的 POSFET 器件的异步、事件驱动读出
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