Reconfiguration Techniques and Geometric Constraints of Metamorphic Mechanisms

2009 ◽  
Author(s):  
Liping Zhang ◽  
Jian S. Dai ◽  
Ting-Li Yang
Keyword(s):  
Group Structure ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Geometric Representation ◽  
Group Extensions ◽  
Matrix Operations ◽  
Group Motion ◽  
Displacement Group ◽  
Configuration Changes ◽  
Invariant Configuration

This paper proposes a geometric way to generate metamorphic configurations and investigates metamorphic principles based on geometrized displacement group. Metamorphic reconfiguration techniques are revealed as the variations of kinematic joints, kinematic links and geometric orientation constraints particularly by examining the invariant configuration properties of a mechanism. The nature of all these configuration changes belongs to geometric constraint category. Metamorphic configuration units are proposed as the irreducible reconfiguration modules to envelop these reconfiguration techniques. It can self-reconfigure or be combined to generate metamorphosis. Moreover, the geometrized displacement group is lent to achieve a geometric representation for configuration modelling and further reconfiguration operations. Based on seting up kinematic group extended qualitatively according to its group structure, geometrized displacement group modelling is proposed for these identified metamorphic configuration units. The investigated group motion-matrix is an integration of its displacement group properties and kinematic extensions. Then defined geometric constraint relations and the proposed dependence rules lead to metamorphic principles. In this way, metamorphic process is mapped to matrix operations under group extensions and their compositions. Design examples and a metamorphic joint with six configurations are given to illustrate the feasibility of these metamorphic principles.

Solution Selectors: A User-Oriented Answer to the Geometric Constraint Multiple Solution Problem

2001 ◽  
Author(s):  
Bernhard Bettig ◽  
Jami Shah
Keyword(s):  
Linear Equations ◽  
Independent Solution ◽  
Solid Modeling ◽  
Multiple Solution ◽  
Parametric Modeling ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Basic Solution ◽  
Solution Selection ◽  
Solution Problem

Abstract The development of solid modeling to represent the geometry of designed parts and the development of parametric modeling to control the size and shape have had significant impacts on the efficiency and speed of the design process. Designers now rely on parametric solid modeling, but surprisingly often are frustrated by a problem that unpredictably causes their sketches to become twisted and contorted. This problem, known as the “multiple solution problem” occurs because the dimensions and geometric constraints yield a set of non-linear equations with many roots. This situation occurs because the dimensioning and geometric constraint information given in a CAD model is not sufficient to unambiguously and flexibly specify which configuration the user desires. This paper first establishes that only explicit, independent solution selection declarations can provide a flexible mechanism that is sufficient for all situations of solution selection. The paper then describes the systematic derivation of a set of “solution selector” types by considering the occurrences of multiple solutions in combinations of mutually constrained geometric entities. The result is a set of eleven basic solution selector types and two derived types that incorporate topological information. In particular, one derived type “concave/convex” is user-oriented and thought to be very useful.

GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING

2006 ◽  
Vol 16 (05n06) ◽  
pp. 479-511 ◽  
Author(s):  
GILLES TROMBETTONI ◽  
MARTA WILCZKOWIAK
Keyword(s):  
Equation System ◽  
3D Models ◽  
General Purpose ◽  
Constrained Systems ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Maximum Matching ◽  
Constraint System ◽  
Constraint Systems ◽  
Geometrical Constraints

Our approach exploits a general-purpose decomposition algorithm, called GPDOF, and a dictionary of very efficient solving procedures, called r-methods, based on theorems of geometry. GPDOF decomposes an equation system into a sequence of small subsystems solved by r-methods, and produces a set of input parameters.1. Recursive assembly methods (decomposition-recombination), maximum matching based algorithms, and other famous propagation schema are not well-suited or cannot be easily extended to tackle geometric constraint systems that are under-constrained. In this paper, we show experimentally that, provided that redundant constraints have been removed from the system, GPDOF can quickly decompose large under-constrained systems of geometrical constraints. We have validated our approach by reconstructing, from images, 3D models of buildings using interactively introduced geometrical constraints. Models satisfying the set of linear, bilinear and quadratic geometric constraints are optimized to fit the image information. Our models contain several hundreds of equations. The constraint system is decomposed in a few seconds, and can then be solved in hundredths of seconds.

4MDS: A Geometric Constraint Based Motion Design Software for Synthesis and Simulation of Planar Four-Bar Linkages

2014 ◽  
Author(s):  
Anurag Purwar ◽  
Abhijit Toravi ◽  
Q. J. Ge
Keyword(s):  
Real Time ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Design System ◽  
Dimensional Synthesis ◽  
Complete Control ◽  
Dimensional Changes ◽  
Design Software ◽  
Four Bar Linkage ◽  
Motion Design

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.

scholarly journals Variational B-rep model analysis for direct modeling using geometric perturbation

2019 ◽  
Vol 6 (4) ◽  
pp. 606-616
Author(s):  
Qiang Zou ◽  
Hsi-Yung Feng
Keyword(s):  
Rigid Body ◽  
Boundary Representation ◽  
Geometric Constraint ◽  
New Method ◽  
Geometric Representation ◽  
Constraint Systems ◽  
Fundamental Difficulty ◽  
Direct Modeling ◽  
Rigid Body Motions ◽  
Constrained Model

