• Title/Summary/Keyword: Geometric Programming

Search Result 94, Processing Time 0.028 seconds

A Form-finding Technique for Three-dimensional Spatial Structures

  • Lee, Sang Jin
    • Architectural research
    • /
    • v.15 no.4
    • /
    • pp.207-214
    • /
    • 2013
  • A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

Development of a Pre-Processing Program for Flow Analysis Based on the Object-Oriented Programming Concept (OOP 개념에 기초한 유동해석용 전처리 프로그램 개발)

  • Myong, Hyon-Kook;Ahn, Jong-Ki
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.32 no.1
    • /
    • pp.70-77
    • /
    • 2008
  • A pre-processing program based on the OOP(object-oriented programming) concept has been developed. The program consists of the input of a 2D or 3D flow problem to a CFD program by means of an user-friendly interface and the subsequent transformation of this input into a form suitable for the solver(PowerCFD) using unstructured cell-centered method. User-friendly GUI(graphic user interface) has been built on the base of MFC(Microsoft Foundation Class). The program is organized as modules by classes based on VTK(Visualization ToolKit)-library, and these classes are made to function through inheritance and cooperation which is an important and valuable concept of object-oriented programming. The major functions of this program are introduced and demonstrated, which include mesh generation, boundary settings, solver settings, generation of grid connectivity and geometric data etc.

Shape Optimization of Shell Surfaces Based on Linkage Framework betweenGeometric Modeling and Finite Element Analysis (유한요소해석과 기하학적 모델링의 연동에 기초한 쉘 곡면의 형상 최적 설계)

  • Kim, Hyon-Cheol;Roh, Hee-Yuel;Cho, Maeng-Hyo
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1328-1333
    • /
    • 2003
  • In the present study, an integrated framework of geometric modeling, analysis, and design optimization is proposed. Geometric modeling is based on B-spline surface representation. Geometrically-exact shell finite element is implemented in analysis module. Control points of the surface are selected as design variables for optimization, which can make the interaction easier between analysis and surface representation. Sequential linear programming(SLP) is adopted for the shape optimization of surfaces. For the computation of shape sensitivities, semi-analytical method is used. The developed integrated framework should serve as a powerful tool for the geometric modeling, analysis, and shape design of surfaces.

  • PDF

Development of Nonlinear Programming Approaches to Large Scale Linear Programming Problems (비선형계획법을 이용한 대규모 선형계획해법의 개발)

  • Chang, Soo-Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.2
    • /
    • pp.131-142
    • /
    • 1991
  • The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

  • PDF

SCARA robot calibration on off-line programming (오프라인 프로그래밍에서 스카라 로봇의 보정)

  • Jung, Sung-Woo;Son, Kwon;Lee, Min-Chul;Choi, Jae-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1832-1835
    • /
    • 1997
  • Off-line programming systems are widely spread in assembly lines of minute electronic products to huge offshore structures. Any OLP system has to be calibrated before the on-line robot tasks are performed because there are inherent differences between the CAD model on OLP and the real robot workspace. This paper uses simple geometric expressions to propose a calibration method applicable to an OLP for SCARA robots. A positioning task on the two-dimensional horizontal surface was used in the error analysis of a SCARA robot and the anaysis shows that the inaccuracy results from the two error sources non-zero offset angles of two rotational joints at the zero return and differences in link lengths. Pen marks on a sheet of plotting paper are used to determine the accurate data on the joint centers and link dimensions. The calculated offset angles and link lengths are fed back to the OLP for the calibration of the CAD model of the robot and task environments.

  • PDF

