• 한국전산유체공학회지
• /
• 제11권2호
• /
• pp.19-24
• /
• 2006

A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

• 대한기계학회논문집A
• /
• 제24권6호
• /
• pp.1408-1418
• /
• 2000

Gradient-based optimization methods are inefficient in applications which require expensive function evaluations, and useless in applications where objective and/or constraint functions are 'noisy' due to modeling and cumulative numerical inaccuracy since gradient evaluation results cannot be reliable. Moreover, it is difficult to be integrated with commercial analysis software, and they cannot be employed when only experimental analysis results are available. In this research an optimization program based on a response surface method has been developed to overcome the aforementioned difficulties. Various methods for design of experiments and new proposed approximation models are implemented in the program. The effectiveness of the optimization program is tested on several test problems and results are discussed.

• 한국의학물리학회지:의학물리
• /
• 제9권4호
• /
• pp.201-206
• /
• 1998

세기변조방사선치료 (Intensity Modulation Radiation Therapy; IMRT) 의 치료계획 목적으로 사용하기 위한 선량최적화 방법을 Gradient based algorithm을 이용하여 개발하였다. 환자의 치료 관심 부위를 포함하는 약 10-30 CT 단면에 대하여 각 단면 별로 선량최적화를 실시하였고, 장기별로 최대 허용선량을 지정하였으며, 표적의 선량은 100$\pm$5 %로 제한하였다. beamlet의 크기는 8$\times$8 $cm^2$으로 제한하였고, beam size가 크지 않으므로 beam diverge는 고려하지 않았다. beamlet 하나가 만드는 선량분포를 미리 계산한 후, 선량중첩방식으로 전체 선량분포를 계산하였다. 고정된 동일평면에 대하여 5방향에서 입사하는 빔에 대한 최적화를 실시하였으며, 그 효용성을 비교하기 위해, 1, 3, 5, 7, 9 방향에 입사하는 빔과 최적화지수를 구하였다. 선량최적화에 소요되는 시간은 대체로 slice 수에 비례하였으며, 계산시간과 최적화지수를 비교할 때 빔의 개수가 3-7개 일 때 가장 적합하였다. 다중단면에 대한 선량최적화를 beam divergence를 고려하지 않을 때, 단일 단면에 대한 선량최적화를 반복 시행함으로써 얻을 수 있었다. 선량최적화의 결과가 선량중심의 위치에 따라 민감하게 변하는 경우가 발생하였으며, 이를 개선하기 위해서는 선량중심의 최적화가 개발될 필요성이 있었다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.359-366
• /
• 2005

Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

• 로봇학회논문지
• /
• 제17권1호
• /
• pp.58-67
• /
• 2022

In this paper, we propose an approach resolving inaccuracy of the low-cost redundant manipulator workspace with low encoder and low stiffness. When the manipulators are manufactured with low-cost encoders and low-cost links, the robots can run into workspace inaccuracy issues. Furthermore, trajectory generation based on conventional forward/inverse kinematics without taking into account inaccuracy issues will introduce the risk of end-effector fluctuations. Hence, we propose an optimization for the trajectory generation method based on the DDPG (Deep Deterministic Policy Gradient) algorithm for the low-cost redundant manipulators reaching the target position in Euclidean space. We designed the DDPG algorithm minimizing the distance along with the jacobian condition number. The training environment is selected with an error rate of randomly generated joint spaces in a simulator that implemented real-world physics, the test environment is a real robotic experiment and demonstrated our approach.

• 한국시뮬레이션학회논문지
• /
• 제18권2호
• /
• pp.49-55
• /
• 2009

본 연구는 확률적 시스템에서 관심 성과함수의 기대치의 최적을 유도하는 서비스 자원의 최적 배분 문제를 조사하였다. 이러한 목적으로 통제변수를 활용하여 성과함수 기대치에 대한 서비스 자원 파라미터의 gradient를 구하는 방법을 제안하고 이를 최적화 기법의 탐색과정에 적용하여 가용 자원의 최적 배분 문제를 분석하였다. 제안된 gradient 추정 방법은 시뮬레이션 실험에서 입력 파라미터의 차원이 증가하더라도 추가로 표본점의 수를 증가시킬 필요가 없이 단일점에서 시뮬레이션 반응 결과만을 활용하고 또한 시뮬레이션의 발전과정에서 성과함수와 입력 파라미터 사이의 논리적인 관계를 기술할 필요가 없어 적용하기에 편리하다고 볼 수 있다. 본 연구의 결과를 다 차원 파라미터 공간으로의 확장하는 문제와 다양한 형태의 시뮬레이션 모형으로 적용 문제는 향후 연구해야 할 과제로 생각된다.

