Enumeration of Optimal Pin-Jointed Bistable Compliant Mechanisms with Non-Crossing Members

Authors

M. Ohsaki, Kyoto University
N. Katoh, Kyoto University
T. Kinoshita, Kyoto University
S. Tanigawa, Kyoto University
D. Avis, Université McGill
I. Streinu, Smith CollegeFollow

Document Type

Article

Publication Date

2-1-2009

Publication Title

Structural and Multidisciplinary Optimization

Abstract

An optimization approach is presented for enumerating pin-jointed bistable compliant mechanisms. In the first stage, the statically determinate trusses with non-crossing members containing a given set of nodes and some pre-defined members are regarded as minimally rigid framework or a Laman framework, and are enumerated without repetitions by the graph enumeration algorithm. In the second stage, the nodal locations and the cross-sectional areas are optimized under mechanical constraints, where the snapthrough behavior is extensively utilized to produce a pin-jointed bistable compliant mechanism. In the numerical examples, many bistable compliant mechanisms are generated to show the effectiveness of the proposed method. © 2008 Springer-Verlag.

Keywords

Bistable structure, Compliant mechanism, Minimally rigid framework, Snapthrough

Volume

37

Issue

6

First Page

645

Last Page

651

DOI

10.1007/s00158-008-0258-z

ISSN

1615147X

Comments

Archived as published.

Recommended Citation

Ohsaki, M.; Katoh, N.; Kinoshita, T.; Tanigawa, S.; Avis, D.; and Streinu, I., "Enumeration of Optimal Pin-Jointed Bistable Compliant Mechanisms with Non-Crossing Members" (2009). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/293