• 한국정보통신학회논문지
• /
• 제10권1호
• /
• pp.206-211
• /
• 2006

수량화 문제는 n개의 성질을 갖는 m개의 개체들을 각 개체들의 유사도(similarity)를 가장 잘 반영하도록 p차원의 공간 상에 대응시키는 문제이다. 본 논문에서는 물리학에서의 열평형 상태(thermal equilibrium state)에서 분자시스템의 해석적 근사 움직임에 대한 이론인 평균장 이론(mean field theory)에 의한 분자의 평균 변화량 계산과 어닐링(annealing) 방법에 의한 평균장 신경회로망(mean field neural network)을 수량화 문제(quantification analysis problem)의 해결에 적용하였다. 그 결과, 제안한 최적화 응용기법 이 기존의 고유치 분석방법(eigen value analysis)에 비해 비용측면에서 좀 더 최적에 가까운 해답을 찾아낼 수 있음을 확인하였다.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.1-17
• /
• 1996

There have been considerable researches for solving large-scale separable convex optimization ptoblems. In this paper we present a method for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. One of them is occurred in reconfiguration of the virtual path network which finds the routing path and assigns the bandwidth of the path for each traffic class in ATM (Asynchronous Transfer Mode) network [1]. The solution is approximated by solving a sequence of the block-angular structured separable quadratic programming problems. Bundle-based decomposition method [10, 11, 12]is applied to each large-scale separable quadratic programming problem. We implement the method and present some computational experiences.

• 한국컴퓨터정보학회논문지
• /
• 제21권2호
• /
• pp.71-77
• /
• 2016

There has been unknown polynomial time algorithm for cellular formation problem (CFP) that is one of the NP-hard problem. Therefore metaheuristic method has been applied this problem to obtain approximated solution. This paper shows the existence of polynomial-time heuristic algorithm in CFP. The proposed algorithm performs coarse-grained and fine-grained cell formation process. In coarse-grained cell formation process, the cell can be formed in accordance with machine frequently used that is the number of other products use same machine with special product. As a result, the machine can be assigned to most used cell. In fine-grained process, the product and machine are moved into other cell that has a improved grouping efficiency. For 35 experimental data, this heuristic algorithm performs better grouping efficiency for 12 data than best known of meta-heuristic methods.

• 대한기계학회논문집A
• /
• 제28권9호
• /
• pp.1314-1319
• /
• 2004

In this study, parameter optimization of micro-static mixer with a cantilever beam was accomplished for maximizing the mixing efficiency by using successive response surface approximations. Variables were chosen as the length of cantilever beam and the angle between horizontal and the cantilever beam. Sequential approximate optimization method was used to deal with both highly nonlinear and non-smooth characteristics of flow field in a micro-static mixer. Shape optimization problem of a micro-static mixer can be divided into a series of simple subproblems. Approximation to solve the subproblems was performed by response surface approximation, which does not require the sensitivity analysis. To verify the reliability of approximated objective function and the accuracy of it, ANOVA analysis and variables selection method were implemented, respectively. It was verified that successive response surface approximation worked very well and the mixing efficiency was improved very much comparing with the initial shape of a micro-static mixer.

• 대한기계학회논문집A
• /
• 제32권3호
• /
• pp.258-266
• /
• 2008

The conventional approximate optimization method, which uses the statistical design of experiments(DOE) and response surface method(RSM), can derive an approximated optimum results through the iterative process by a trial and error. The quality of results depends seriously on the factors and levels assigned by a designer. The purpose of this study is to propose a new technique, which is called a sequential design of experiments(SDOE), to reduce a trial and error procedure and to find an appropriate condition for using artificial neural network(ANN) systematically. An appropriate condition is determined from the iterative process based on the analysis of means. With this new technique and ANN, it is possible to find an optimum design accurately and efficiently. The suggested algorithm has been applied to various mathematical examples and a structural problem.

• 제어로봇시스템학회논문지
• /
• 제21권12호
• /
• pp.1193-1200
• /
• 2015

An effective swing trajectory of legged robots is different from the swing trajectories of humans or animals because of different dynamic characteristics. Therefore, it is important to find optimal parameters through experiments. This paper proposes a real-time nonlinear programming (RTNLP) method for optimization of the swing trajectory of the legged robot. For parameterization of the trajectory, the swing trajectory is approximated to parabolic and cubic spline curves. The robotic leg is position-controlled by a high-gain controller, and a cost function is selected such that the sum of the motor inputs and tracking errors at each joint is minimized. A simplified dynamic model is used to simulate the dynamics of a robotic leg. The purpose of the simulation is to find the feasibility of the optimization problem before an actual experiment occurs. Finally, an experiment is carried out on a real robotic leg with two degrees of freedom. For both the simulation and the experiment, the design variables converge to a feasible point, reducing the cost value.

• 한국인터넷방송통신학회논문지
• /
• 제14권3호
• /
• pp.191-198
• /
• 2014

본 논문은 복잡한 비평활 발전비용함수를 가진 경제급전의 최적화 문제를 풀기 위해 단순히 선형 근사함수를 이용하는 방법을 제안하였다. 제안된 알고리즘은 비평활 발전비용 함수를 선형으로 근사시키고, 요구량이 현재의 발전량을 초과하는 경우 발전단가가 비싼 발전기의 가동을 중지시키고, 발전단가가 보다 큰 발전기의 발전량을 감소시켜 요구량과 발전량의 균형을 맞추는 개념을 도입하였다. 경제급전 문제의 시험사례로 빈번히 활용되고 있는 데이터에 대해 제안된 알고리즘을 적용한 결과 기존의 휴리스틱 알고리즘의 최적화 해를 획기적으로 감소시킬 수 있었으며, 현재 실무적으로 적용되고 있는 2차 평활함수 근사법과 유사한 결과를 얻었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 정기총회 및 창립40주년기념 학술대회 학회본부
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.3841-3861
• /
• 2017

Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

• 전자공학회논문지
• /
• 제52권8호
• /
• pp.3-9
• /
• 2015

본 논문에서는 사용 가능한 최대 송신 전력과 만족해야 하는 최소 전송률에 대한 제한 조건 아래에서, maximal ratio transmission (MRT) 기법 사용 시 다중 사용자 다중 안테나 하향링크 시스템의 에너지 효율을 최대화하는 최적의 안테나 수와 송신 전력을 찾는 알고리즘을 제시한다. 순시 채널에 대한 최적화 문제는 직접 풀기 어려우므로 단말 간 채널의 독립성, 평균 채널 이득, 평균 path loss를 이용하여 근사한다. 근사된 에너지 효율에 대한 최적화 문제는 두 개의 변수를 동시에 고려해야 하는 2차원 최적화 문제가 된다. 우리는 이러한 2차원 최적화 문제를 라그랑지 승수법과 제안하는 알고리즘을 통하여 최적의 안테나 수와 송신 전력을 구한다. 실험을 통해, 제안하는 알고리즘으로 구한 최적의 송신 안테나 수와 송신 전력이 exhaustive search로 찾은 값과 근사함을 확인한다.