Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T18:24:42.465Z Has data issue: false hasContentIssue false

Optimum design of parallel kinematic toolheads with genetic algorithms

Published online by Cambridge University Press:  05 January 2004

Dan Zhang
Affiliation:
Integrated Manufacturing Technologies Institute, National Research Council Canada, London, Ontario (Canada) N6G 4X8
Zhengyi Xu
Affiliation:
Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario (Canada) M5S 3G8
Chris M Mechefske
Affiliation:
Department of Mechanical Engineering, Queen's University, Kingston, Ontario (Canada) K7L 3N6
Fengfeng Xi
Affiliation:
Department of Mechanical, Aerospace and Industrial Engineering, Ryerson University, Toronto, Ontario (Canada) M5B 2K3

Abstract

In this paper, the optimum design of parallel kinematic toolheads is implemented using genetic algorithms with the consideration of the global stiffness and workspace volume of the toolheads. First, a complete kinetostatic model is developed which includes three types of compliance, namely, actuator compliance, leg bending compliance and leg axial compliance. Second, based on this model, two kinetostatic performance indices are introduced to provide a new means of measuring compliance over the workspace. These two kinetostatic performance indices are the mean value and the standard deviation of the trace of the generalized compliance matrix. The mean value represents the average compliance of the Parallel Kinematic Machines over the workspace, while the standard deviation indicates the compliance fluctuation relative to the mean value. Third, design optimization is implemented for global stiffness and working volume based on kinetostatic performance indices. Additionally, some compliance comparisons between Tripod toolhead and other two principal Tripod-based Parallel Kinematic Machines are conducted.

Type
Research Article
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)