Title

Kinematic Synthesis For Infinitesimally And Multiply Separated Positions Using Geometric Constraint Programming

Abstract

Geometric Constraint Programming (GCP) is an approach to synthesizing planar mechanisms in the sketching mode of commercial parametric computer-aided design software by imposing geometric constraints using the software's existing graphical user interface. GCP complements the accuracy of analytical methods with the intuition developed from graphical methods. Its applicability to motion generation, function generation, and path generation for finitely separated positions has been previously reported. This paper demonstrates how GCP can be applied to kinematic synthesis for motion generation involving infinitesimally and multiply separated positions. For these cases, the graphically imposed geometric constraints alone will in general not provide a solution, so the designer must parametrically relate dimensions of entities within the graphical construction to achieve designs that automatically update when a defining parameter is altered. For three infinitesimally separated positions, the designer constructs an acceleration polygon to locate the inflection circle defined by the desired motion state. With the inflection circle in place, the designer can rapidly explore the design space using the graphical second Bobillier construction. For multiply separated position problems in which only two infinitesimally separated positions are considered, the designer constrains the instant center of the mechanism to be in the desired location. Example four-bar linkages are designed using these techniques with three infinitesimally separated positions and two different combinations of four multiply separated positions. Copyright © 2011 by ASME.

Publication Date

12-1-2011

Publication Title

Proceedings of the ASME Design Engineering Technical Conference

Volume

6

Issue

PARTS A AND B

Number of Pages

435-443

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1115/DETC2011-48201

Socpus ID

84863569050 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84863569050

This document is currently not available here.

Share

COinS