• 제목/요약/키워드: Dimensional & Geometric Constraints

검색결과 27건 처리시간 0.023초

Unigraphics API를 이용한 사출금형의 3차원 설계에 관한 연구 (A Study on the 3D Injection Mold Design Using Unigraphics API)

  • 김재현;문천식;황용근;박정환
    • 한국CDE학회논문집
    • /
    • 제10권6호
    • /
    • pp.381-391
    • /
    • 2005
  • The design methodology of injection molding die has been changed from two-dimensional drafting to three-dimensional solid modeling, which is due to many advantages over the conventional methodology in terms of design modification and data associativity. In addition to the solid modeling capability, it is required for a mold designer to utilize a database management system that facilitates efficient mold design. In the paper presented is the implementation of a software program which automatically generates three-dimensional mold-bases including standard parts and slider parts, conforming to given geometric constraints. It is based on a commercial CAD system (Unigraphics NX) along with related API (application program interface) libraries. The research is expected to reduce design efforts and simplify construction of a complex three-dimensional mold-base model that is comprised of standard parts and slider parts, by use of the three-dimensional database and automatized geometric dimensioning.

PARAMETRIC DESIGN을 위한 자동설계모듈 생성 (Automated design module generation system for parametric design)

  • 이석희;반갑수
    • 한국정밀공학회지
    • /
    • 제10권4호
    • /
    • pp.236-247
    • /
    • 1993
  • An davanced method for the automatic generation of parametric models in computer- aided design systems is required for most of two-dimensional model which is represented as a set of geometric elements, and constraining scheme formulas. The development system uses geometric constraints and support of topology parameters from feature recognition and grouping the design entities into optimal ones from pre-designed drawings. The aim of this paper is to present guidelines for the application and development of parametric design modules for the standard parts in mechanical system, the basic constitutional part of mold base, and other 2D features.

  • PDF

Analysis of slender structural elements under unilateral contact constraints

  • Silveira, Ricardo Azoubel Da Mota;Goncalves, Paulo Batista
    • Structural Engineering and Mechanics
    • /
    • 제12권1호
    • /
    • pp.35-50
    • /
    • 2001
  • A numerical methodology is presented in this paper for the geometrically non-linear analysis of slender uni-dimensional structural elements under unilateral contact constraints. The finite element method together with an updated Lagrangian formulation is used to study the structural system. The unilateral constraints are imposed by tensionless supports or foundations. At each load step, in order to obtain the contact regions, the equilibrium equations are linearized and the contact problem is treated directly as a minimisation problem with inequality constraints, resulting in a linear complementarity problem (LCP). After the resulting LCP is solved by Lemke's pivoting algorithm, the contact regions are identified and the Newton-Raphson method is used together with path following methods to obtain the new contact forces and equilibrium configurations. The proposed methodology is illustrated by two examples and the results are compared with numerical and experimental results found in literature.

TRIANGLE MESH COMPRESSION USING GEOMETRIC CONSTRAINTS

  • Sim, Jae-Young;Kim, Chang-Su;Lee, Sang-Uk
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.462-465
    • /
    • 2000
  • It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

  • PDF

Machine Vision을 이용한 기둥형 물체의 3차원 측정 (3-Dimensional Measurement of the Prismatic Polyhedral Object using Machine Vision.)

  • 조철규;이석희
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1996년도 추계학술대회 논문집
    • /
    • pp.733-737
    • /
    • 1996
  • This paper presents a method to measure tile position and orientation of a prismatic polyhedral object (of unknown width, length, height, and number of vertices) using machine vision. The width, length, and origin of workplace where an object is lying are defined as Preliminary operation. The edges of an object are detected from captured image using least sum of square error. The information of an object is determined from the geometric relationships between edges. As an user interface, a versatile image processing program is developed in several modules, and renders a very useful 3D measurement at a limited constraints when adopted in automation of production process. The flexibility of camera position from the algorithm developrf can be used for automated pick and place operations and feeding workpiece u: ;ing assembly robot.

  • PDF

로봇팔의 장애물 중에서의 시간 최소화 궤도 계획 (Minimum-Time Trajectory Planning for a Robot Manipulator amid Obstacles)

  • 박종근
    • 한국정밀공학회지
    • /
    • 제15권1호
    • /
    • pp.78-86
    • /
    • 1998
  • This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

  • PDF

