Kinematically started efficient position analysis of deformed compliant mechanisms utilizing data of standard joints

Koen Dwarshuis*, Ronald Aarts, Marcel Ellenbroek, Dannis Brouwer

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
190 Downloads (Pure)

Abstract

Topology optimization of a flexure-based mechanism requires the properties of the mechanism in several deformed configurations. This paper presents a fast and accurate method to compute these configurations. It is generally applicable on mechanisms with complex standard flexure joints. First kinematic equations of the mechanism are derived by allowing the mechanism to move only in the directions for which it is designed. Secondly the configurations of the joints are approximated based on the rotations of the elements by which the joints are modeled. These orientations are obtained by a parameterization based on a priori knowledge of standard flexure joints. Finally, the resulting approximation is used as initial guess to obtain the configuration accurately, after which relevant properties like stiffness can be derived. For a manipulator with three complex joints the computation time was reduced up to a factor of 65 compared to a conventional method. When for optimization purposes an approximation is acceptable, the computation time can be reduced by a factor of 600, using a linear description of the deformation that remains in the first part of the method.

Original languageEnglish
Article number103911
JournalMechanism and machine theory
Volume152
Early online date4 Jun 2020
DOIs
Publication statusPublished - Oct 2020

Keywords

  • UT-Hybrid-D
  • Design optimization
  • Flexures
  • Kinematic modeling
  • Large deflections
  • Model reduction
  • Compliant mechanism

Fingerprint

Dive into the research topics of 'Kinematically started efficient position analysis of deformed compliant mechanisms utilizing data of standard joints'. Together they form a unique fingerprint.

Cite this