Complementarity and nonlinear structural analysis of skeletal structures

  • Tin-Loi, F.
    • Structural Engineering and Mechanics
    • /
    • v.5 no.5
    • /
    • pp.491-505
    • /
    • 1997
  • This paper deals with the formulation and solution of a wide class of structures, in the presence of both geometric and material nonlinearities, as a particular mathematical programming problem. We first present key ideas for the nonholonomic (path dependent) rate formulation for a suitably discretized structural model before we develop its computationally advantageous stepwise holonomic (path independent) counterpart. A feature of the final mathematical programming problem, known as a nonlinear complementarity problem, is that the governing relations exhibit symmetry as a result of the introduction of so-called nonlinear "residuals". One advantage of this form is that it facilitates application of a particular iterative algorithm, in essence a predictor-corrector method, for the solution process. As an illustrative example, we specifically consider the simplest case of plane trusses and detail in particular the general methodology for establishing the static-kinematic relations in a dual format. Extension to other skeletal structures is conceptually transparent. Some numerical examples are presented to illustrate applicability of the procedure.

Development of an Automation Tool for the Three-Dimensional Finite Element Analysis of Machine Tool Spindles

  • Choi, Jin-Woo
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.2
    • /
    • pp.166-171
    • /
    • 2015
  • In this study, an automation tool was developed for rapid evaluation of machine tool spindle designs with automated three-dimensional finite element analysis (3D FEA) using solid elements. The tool performs FEA with the minimum data of point coordinates to define the section of the spindle shaft and bearing positions. Using object-oriented programming techniques, the tool was implemented in the programming environment of a CAD system to make use of its objects. Its modules were constructed with the objects to generate the geometric model and then to convert it into the FE model of 3D solid elements at the workbenches of the CAD system using the point data. Graphic user interfaces were developed to allow users to interact with the tool. This tool is helpful for identification of a near optimal design of the spindle based on, for example, stiffness with multiple design changes and then FEAs.

Modified Delaunay Triangulation Based on Data Structure of Geometric Modeller (형상 모델러의 자료구조에 의한 수정 Delaunay 삼각화)

  • Chae E.-M.;Sah J.-Y.
    • Journal of computational fluids engineering
    • /
    • v.2 no.2
    • /
    • pp.97-103
    • /
    • 1997
  • A modified Delaunay triangulation technique is tested for complicated computational domain. While a simple geometry. both in topology and geometry, has been well discretized into triangular elements, a complex geometry having difficulty in triangulation had to be divided into small sub-domains of simpler shape. The present study presents a modified Delaunay triangulation method based on the data structure of geometric modeller. This approach greatly enhances the reliability of triangulation, especially in complicated computational domain. We have shown that efficiency of Delaunay triangulation can be much improved by using both the GUI (Graphic User Interface) and OOP (Object-Oriented Programming).

  • PDF

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

  • 박종근
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.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

Geometric Implicit Function Modeling and Analysis Using R-functions (R-function을 이용한 형상의 음함수 모델링 및 해석)

  • Shin, Heon-Ju;Sheen, Dong-Woo;Kim, Tae-Wan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.3
    • /
    • pp.220-232
    • /
    • 2007
  • Current geometric modeling and analysis are commonly based on B-Rep modeling and a finite elements method respectively. Furthermore, it is difficult to represent an object whose material property is heterogeneous using the B-Rep method because the B-Rep is basically used for homogeneous models. In addition, meshes are required to analyze a property of a model when the finite elements method is applied. However, the process of generating meshes from B-Rep is cumbersome and sometimes difficult especially when the model is deformed as time goes by because the topology of deforming meshes are changed. To overcome those problems in modeling and analysis including homogeneous and heterogeneous materials, we suggest a unified modeling and analysis method based on implicit representation of the model using R-function which is suggested by Rvachev. For implicit modeling of an object a distance field is approximated and blended for a complex object. Using the implicit function mesh-free analysis is possible where meshes are not necessary. Generally mesh-free analysis requires heavy computational cost compared to a finite elements method. To improve the computing time of function evaluation, we utilize GPU programming. Finally, we give an example of a simple pipe design problem and show modeling and analysis process using our unified modeling and analysis method.