0
Research Papers

Autogenerating/Drawing Valid Arrays and Contracted Graphs With Pentagonal Links for Type Synthesis of Mechanism by Computer Aided Design

[+] Author and Article Information
Yi Lu

Professor
College of Mechanical Engineering,
Yanshan University,
Qinhuangdao, Hebei 066004, China;
Parallel Robot and Mechatronic
System Laboratory of Hebei province,
Key Laboratory of Advanced Forging and
Stamping Technology and
Science of Ministry of National Education,
Yanshan University,
Qinhuangdao, Hebei 066004, China
e-mail: luyi@ysu.edu.cn

Hui Huang

College of Mechanical Engineering,
Yanshan University,
Qinhuangdao, Hebei 066004, China
e-mail: xiaobao1810@163.com

Yang Lu

e-mail: deersheepxn@163.com

Nijia Ye

e-mail: nijiareborn@163.com
Harbin Electric Corporation (QHD),
Heavy Equipment Company Limited,
Qinhuangdao, Hebei 066206, China

1Corresponding author.

Contributed by the Mechanisms and Robotics Committee of ASME for publication in the JOURNAL OF MECHANISMS AND ROBOTICS. Manuscript received March 14, 2012; final manuscript received January 6, 2013; published online September 11, 2013. Assoc. Editor: Delun Wang.

J. Mechanisms Robotics 5(4), 041007 (Sep 11, 2013) (8 pages) Paper No: JMR-12-1029; doi: 10.1115/1.4024920 History: Received March 14, 2012; Revised January 06, 2013

A method for autogeneration/draw of valid arrays and contracted graphs by cad is studied in this paper. First, the concepts and relative new criteria of arrays and contracted graphs (CGs) are explained for the representation/generation of the CGs and the identification of the isomorphic/invalid CGs using the arrays. Second, a software is created in Visual Basic for automatically generating the arrays of the CGs with pentagonal links, identifying the isomorphic/invalid arrays, generating the valid arrays, and automatically drawing their CGs. Third, the interface of the software and the main functions of the compiled programs are explained. Finally, some examples are given to illustrate this software and method.

FIGURES IN THIS ARTICLE
<>
Copyright © 2013 by ASME
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Fig. 1

Some CGs with 2P + 2Q, P + 5T

Grahic Jump Location
Fig. 2

A main interface of software (a, d), A subwindow (b, c)

Grahic Jump Location
Fig. 3

A subprogram flow of generating the whole queues

Grahic Jump Location
Fig. 4

A subprogram flow of generating array matrix

Grahic Jump Location
Fig. 5

A tree for generating the whole arrays of PQPQ

Grahic Jump Location
Fig. 6

A flow diagram of program for generating arrays in which the last digit of the jth string is the 1st digit of the (j + 1)th string (a) and its subprogram for j = 4 (b)

Grahic Jump Location
Fig. 7

and a flow diagram of its subprogram for j = 4

Grahic Jump Location
Fig. 8

A flow diagram of subprogram for removing arrays

Grahic Jump Location
Fig. 9

A subprogram flow for removing the nonpair arrays

Grahic Jump Location
Fig. 10

A flow diagram of subprogram for identifying ordering isomorphic arrays

Grahic Jump Location
Fig. 11

Four CGs and the PMs

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In