Function Generation With Finitely-Separated Precision Points Using Geometric Constraint Programming

Author(s):  
Edward C. Kinzel ◽  
James P. Schmiedeler ◽  
Gordon R. Pennock

This paper explains how Geometric Constraint Programming can be applied to solve function generation problems with finitely-separated positions using a number of different mechanisms. Geometric Constraint Programming uses the sketching mode of commercial parametric computer-aided design software to create kinematic diagrams whose elements are parametrically related so that when a parameter is changed, the design is modified automatically. Geometric constraints are imposed graphically through the user interface, and the numerical solvers integrated into the software solve the relevant systems of non-linear equations without the user explicitly formulating those equations. A key advantage of using Geometric Constraint Programming for function generation is that the same approach can be applied to any mechanism, so no unique algorithms are required. Furthermore, because the implementation is relatively straightforward regardless of the chosen mechanism, the designer can quickly and easily generate solutions for a large number of precision points and/or with complex mechanisms to provide a very accurate match to the desired function. Examples of function generation with a four-bar linkage, a six-bar linkage, and a seven-bar linkage illustrate the benefits of the proposed methodology.

Author(s):  
James P. Schmiedeler ◽  
Barrett C. Clark ◽  
Edward C. Kinzel ◽  
Gordon R. Pennock

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.


2006 ◽  
Vol 129 (11) ◽  
pp. 1185-1190 ◽  
Author(s):  
Edward C. Kinzel ◽  
James P. Schmiedeler ◽  
Gordon R. Pennock

This paper extends geometric constraint programming (GCP) to function generation problems involving large numbers of finitely separated precision points and complex mechanisms. In parametric design software, GCP uses the sketching mode to graphically impose geometric constraints in kinematic diagrams and the numerical solvers to solve the relevant nonlinear equations without the user explicitly formulating them. For function generation, the same approach can be applied to any mechanism, requiring no unique algorithms. Implementation is straightforward, so the designer can quickly generate solutions for a large number of precision points and/or with complex mechanisms to accurately match the function. Examples of function generation with a four-bar linkage, a Stephenson III six-bar linkage, and a seven-bar linkage with a mobility of two are presented.


2014 ◽  
Vol 136 (3) ◽  
Author(s):  
James P. Schmiedeler ◽  
Barrett C. Clark ◽  
Edward C. Kinzel ◽  
Gordon R. Pennock

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. By implementing existing, well-known theory, this technical brief 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. For example, four-bar linkages are designed using these techniques with three infinitesimally separated positions and two different combinations of four multiply separated positions. The ease of implementing the techniques may make synthesis for infinitesimally and multiply separated positions more accessible to mechanism designers and undergraduate students.


Author(s):  
Anurag Purwar ◽  
Abhijit Toravi ◽  
Q. J. Ge

This paper presents our recent work on designing and developing a geometric constraint based motion design software system for planar four-bar linkages. Given a motion task, the software computes possible four-bar linkage topologies as well as its dimensions. This capability to analyze the given task and find the best type of the linkage and the dimensions simultaneously sets it apart from any other linkage design software. The Four-Bar Motion Design System (4MDS) makes the synthesis and simulation capabilities available to mechanism designers in an intuitive graphical user interface (GUI) environment. Instead of taking a black box approach to mechanism design, wherein the user simply enters the motion requirements and the software outputs parameters of mechanisms, this software facilitates a dialog with the designer by providing various paths to simulation and synthesis in a design session. The designer has complete control over the specification of motion task, interactive tweaking of the motion, choice of linkage topology computed, dimensional changes, and their apparent effect on motion, all done in real time. This interactivity enhances designers kinematic experience. The underlying theoretical foundation of this paper is based on our earlier work on a task-driven approach to unified type and dimensional synthesis of planar four-bar linkage mechanisms. Instead of treating a planar four-bar mechanism as a set of connected rigid links and joints, we treat them as line or circle constraint generators. With that view, the synthesis problem is reduced to extracting geometric constraints hidden in a given motion task and the simulation is reduced to assembling constraints realizable by mechanical dyads. The algorithm employed is simple and efficient and permits real-time computation, and thus precludes using a limiting database-oriented approach. This tool should make innovation of mechanical motion generating devices accessible to novice and experienced designers alike.


Author(s):  
D. Srinivas ◽  
Steven N. Kramer

