• 대한기계학회논문집A
• /
• 제39권5호
• /
• pp.535-541
• /
• 2015

본 연구에서는 벽걸이 모니터 브라켓 암의 다중목적 근사최적설계를 수행하였다. 이를 위해 브라켓 암의 자유도를 고려하여 평면내의 회전 각도를 선정해 응력과 처짐량이 크게 발생하는 경우에 대한 최적화 문제를 정식화 하였다. 직교배열표와 반응표면법을 사용하여 평균 및 파라미터 분석을 통해 성능지수에 대한 설계변수 민감도를 확인하였으며, 중심합성계획법과 D-최적 계획법을 사용하여 목적함수와 제한조건함수에 대하여 반응표면 근사모델을 생성하고 $R^2$ 값을 통해 정확도를 평가하였다. 이를 비지배 분류 유전알고리즘에 적용하여 최적화를 수행하고 유한요소해석을 통해 검증하였다. 또한, 중심합성 계획법과 D-최적 계획법을 이용한 최적해를 비교 분석하였다.

• 한국전산구조공학회논문집
• /
• 제21권3호
• /
• pp.239-245
• /
• 2008

확장 B-스플라인 기저함수(extended B-spline basis functions)을 이용한 레벨셋 기반의 위상 형상 최적설계 기법을 정상 상태의 열전도 문제에 대하여 개발하였다. 본 해석법은 레벨셋으로 결정된 영역 안쪽만 고려하여 해석을 수행하게 되므로 열전달 문제에서 생길 수 있는 영역 바깥부분 영향을 제거할 수 있다. 설계민감도 해석으로부터 결정되는 법선속도를 활용하여 헤밀턴-자코비 방정식의 해를 구하게 되며, 주어진 체적조건 하에서 열 컴플라이언스(thermal compliance)가 최소가 되는 방향으로 최적의 형상을 결정할 수 있다. 형상 설계민감도를 정확하게 얻기 위해서는 레벨셋 함수와 B-스플라인 함수를 이용하여 수직 단위 벡터와 형상의 곡률을 정확히 결정하며, 위상 설계민감도를 통해 최적화과정 동안 필요한 위치와 시점에서 위상의 변화를 주는 홀을 쉽게 생성할 수 있다.

• Earthquakes and Structures
• /
• 제5권1호
• /
• pp.83-109
• /
• 2013

A simple damper optimization method is proposed to find optimal damper allocation for shear buildings under both target added damping ratio and interstorey drift ratio (IDR). The damping coefficients of added dampers are considered as design variables. The cost, which is defined as the sum of damping coefficient of added dampers, is minimized under a target added damping ratio and the upper and the lower constraint of the design variables. In the first stage of proposed algorithm, Simulated Annealing, Nelder Mead and Differential Evolution numerical algorithms are used to solve the proposed optimization problem. The candidate optimal design obtained in the first stage is tested in terms of the IDRs using linear time history analyses for a design earthquake in the second stage. If all IDRs are below the allowable level, iteration of the algorithm is stopped; otherwise, the iteration continues increasing the target damping ratio. By this way, a structural response IDR is also taken into consideration using a snap-back test. In this study, the effects of the selection of upper limit for added dampers, the storey mass distribution and the storey stiffness distribution are all investigated in terms of damper distributions, cost function, added damping ratio and IDRs for 6-storey shear building models. The results of the proposed method are compared with two existing methods in the literature. Optimal designs are also compared with uniform designs according to both IDRs and added damping ratios. The numerical results show that the proposed damper optimization method is easy to apply and is efficient to find optimal damper distribution for a target damping ratio and allowable IDR value.

• 대한전자공학회논문지SP
• /
• 제41권3호
• /
• pp.1-8
• /
• 2004

