• Title/Summary/Keyword: Geometric Programming

Search Result 95, Processing Time 0.027 seconds

3-DOF Parallel Micromanipulator : Design Consideration (3차원 평형 마이크로조정장치 : 설계 고려사항)

  • Lee, Jeong-Ick;Lee, Dong-Chan;Han, Chang-Soo
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.17 no.2
    • /
    • pp.13-22
    • /
    • 2008
  • For the accuracy correction of the micro-positioning industrial robot, micro-manipulator has been devised. The compliant mechanisms using piezoelectric actuators is necessary geometrically and structurally to be developed by the optimization approaches. The overall geometric advantage as the mechanical efficiencies of the mechanism are considered as objective functions, which respectively art the ratio of output displacement to input force, and their constraints are the vertical notion of supporting leg and the structural strength of manipulation. In optimizing the compliant mechanical amplifier, the sequential linear programming and an optimality criteria method are used for the geometrical dimensions of compliant bridges and flexure hinges. This paper presents the integrated design process which not only can maximize the mechanism feasibilities but also can ensure the positioning accuracy and sufficient workspace. Experiment and simulation are presented for validating the design process through the comparisons of the kinematical and structural performances.

New explicit formulas for optimum design of concrete gravity dams

  • Habibi, Alireza;Zarei, Sajad;Khaledy, Nima
    • Computers and Concrete
    • /
    • v.27 no.2
    • /
    • pp.143-152
    • /
    • 2021
  • Large dams are a part of the infrastructure of any society, and a huge amount of resources are consumed to build them. Among the various types of dams, the optimum design of concrete gravity dams requires special attention because these types of dams require a huge amount of concrete for their construction. On the other hand, concrete gravity dams are among the structures whose design, regarding the acting forces, geometric parameters, and resistance and stability criteria, has some complexities. In the present study, an optimization methodology is proposed based on Sequential Quadratic Programming (SQP), and a computer program is developed to perform optimization of concrete gravity dams. The optimum results for 45 concrete gravity dams are studied and regression analyses are performed to obtain some explicit formulas for optimization of the gravity dams. The optimization of concrete gravity dams can be provided easily using the developed formulas, without the need to perform any more optimization process.

Data interoperability between authoring software and BIM system focused on the office building in conceptual design phase (설계 초기 단계 형상정보 연동 데이터 호환체계 개발 - 오피스 매스를 중심으로)

  • Park, Jung-Dae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.11
    • /
    • pp.494-500
    • /
    • 2020
  • Owing to the complexity of shapes and elements, some difficulties are found in the modeling and sharing phases in a project at the earlier design stages. This paper extends the boundaries by suggesting the data interoperability between 3D modeling software, McNeel Rhino 3D and BIM system, and Autodesk® Revit® Architecture. The main research methodology is to link the architectural form data in the NURBS supporting the 3DM format, especially for integrating surface properties into the mass family template of Revit. This algorithm-driven interoperability approach using visual programming, such as Dynamo in conjunction with Autodesk®, can be applicable in a theoretical part and also a practical use-case. This paper summarizes these results as sequence guidelines and project template recommendations suggesting an efficient design process to interoperate geometric data with the BIM system to manipulate and control the regular and curved form of office buildings.

Optimal design of a Linear Active Magnetic Bearing using Halbach magnet array for Magnetic levitation (자기부상용 Halbach 자석 배열을 이용한 선형 능동자기 베어링의 최적설계)

  • Lee, Hakjun;Ahn, Dahoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.1
    • /
    • pp.792-800
    • /
    • 2021
  • This paper presents a new structure for a linear active magnetic bearing using a Halbach magnet array. The proposed magnetic bearing consisted of a Halbach magnet array, center magnet, and single coil. The proposed linear active magnetic bearing has a high dynamic force compared to the previous study. The high dynamic force could be obtained by varying the thickness of a horizontally magnetized magnet. The new structure of Halbach linear active magnetic bearing has a high dynamic force. Therefore, the proposed linear active magnetic bearing increased the bandwidth of the system. Magnetic modeling and optimal design of the new structure of the Halbach linear active magnetic bearing were performed. The optimal design was executed on the geometric parameters of the proposed linear active magnetic bearing using Sequential Quadratic Programming. The proposed linear active magnetic bearing had a static force of 45.06 N and a Lorentz force constant of 19.54 N/A, which is higher than previous research.

Aesthetic Implications of the Algorithm Applied to New Media Art Works : A Focus on Live Coding (뉴미디어 예술 작품에 적용된 알고리즘의 미학적 함의 : 라이브 코딩을 중심으로)

  • Oh, Junho
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.3
    • /
    • pp.119-130
    • /
    • 2013
  • This paper researches the algorithm, whose materiality and expressiveness can be obtained through live coding. Live coding is an improvised genre of music that generates sounds while writing code in real time and projecting it onto a screen. Previous studies of live coding have focused on the development environment to support live coding performance effectively. However, this study examines the aesthetic attitude immanent in the realization of the algorithm through analyzing mostly used languages such as ChucK, Impromtu, and the visualization of live code and cases of "aa-cell" and "slub" performance. The aesthetic attitudes of live coding performance can be divided into algebraic and geometric attitudes. Algebraic attitudes underline the temporal development of concepts; geometric attitudes highlight the materialization of the spatial structure of concepts through image schemas. Such a difference echoes the tension between conception and materiality, which appears in both conceptual and concrete poetry. The linguistic question of whether conception or materiality is more greatly emphasized defines the expressiveness of the algorithm.