Abstract The very recent CAD paradigm of direct modeling gives rise to the need of processing 3D geometric constraint systems defined on boundary representation (B-rep) models. The major issue of processing such variational B-rep models (in the STEP format) is that free motions of a well-constrained model involve more than just rigid-body motions. The fundamental difficulty lies in having a systematic description of what pattern these free motions follow. This paper proposes a geometric perturbation method to study these free motions. This method is a generalization of the witness method, allowing it to directly deal with variational B-rep models represented by the STEP format. This generalization is essentially achieved by using a direct, geometric representation of the free motions, and then expressing the free motions in terms of composites of several basis motions. To demonstrate the effectiveness of the proposed method, a series of comparisons and case studies are presented. Highlights A new method to analyze geometric constraint systems for direct modeling. A generalization of the witness configuration method. A new method to characterize the constraint states of variational B-rep models.

Geometric Constraint-based Reconfiguration and Self-motions of a 4-CRU Parallel Mechanism

2021 ◽  
pp. 1-21
Author(s):  
Latifah Nurahmi ◽  
Pradiktio Putrayudanto ◽  
Guowu Wei ◽  
Sunil K. Agrawal
Keyword(s):  
Parallel Mechanism ◽  
New Technology ◽  
Operation Mode ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Primary Decomposition ◽  
Sustainable Housing ◽  
Additional Mode ◽  
Moving Platform ◽  
Self Motion

Abstract This paper aims to investigate the reconfiguration and self-motions of a 4-CRU parallel mechanism based on the mechanism geometric constraints. The targeted application of such mechanism in this research is for 3D-printing buildings of multi-directional nozzle as a new technology for constructing sustainable housing. By using primary decomposition, four geometric constraints are identified and the reconfiguration analysis is carried out in each of these. It reveals that each geometric constraint will have three distinct operation modes, namely Schoenflies mode, reversed Schoenflies mode and an additional mode. The additional mode can be either 4-DOF mode or it degenerates into 3-DOF mode, depending on the type of the geometric constraint. By taking into account the actuation and constraint singularities, the workspace of each operation mode is analysed and geometrically illustrated. It allows us to determine the regions in which the reconfiguration takes place. Furthermore, the moving-platform can still perform at least 1-DOF self-motion. It occurs at two specific actuated leg lengths. Demonstration of reconfiguration process and self-motions are also provided through a mock-up prototype.

Function Generation With Finitely Separated Precision Points Using Geometric Constraint Programming

2006 ◽  
Vol 129 (11) ◽  
pp. 1185-1190 ◽  
Author(s):  
Edward C. Kinzel ◽  
James P. Schmiedeler ◽  
Gordon R. Pennock
Keyword(s):  
Nonlinear Equations ◽  
Constraint Programming ◽  
Parametric Design ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Function Generation ◽  
Large Numbers ◽  
Design Software ◽  
Complex Mechanisms ◽  
Four Bar Linkage

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.

scholarly journals An Efficient Surrogate-Based Optimization Method for BWBUG Based on Multifidelity Model and Geometric Constraint Gradients

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Daiyu Zhang ◽  
Bei Zhang ◽  
Zhidong Wang ◽  
Xinyao Zhu
Keyword(s):  
Shape Optimization ◽  
Optimization Methods ◽  
Optimization Method ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
High Fidelity ◽  
Surrogate Based Optimization ◽  
Parameterized Model ◽  
Effectiveness And Efficiency ◽  
Optimization Efficiency

Performing shape optimization of blended-wing-body underwater glider (BWBUG) can significantly improve its gliding performance. However, high-fidelity CFD analysis and geometric constraint calculation in traditional surrogate-based optimization methods are expensive. An efficient surrogate-based optimization method based on the multifidelity model and geometric constraint gradient information is proposed. By establishing a shape parameterized model, deriving analytical expression of geometric constraint gradient, constructing multifidelity surrogate model, the calculation times of high-fidelity CFD model and geometric constraints are reduced during the shape optimization process of BWBUG, which greatly improve the optimization efficiency. Finally, the effectiveness and efficiency of the proposed method are verified by performing the shape optimization of a BWBUG and comparing with traditional surrogate-based optimization methods.

The Geometric Generation of the Joint Loci of Spatial Dyads With Axis Joints

1992 ◽  
Author(s):  
J. Keith Nisbett ◽  
T. J. Lawley
Keyword(s):  
General Procedure ◽  
Analytical Techniques ◽  
Geometric Approach ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Physical Linkage ◽  
Four Bar Linkage ◽  
Linkage Synthesis

Abstract The geometric aspects of Burmester theory, as used in planar four-bar linkage synthesis, are examined to define a general procedure which is applied to the generation of the joint loci of spatial dyads with axis joints. The joints are geometrically related to the screw axes of the prescribed motion, by means of a screw triangle. The geometric relationships are typically separated into several geometric constraints. Each geometric constraint is considered separately to generate the loci of lines representing joint axes which satisfy the constraint. Combining the loci from each constraint produces a single loci of all the possible fixed or moving joints. The geometric approach is shown to have several benefits not obtained in numerical and pure analytical techniques, especially in relating the characteristics of the loci to the physical linkage and its required motion.

Kinematic Synthesis for Infinitesimally and Multiply Separated Positions Using Geometric Constraint Programming

2014 ◽  
Vol 136 (3) ◽  
Author(s):  
James P. Schmiedeler ◽  
Barrett C. Clark ◽  
Edward C. Kinzel ◽  
Gordon R. Pennock
Keyword(s):  
Undergraduate Students ◽  
Constraint Programming ◽  
Computer Aided Design ◽  
Geometric Constraints ◽  
Geometric Constraint ◽  
Motion Generation ◽  
Planar Mechanisms ◽  
Kinematic Synthesis ◽  
Design Software ◽  
Aided Design

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.

Sign in / Sign up

Export Citation Format

Share Document