본 논문은 영상에서 등광도선 정보를 사용한 상표 및 자막영역의 원영상 복원 방법을 제안한다. 제안한 방법은 유사한 밝기값을 가진 픽셀들을 연결한 등광도선을 영상복원을 위한 정칙화 연산자로 사용하고, 이 정칙화 연산자를 가진 비용 함수를 유전자 알고리즘을 사용하여 최소화하는 픽셀값을 추정하여 영상을 복원한다. 제안한 방법을 영상에 포함된 상표 및 자막영역과 노이즈를 제거하고 원영상으로 복원하는데 적용한 결과, 정칙화 이론에서 사용하는 Laplacian과 같은 미분 연산자보다 등광도선 연산자가 ISNR의 향상과 복원효과가 뛰어남을 알 수 있다.

• 한국군사과학기술학회지
• /
• 제18권3호
• /
• pp.226-233
• /
• 2015

Pose estimation is an important operation for many vision tasks. This paper presents a method of estimating the camera pose, using a known landmark for the purpose of autonomous vertical takeoff and landing(VTOL) unmanned aerial vehicle(UAV) landing. The proposed method uses a distinctive methodology to solve the pose estimation problem. We propose to combine extrinsic parameters from known and unknown 3-D(three-dimensional) feature points, and inertial estimation of camera 6-DOF(Degree Of Freedom) into one linear inhomogeneous equation. This allows us to use singular value decomposition(SVD) to neatly solve the given optimization problem. We present experimental results that demonstrate the ability of the proposed method to estimate camera 6DOF with the ease of implementation.

• 전기학회논문지
• /
• 제58권6호
• /
• pp.1057-1064
• /
• 2009

This paper introduces a new approach based on a quantum-inspired evolutionary algorithm (QEA) to solve unit commitment (UC) problems. The UC problem is a complicated nonlinear and mixed-integer combinatorial optimization problem with heavy constraints. This paper proposes a bounded quantum evolutionary algorithm (BQEA) to effectively solve the UC problems. The proposed BQEA adopts both the bounded rotation gate, which is simplified and improved to prevent premature convergence and increase the global search ability, and the increasing rotation angle approach to improve the search performance of the conventional QEA. Furthermore, it includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in the UC problems. Since the excessive spinning reserve can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BQEA, it is applied to the large-scale power systems of up to 100-unit with 24-hour demand.

• 한국항행학회논문지
• /
• 제13권4호
• /
• pp.523-531
• /
• 2009

본 논문에서는 패킷 손실 채널로의 전송을 위한 비디오 부호기의 소스/채널 부호화율 통합 제어 방식을 제안한다. 비디오 전송 시스템의 지연 제약에 따른 소스 부호화율 상한을 구하고, 부호화되거나 스킵된 화면에 대한 소스 왜곡과 패킷 손실에 의한 채널 왜곡을 기반으로 일정 부호화 구간에 대한 평균 왜곡을 정의한다. 주어진 채널률과 패킷 손실률에 대해 비디오 부호화 계수와 FEC 블록 크기를 제어계수로 하는 평균 왜곡 최소화 문제를 정의하고, 실시간 해결 알고리즘을 제안한다. 모의실험에서 제안방식은 40% 이하의 패킷 손실률과 30 프레임 이상의 인트라 매크로블럭 갱신률에서 TMN8에 비해 PSNR과 주관적 화질에서 우수한 성능을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1390-1405
• /
• 2014

This paper investigates optimal relay selection and power allocation under an aggregate power constraint for cooperative wireless sensor networks assisted by amplify-and-forward relay nodes. By considering both transmission power and circuit power consumptions, the received signal-to-noise ratio (SNR) at the destination node is calculated, based on which, a relay selection and power allocation scheme is developed. The core idea is to adaptively adjust the selected relays and their transmission power to maximize the received SNR according to the channel state information. The proposed scheme is derived by recasting the optimization problem into a three-layered problem-determining the number of relays to be activated, selecting the active relays, and performing power allocation among the selected relays. Monte Carlo simulation results demonstrate that the proposed scheme provides a higher received SNR and a lower bit error rate as compared to the average power allocation scheme.

• 대한전기학회논문지
• /
• 제37권5호
• /
• pp.272-281
• /
• 1988

The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

• 한국정보시스템학회지:정보시스템연구
• /
• 제25권1호
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.