Optimal Design for A Heteropolar Magnetic Bearing Considering Nonlinearities

  • Kim, Chaesil;Lee, Jaewhoan;Park, Jong-Kweon
    • International Journal of Precision Engineering and Manufacturing
    • /
    • 제3권1호
    • /
    • pp.13-19
    • /
    • 2002
  • Although the design of magnetic bearing needs a systematic optimization due to several design variables, constraints, geometric limitations, nonlinearities, and so on, the present designs for magnetic bearings have been conducted in the linear region of the characteristics for magnetic materials by trial and error considering design constraints. This article, therefore, provides the possibility of a genetic algorithm(GA) based optimization with two dimensional nonlinear finite element magnetic field analysis for the design of a radial heteropolar magnetic bearing. The magnetic bearing design by GA based optimization makes good agreements with that by a commercial optimization software DOT using the sensitivity analysis.

비선형이 고려된 이극성 자기베어링의 최적설계 (Optimal Design for a Heteropolar Magnetic Bearing Considering Nonlinearities)

  • 김재실;이재환;박종권
    • 한국정밀공학회지
    • /
    • 제16권8호
    • /
    • pp.53-58
    • /
    • 1999
  • Although the design of magnetic bearing needs a systematic optimization du e to several design variables, constraints, geometric limitations, nonlinearities, and so on, the present for magnetic bearings have been conducted in the linear region of the characteristics for magnetic by trial and error considering design constraints. This article, therefore, provides the possibility of a genetic algorithm(GA) based optimization with two dimensional-nonlinear finite element magnetic field analysis for design of a radial heteropolar magnetic bearing. The magnetic bearing design by GA based optimization makes good agreements with that by a commercial optimization software DOT using the sensitivity analysis.

  • PDF

CATIA API를 이용한 사출 금형의 3차원 설계에 관한 연구 (A Study on the 3D Injection Mold Design Using CATIA API)

  • 박주삼;김재현;박정환
    • 한국정밀공학회지
    • /
    • 제20권12호
    • /
    • pp.115-125
    • /
    • 2003
  • The design methodology of plastic injection molding die has been gradually moved from two-dimensional line drawings to three-dimensional solid models. The 3D design gives many benefits, a few of which are: ease of design change, data associativity from concept design to final assembly. In the paper represented is the implementation of a program which automatically generates 3D mold-bases and cooling-lines, conforming to given geometric constraints. It utilized a commercial CAD software and the related API(application program interface) libraries. We constructed a DB(database) of typical mold-bases assembled from standard parts, from which the geometry (position & dimension) of a mold-base and composed parts can be automatical]y determined by a few key parameters. Also we classified cooling lines into several typical types and constructed a DB, from which the position of cooling lines is automatically determined. The research is expected not only to simplify construction of a 3D mold-base model including cooling lines but also to reduce design efforts, by way of databases and automatized determination of geometric dimensions.

접근확률 기반의 네트워크 자원할당방식의 최적화에 관한 연구 (A study on the optimization of network resource allocation scheme based on access probabilities)

  • 김도규
    • 한국정보통신학회논문지
    • /
    • 제10권8호
    • /
    • pp.1393-1400
    • /
    • 2006
  • 본 논문은 확률접근 기반의 네트워크 자원할당 방식에서 네트워크의 대표적인 서비스 품질 척도인 대기시간과 블러킹 확률이 특정 임계값을 넘지 않으면서 최소화가 되도록 접근 확률을 최적화하는 방법에 대하여 연구하였고 그에 따른 성능분석을 하였다. 확률 접근에 의한 제어 방식은 시스템에서 서비스 받고 있는 메시지의 수, 시스템에서 대기하고 있는 메시지의 수, 문턱 값, 컷오프 값 등의 시스템 상태에 따라 접근확률을 다르게 하여 자원의 할당을 동적으로 제어하는 방식이다. 접근 확률을 최적화하는 문제는 무한개의 균형 방정식을 포함하는 문제로서 Neuts의 행렬기하기법(matrix geometric method)을 통하여 유한개의 균형 방정식을 가지는 최적화 문제로 변환하였다. 또한 유한개의 균형방정식은 비선형 최적화 문제로 모델링이 되는데 이것을 다시 변수 치환 기법을 이용하여 설형 최적화 문제로 변환하여 최적의 접근 확률을 구하였다. 수치해석을 통하여 주어진 조건하에 최적의 접근 확률을 구한후 트래픽의 대기시간, 블러킹 확률 및 시스템 최대 이용률을 구하였고 버퍼의 문턱 값을 제어하여 시스템의 이용률이 증가하는 것을 보였다.