Real-time computational complexity of the algorithms for a single link manipulator system

M. A. Hossain, M. N.H. Siddique, M. O. Tokhi, M. S. Alam

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

Abstract

This paper presents an investigation into the real-time computational complexity of the algorithms for a single link manipulator system. A dynamic simulation algorithm of a single link manipulator system using finite difference (FD) method is considered to demonstrate the real-time computational complexity. The simulation algorithm of the manipulator system is analyzed, designed in various forms and implemented to explore the impact in implementing real-time. Finally, a comparative real-time computing performance of various forms of the new and previously reported algorithms is presented and discussed to demonstrate the merits of different design mechanisms through a set of experiments.

Original languageEnglish
Title of host publicationAdvances in Climbing and Walking Robots - Proceedings of 10th International Conference, CLAWAR 2007
PublisherWorld Scientific Publishing Co. Pte Ltd
Pages726-735
Number of pages10
ISBN (Print)9812708154, 9789812708151
DOIs
StatePublished - 2007
Externally publishedYes
Event10th International Conference on Climbing and Walking Robots, CLAWAR 2007 - Singapore, Singapore
Duration: 16 Jul 200718 Jul 2007

Publication series

NameAdvances in Climbing and Walking Robots - Proceedings of 10th International Conference, CLAWAR 2007

Conference

Conference10th International Conference on Climbing and Walking Robots, CLAWAR 2007
Country/TerritorySingapore
CitySingapore
Period16/07/0718/07/07

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction

Fingerprint

Dive into the research topics of 'Real-time computational complexity of the algorithms for a single link manipulator system'. Together they form a unique fingerprint.

Cite this