• Title/Summary/Keyword: A-, D-최적계획

Search Result 164, Processing Time 0.047 seconds

A Study of Design for Interior Permanent Magnet Synchronous Motor by using d-q Axis Equivalent Circuit Method (d-q축 등가회로 해석기법을 이용한 180 W급 IPMSM 설계에 관한 연구)

  • Kim, Young-Kyoun
    • Journal of the Korean Magnetics Society
    • /
    • v.27 no.2
    • /
    • pp.54-62
    • /
    • 2017
  • This paper presents a design of the Interior Permanent Magnet Synchronous Motor (IPMSM). an initial design process is accomplished by using the parametric design. In the design process, motor characteristics of parameters is computed by the d-q axis equivalent circuit model. Then, an optimal design process is accomplished by combination the experimental design and the response surface method. Finally, the design and analysis results are verified with experimental results.

A Genetic Algorithm for Minimizing Query Processing Time in Distributed Database Design: Total Time Versus Response Time (분산 데이타베이스에서의 질의실행시간 최소화를 위한 유전자알고리즘: 총 시간 대 반응시간)

  • Song, Suk-Kyu
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.295-306
    • /
    • 2009
  • Query execution time minimization is an important objective in distributed database design. While total time minimization is an objective for On Line Transaction Processing (OLTP), response time minimization is for Decision Support queries. We formulate the sub-query allocation problem using analytical models and solve with genetic algorithm (GA). We show that query execution plans with total time minimization objective are inefficient from response time perspective and vice versa. The procedure is tested with simulation experiments for queries of up to 20 joins. Comparison with exhaustive enumeration indicates that GA produced optimal solutions in all cases in much less time.

A Study on the Design of Task Planning System for Intelligent Excavating System (IES) (지능형 굴삭을 위한 토공작업계획 시스템의 구조 설계)

  • Lee, Won-Sik;Song, Soon-Ho;Lee, Seung-Soo;Seo, Jong-Won;Kim, Sung-Keun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2007.11a
    • /
    • pp.921-924
    • /
    • 2007
  • 토목, 건축과 관련된 노동현장은 여느 3D 업종들과 마찬가지로 숙련된 기능공의 부재 및 산업재해 발생으로 인해 어려움을 겪고 있으며 이를 극복하기 위한 노력을 계속하고 있다. 대표적인 토목공사인 토공 작업 역시 위험 혹은 유해한 작업환경으로 인해 토공장비의 안전사고 및 생산성과 품질저하가 발생하며 이를 방지하기 위한 장비의 지능화가 절실하게 요구되고 있다. 이를 위해 최근 지능형 굴삭 시스템 개발을 위한 연구가 진행되고 있으며, 토공작업은 일반적으로 광범위한 작업영역을 가지기 때문에 지능형 굴삭시스템의 개발을 위해서는 효율적인 작업을 수행할 수 있도록 하는 작업계획의 수립이 매우 중요하다. 본 연구에서는 작업계획의 대상을 굴삭로봇과 토사로 구분하였으며, 글로벌 영역에서 단위작업 영역, 로컬 영역으로의 분할을 통해 전체 작업 진행에 대해 효율적으로 작업계획을 수립할 수 있도록 구성하여 계획단계에서부터 토공작업 자동화 및 효율와에 기여하고자한다. 토공작업계획 시스템은 토공 작업자 및 감독자의 작업 특성 및 노하우를 컴퓨터, 즉 두뇌에 부여함으로써 숙련된 장비조종자의 작업 방법 및 특성을 반영하여 토공 작업 프로세스 모델링을 구축하고 실제 작업환경상의 센서에 의해 측정된 데이터를 실제 작업환경과 동일하게 모델링된 컴퓨터내의 가상환경을 바탕으로 영역분할, 최적 플랫폼 위치선정 및 작업 순차생성을 통해 최적의 토공작업계획을 수립할 수 있도록 한다.

  • PDF

Robust Optimal Design of Disc Brake Based on Response Surface Model Considering Standard Normal Distribution of Shape Tolerance (표준정규분포를 고려한 반응표면모델 기반 디스크 브레이크의 강건최적설계)

  • Lee, Kwang-Ki;Lee, Yong-Bum;Han, Seung-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.9
    • /
    • pp.1305-1310
    • /
    • 2010
  • In a practical design process, the method of extracting the design space information of the complex system for verifying, improving, and optimizing the design process by taking into account the design variables and their shape tolerance is very important. Finite element analysis has been successfully implemented and integrated with design of experiment such as D-Optimal array; thus, a response surface model and optimization tools have been obtained, and design variables can be optimized by using the model and these tools. Then, to guarantee the robustness of the design variables, a robust design should be additionally performed by taking into account the statistical variation of the shape tolerance of the optimized design variables. In this study, a new approach based on the use of the response surface model is proposed; in this approach, the standard normal distribution of the shape tolerance is considered. By adopting this approach, it is possible to simultaneously optimize variables and perform a robust design. This approach can serve as a means of efficiently modeling the trade-off among many conflicting goals in the applications of finite element analysis. A case study on the robust optimal design of disc brakes under thermal loadings was carried out to solve multiple objective functions and determine the constraints of the design variables, such as a thermal deformation and weight.