• 대한수학회지
• /
• 제56권4호
• /
• pp.1001-1016
• /
• 2019

We are concerned with optimization methods for the $L^2$-Wasserstein least squares problem of Gaussian measures (alternatively the n-coupling problem). Based on its equivalent form on the convex cone of positive definite matrices of fixed size and the strict convexity of the variance function, we are able to present an implementable (accelerated) gradient method for finding the unique minimizer. Its global convergence rate analysis is provided according to the derived upper bound of Lipschitz constants of the gradient function.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제6권1호
• /
• pp.74-86
• /
• 2014

The optimization techniques are explored in the direction of arrival (DOA) estimation based on single acoustic pressure gradient vector sensor (APGVS). By analyzing the working principle and measurement errors of the APGVS, acoustic intensity approaches (AI) and the minimum variance distortionless response beamforming approach based on single APGVS (VMVDR) are deduced. The radius to wavelength ratio of the APGVS must be not bigger than 0.1 in the actual application, otherwise its DOA estimation performance will degrade significantly. To improve the robustness and estimation performance of the DOA estimation approaches based on single APGVS, two modified processing approaches based on single APGVS are presented. Simulation and lake trial results indicate that the performance of the modified approaches based on single APGVS are better than AI and VMVDR approaches based on single APGVS when the radius to wavelength ratio is not bigger than 0.1, and the two modified DOA estimation methods have excellent estimation performance when the radius to wavelength ratio is bigger than 0.1.

• 한국통신학회논문지
• /
• 제29권10C호
• /
• pp.1402-1413
• /
• 2004

비강체 (non-rigid) 영상 등록에서 추정되는 좌표변환은 가역이어야 함으로 그 변환의 Jacobian 행렬식은 항상 양수 값을 가져야 한다. 본 논문에서는 이러한 가역 조건을 만족하는 좌표변환의 조건을 gradient 크기 제한의 조건으로 구한다. 또한 cubic B-spline을 이용한 변환 모델의 경우, 이 gradient 크기 제한 조건을 만족시키는 인수 집합을 이웃한 두 계수들의 차이가 제한된 인수들의 집합으로 구하였다. 이러한 인수들의 집합은 half space들의 교집합으로 이루어진 convex 집합이다. 본 논문에서는 이 convex 집합에 속하는 인수로 구성되는 좌표변환들 중에서 유사지수 (similarity measure) 를 최대로 만드는 변환을 gradient projection 최적화 기법을 통해 발견하였다. 이론적 분석, 폐 CT (Computed Tomography) 영상을 이용한 시뮬레이션 및 실험을 통하여, 제안된 알고리즘의 성능이 벌칙 함수 penalty function) 를 이용하는 기존의 방법보다 우수함을 증명하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.1254-1261
• /
• 2003

In this paper we present a simple and efficient robust optimal design formulation and its application to a resonant-type micro probe. The basic idea is to use the Gradient Index (GI) to improve robustness of the objective and constraint functions. In the robust optimal design procedure, a deterministic optimization for performance of MEMS structures is followed by design sensitivity analysis with respect to uncertainties such as fabrication errors and change of operating conditions. During the process of deterministic optimization and sensitivity analysis, dominant performance and uncertain variables are identified to define GI. The GI is incorporated as a term of objective and constraint functions in the robust optimal design formulation to make both performance and robustness improved. While most previous approaches for robust optimal design require statistical information on design variations, the proposed GI based method needs no such information and therefore is cost-efficient and easily applicable to early design stages. For the micro probe example, robust optimums are obtained to satisfy the targets for the measurement sensitivity and they are compared in terms of robustness and production yield with the deterministic optimums through the Monte Carlo simulation.