Abstract The general procedure for synthesizing the rack and pinion mechanism for six precision conditions is developed. To illustrate the method, the mechanism has been synthesized in closed form for generating both four prescribed path points with input coordination and two positions of function generation. This is the extension of the work reported earlier on this mechanism where only three path precision points were satisfied. The rack and pinion mechanism has a number of advantages over the conventional four bar linkage mechanism. First, since the rack is always tangent to the pinion, the transmission angle has a constant optimum value of 90 degrees minus the pressure angle of the pinion. Second, because both translation and rotation of the rack are possible, multiple outputs are available. Generation of monotonic functions for a wide variety of motion, and nonmonotonic functions for the full range of motion as well as nonlinear motions, are other advantages of this mechanism. The rack and pinion mechanism has applications in the packaging industry, in toys, and automotive steering mechanisms. In this work, the mechanism is made to satisfy a number of practical design constraints such as a completely rotatable input crank and others. Also, structural errors for function generation are calculated to give an estimate of the accuracy of the mechanism. The method of solution developed in this work uses the complex number method of mechanism synthesis and a FORTRAN program is written to find the solutions for any input.


2005 ◽  
Vol 128 (5) ◽  
pp. 1070-1079 ◽  
Author(s):  
Edward C. Kinzel ◽  
James P. Schmiedeler ◽  
Gordon R. Pennock

This paper presents an original approach to the kinematic synthesis of planar mechanisms for finitely separated positions. The technique, referred to here as geometric constraint programming, uses the sketching mode of commercial parametric computer-aided design software to create kinematic diagrams. The elements of these diagrams are parametrically related so that when a parameter is changed, the design is modified automatically. Geometric constraints are imposed graphically through a well-designed user interface, and numerical solvers integrated into the software solve the relevant systems of equations without the user explicitly formulating those equations. This allows robust algorithms for the kinematic synthesis of a wide variety of mechanisms to be “programmed” in a straightforward, intuitive manner. The results provided by geometric constraint programming exhibit the accuracy and repeatability achieved with analytical synthesis techniques, while simultaneously providing the geometric insight developed with graphical synthesis techniques. The key advantages of geometric constraint programming are that it is applicable to a broad range of kinematic synthesis problems, user friendly, and highly accessible. To demonstrate the utility of the technique, this paper applies geometric constraint programming to three examples of the kinematic synthesis of planar four-bar linkages: Motion generation for five finitely separated positions, path generation for nine finitely separated precision points, and function generation for four finitely separated positions.


Author(s):  
Felicitas Pielsticker ◽  
Ingo Witzke ◽  
Amelie Vogler

AbstractDigital media have become increasingly important in recent years and can offer new possibilities for mathematics education in elementary schools. From our point of view, geometry and geometric objects seem to be suitable for the use of computer-aided design software in mathematics classes. Based on the example of Tinkercad, the use of CAD software — a new and challenging context in elementary schools — is discussed within the approach of domains of subjective experience and the Toulmin model. An empirical study examined the influence of Tinkercad on fourth-graders’ development of a model of a geometric solid and related reasoning processes in mathematics classes.


Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 685
Author(s):  
Manuel Prado-Velasco ◽  
Rafael Ortiz-Marín

The emergence of computer-aided design (CAD) has propelled the evolution of the sheet metal engineering field. Sheet metal design software tools include parameters associated to the part’s forming process during the pattern drawing calculation. Current methods avoid the calculation of a first pattern drawing of the flattened part’s neutral surface, independent of the forming process, leading to several methodological limitations. The study evaluates the reliability of the Computer Extended Descriptive Geometry (CeDG) approach to surpass those limitations. Three study cases that cover a significative range of sheet metal systems are defined and the associated solid models and patterns’ drawings are computed through Geogebra-based CeDG and two selected CAD tools (Solid Edge 2020, LogiTRACE v14), with the aim of comparing their reliability and accuracy. Our results pointed to several methodological lacks in LogiTRACE and Solid Edge that prevented to solve properly several study cases. In opposition, the novel CeDG approach for the computer parametric modeling of 3D geometric systems overcame those limitations so that all models could be built and flattened with accuracy and without methodological limitations. As additional conclusion, the success of CeDG suggests the necessity to recover the relevance of descriptive geometry as a key core in graphic engineering.


2016 ◽  
Vol 823 ◽  
pp. 396-401
Author(s):  
Adrian Cuzmoş ◽  
Dorian Nedelcu ◽  
Constantin Viorel Câmpian ◽  
Cristian Fănică ◽  
Ana Maria Budai

The paper presents a method developed and used by the CCHAPT researchers for the graphic plotting of the index tests results for hydraulic turbines, the comparison of the efficiency curves resulted from testing to those obtained by the model transposition [1] i.e. the determination and comparison of the existing combinatory cam with that obtained from tests.The method presented in the paper was born from the need for processing and presenting the results of index tests within the shortest delay and eliminating the errors that might occur in the results plotting.


Sign in / Sign up

Export Citation Format

Share Document