O (logn) algorithm for forward kinematics under asynchronous sensory input

Ryo Wakatabe, Yasuo Kuniyoshi, Gordon Cheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

This paper presents a new algorithm for forward kinematics, called Asynchronous Forward Kinematics (AFK). The algorithm has the complexity of O(log n) for updating one joint angle, and O(logn) for obtaining a homogeneous transformation matrix between links. AFK enables computation for efficient forward kinematics under asynchronous sensory data. Moreover, AFK peovides localise computational resources at sensitive joints to the position of the endpoint (e.g. a fingertip), like a root joint. We provide comparative results including computation time, evaluating AFK against the conventional forward kinematics (CFK). The results showed that the computation time is well adequate for real-time computation. Computation time for 100 links takes less than 20 us for 1 query. Moreover, computation time with over 50000 links takes less than 35 us for 1 query.

Original languageEnglish
Title of host publicationICRA 2017 - IEEE International Conference on Robotics and Automation
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2502-2507
Number of pages6
ISBN (Electronic)9781509046331
DOIs
StatePublished - 21 Jul 2017
Event2017 IEEE International Conference on Robotics and Automation, ICRA 2017 - Singapore, Singapore
Duration: 29 May 20173 Jun 2017

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
Volume0
ISSN (Print)1050-4729

Conference

Conference2017 IEEE International Conference on Robotics and Automation, ICRA 2017
Country/TerritorySingapore
CitySingapore
Period29/05/173/06/17

Fingerprint

Dive into the research topics of 'O (logn) algorithm for forward kinematics under asynchronous sensory input'. Together they form a unique fingerprint.

Cite this