Computational Efficient Mechanisms

Shaoping Bai*

*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

1 Citation (Scopus)

Abstract

In this work, mechanisms that admit efficient kinematic computation are studied. The computational efficient mechanisms are a special class of linkages that their constraint equations contain lower-order terms than the ordinary linkages. The lower-order constraint equations are of lower complexity of computation and thus readily solved. In the paper, we examine the existence of such kinds of linkages. Examples of computational mechanisms are provided for the five-bar spherical linkage and the 3-RRR spherical parallel mechanism.

Original languageEnglish
Title of host publicationAdvances in Robot Kinematics 2024
EditorsJadran Lenarčič, Manfred Husty
Number of pages9
PublisherSpringer Nature
Publication date2024
Pages356-364
ISBN (Print)9783031640568
DOIs
Publication statusPublished - 2024
Event19th Symposium on Advances in Robot Kinematics, ARK 2024 - Ljubljana, Slovenia
Duration: 30 Jun 20244 Jul 2024

Conference

Conference19th Symposium on Advances in Robot Kinematics, ARK 2024
Country/TerritorySlovenia
CityLjubljana
Period30/06/202404/07/2024
SeriesSpringer Proceedings in Advanced Robotics
Volume31 SPAR
ISSN2511-1256

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

Keywords

  • computational efficiency
  • computational kinematics
  • non-orthogonal coordinate frame
  • spherical linkages
  • spherical parallel mechanisms (SPM)

Fingerprint

Dive into the research topics of 'Computational Efficient Mechanisms'. Together they form a unique fingerprint.

Cite this