A linear program approach for a global optimization problem of optimizing a linear function over an efficient set (글로벌최적화 문제인 유효해집합 위에서의 최적화 문제에 대한 선형계획적 접근방법)

  • 송정환
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.53-56
    • /
    • 2000
  • The problem ( Ρ ) of optimizing a linear function d$\^$T/x over the set of efficient set for a multiple objective linear program ( Μ ) is difficult because the efficient set is nonconvex. There some interesting properties between the objective linear vector d and the matrix of multiple objectives C and those properties lead us to establish criteria to solve ( Ρ ) with a linear program. In this paper we investigate a system of the linear equations C$\^$T/${\alpha}$=d and construct two linearly independent positive vectors ${\mu}$, ν such that ${\alpha}$=${\mu}$-ν. From those vectors ${\mu}$, ν, solving an weighted sum linear program for finding an efficient extreme point for the ( Μ ) is a way to get an optimal solution ( Ρ ). Therefore our theory gives an easy way of solving nonconvex program ( Ρ ) with a weighted sum linear program.

  • PDF

A Study on the Improvement and Verification of D* Lite Algorithm for Autonomous Ship Paths (선박 자율 운항 경로를 위한 D* Lite 알고리즘 개선 및 검증에 관한 연구)

  • Yun-seung Shin;Hyung-jin Kwon;In-young Park;Hyun-ho Kwon;Dong-seop Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.1078-1079
    • /
    • 2023
  • 해양 분야에서의 정보기술 발전으로 선박 자율운항의 중요성이 증대되고 있다. 이에 선박 자율운항기술의 핵심인 경로 계획에는 그리드 기반 알고리즘이 주목을 받고 있다. 본 논문은 D* Lite 알고리즘을 선박자율운항에 적합하게 조정한 D* Opt 알고리즘을 소개하며, 기존 알고리즘과의 경로 비용 및 생성 시간을 비교 분석하여 성능을 확인한다. 이를 통해서 D* Opt 알고리즘이 선박 자율 운항경로 핵심기술로 응용 가능성과 기대효과를 제시한다.

Valuation of Architecture-based Deterministic Plan for Software Evolution (아키텍처 기반의 결정적 소프트웨어 진화계획의 가치 평가)

  • Kang, Sung-Won;Garlan, David
    • The KIPS Transactions:PartD
    • /
    • v.16D no.5
    • /
    • pp.755-766
    • /
    • 2009
  • Software architecture allows us to make many decisions about a software system and analyze it even before it exists in order to make systematic and planned development possible. Similarly, architecture-based software evolution planningmakes planned evolution possible by allowing us to make many decisions about evolution of a software system and analyze its evolution at the level of architecture design before software evolution is realized. In this paper, we develop a framework for architecture-based software evolution planning for the class of deterministic evolution plans by defining and relating various essential concepts and developing its valuationmechanism so that a plan with the greatest value among candidate plans can be selected as an optimal plan. A case study is conducted for explicating the framework and exemplifying its usage.

3D A*-based Berthing Path Planning Algorithm Considering Path Following Suitability (경로 추종 적합성 고려 3D A* 기반 접안 경로 계획 알고리즘 개발)

  • Yeong-Ha Shin
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2022.11a
    • /
    • pp.351-356
    • /
    • 2022
  • Among the path planning methods used to generate the ship's path, the graph search-based method is widely used because it has the advantage of its completeness, optimality. In order to apply the graph-based search method to the berthing path plan, the deviation from the path must be minimized. Path following suitability should be considered essential, since path deviation during berthing can lead to collisions with berthing facilities. However, existing studies of graph search-based berthing path planning are dangerous for application to real-world navigation environments because they produce results with a course change just before berthing. Therefore, in this paper, we develop a cost function suitable for path following, and propose a 3D A* algorithm that applies it. In addition, in order to evaluate the suitability for the actual operating environment, the results of the path generation of the algorithm are compared with the trajectory of the data collected by manned operations.

  • PDF

Optimal Sequencing of Water Supply Proiects by Dynamic Programming (동적계량법에 의한 용수공급시설의 최적화에 관한 연구)

  • 배상근;이순택
    • Water for future
    • /
    • v.14 no.2
    • /
    • pp.63-69
    • /
    • 1981
  • This Study is aimed at optimal sequencing of water supply projects for water demand from the application in water resources field of dynamic programming because a minimum present cost strategy for investment in water supply projects plays an important part of installation of some projects. In analysis, the relationships of the future water demand and numerous possible independent projects that are expected to meet water requirements up to some future data in Daegu city were used and future water demand were estimated from the exponential function method, the method used by the Water Works Bureau of Daegu City government which is a kind of geometric progression method and the mean value of these two methods. The results showed that the optimal sequencing of water supply projects using Dynamic Programming was reasonable and the changing of the estimation method of future water demand made a difference among optimal sequence of projects while the changing of annual rate of interest had influenced on present value cost only. In general, the best sequence for constructing the seven projects was the order of D-E-G-F-C-B-A, with the corresponding period for 33-38 years.

  • PDF