A Profile Tolerance Usage in GD&T for Precision Manufacturing (정밀제조를 위한 기하공차에서의 윤곽공차 사용)

  • Kim, Kyung-Wook;Chang, Sung-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.2
    • /
    • pp.145-149
    • /
    • 2017
  • One of the challenges facing precision manufacturers is the increasing feature complexity of tight tolerance parts. All engineering drawings must account for the size, form, orientation, and location of all features to ensure manufacturability, measurability, and design intent. Geometric controls per ASME Y14.5 are typically applied to specify dimensional tolerances on engineering drawings and define size, form, orientation, and location of features. Many engineering drawings lack the necessary geometric dimensioning and tolerancing to allow for timely and accurate inspection and verification. Plus-minus tolerancing is typically ambiguous and requires extra time by engineering, programming, machining, and inspection functions to debate and agree on a single conclusion. Complex geometry can result in long inspection and verification times and put even the most sophisticated measurement equipment and processes to the test. In addition, design, manufacturing and quality engineers are often frustrated by communication errors over these features. However, an approach called profile tolerancing offers optimal definition of design intent by explicitly defining uniform boundaries around the physical geometry. It is an efficient and effective method for measurement and quality control. There are several advantages for product designers who use position and profile tolerancing instead of linear dimensioning. When design intent is conveyed unambiguously, manufacturers don't have to field multiple question from suppliers as they design and build a process for manufacturing and inspection. Profile tolerancing, when it is applied correctly, provides manufacturing and inspection functions with unambiguously defined tolerancing. Those data are manufacturable and measurable. Customers can see cost and lead time reductions with parts that consistently meet the design intent. Components can function properly-eliminating costly rework, redesign, and missed market opportunities. However a supplier that is poised to embrace profile tolerancing will no doubt run into resistance from those who would prefer the way things have always been done. It is not just internal naysayers, but also suppliers that might fight the change. In addition, the investment for suppliers can be steep in terms of training, equipment, and software.

Efficient Geometric Model Reconstruction using Contour Lines (외곽선을 이용한 효율적인 기하모델 재구성 기법)

  • Jung Hoe Sang;Kwon Koo Joo;Shin Byeong-Seok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.8
    • /
    • pp.418-425
    • /
    • 2005
  • 3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

A Study on Shape Optimization of Plane Truss Structures (평면(平面) 트러스 구조물(構造物)의 형상최적화(形狀最適化)에 관한 구연(究研))

  • Lee, Gyu won;Byun, Keun Joo;Hwang, Hak Joo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.5 no.3
    • /
    • pp.49-59
    • /
    • 1985
  • Formulation of the geometric optimization for truss structures based on the elasticity theory turn out to be the nonlinear programming problem which has to deal with the Cross sectional area of the member and the coordinates of its nodes simultaneously. A few techniques have been proposed and adopted for the analysis of this nonlinear programming problem for the time being. These techniques, however, bear some limitations on truss shapes loading conditions and design criteria for the practical application to real structures. A generalized algorithm for the geometric optimization of the truss structures which can eliminate the above mentioned limitations, is developed in this study. The algorithm developed utilizes the two-phases technique. In the first phase, the cross sectional area of the truss member is optimized by transforming the nonlinear problem into SUMT, and solving SUMT utilizing the modified Newton-Raphson method. In the second phase, the geometric shape is optimized utilizing the unidirctional search technique of the Rosenbrock method which make it possible to minimize only the objective function. The algorithm developed in this study is numerically tested for several truss structures with various shapes, loading conditions and design criteria, and compared with the results of the other algorithms to examme its applicability and stability. The numerical comparisons show that the two-phases algorithm developed in this study is safely applicable to any design criteria, and the convergency rate is very fast and stable compared with other iteration methods for the geometric optimization of truss structures.

  • PDF

Development of an Image Processing System for the Large Size High Resolution Satellite Images (대용량 고해상 위성영상처리 시스템 개발)

  • 김경옥;양영규;안충현
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.4
    • /
    • pp.376-391
    • /
    • 1998
  • Images from satellites will have 1 to 3 meter ground resolution and will be very useful for analyzing current status of earth surface. An image processing system named GeoWatch with more intelligent image processing algorithms has been designed and implemented to support the detailed analysis of the land surface using high-resolution satellite imagery. The GeoWatch is a valuable tool for satellite image processing such as digitizing, geometric correction using ground control points, interactive enhancement, various transforms, arithmetic operations, calculating vegetation indices. It can be used for investigating various facts such as the change detection, land cover classification, capacity estimation of the industrial complex, urban information extraction, etc. using more intelligent analysis method with a variety of visual techniques. The strong points of this system are flexible algorithm-save-method for efficient handling of large size images (e.g. full scenes), automatic menu generation and powerful visual programming environment. Most of the existing image processing systems use general graphic user interfaces. In this paper we adopted visual program language for remotely sensed image processing for its powerful programmability and ease of use. This system is an integrated raster/vector analysis system and equipped with many useful functions such as vector overlay, flight simulation, 3D display, and object modeling techniques, etc. In addition to the modules for image and digital signal processing, the system provides many other utilities such as a toolbox and an interactive image editor. This paper also presents several cases of image analysis methods with AI (Artificial Intelligent) technique and design concept for visual programming environment.

Large-Scale Joint Rate and Power Allocation Algorithm Combined with Admission Control in Cognitive Radio Networks

  • Shin, Woo-Jin;Park, Kyoung-Youp;Kim, Dong-In;Kwon, Jang-Woo
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.157-165
    • /
    • 2009
  • In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.