http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
결합된 퍼지 제어기를 이용한 볼과 플레이트 시스템에서의 추정제어기 설계
서민석(Seo Minseok),현창호(Hyun Changho),박민용(Park Mignoon) 대한전기학회 2006 대한전기학회 학술대회 논문집 Vol.2006 No.10
A ball moving on a beam is a typical nonlnear dynamic system, which is often adopted to proof test diverse control schemes. Ball and plate system is the extension of the traditional ball and beam problem that moves a metal ball on a rigid plate. In this paper, a trajectory planning and tracking problem is proposed for ball and plate system, which is La control the ball from a point to another without hitting the obstacles. Our scheme is composed of three controllers, TS type optimal path tracking controller, mandani type obstacle avoidance controller and trajectory planning controller that determines the desired trajectory. But this type of construction can give rise to chattering executions. Because the difference of contributions from concurrent controllers can cause behaviors unsmoothly We propose fuzzy pid supervision controller to handle this problem.
스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발
서민석(Minseok Seo),김대철(Daecheol Kim) 한국경영과학회 2008 한국경영과학회지 Vol.33 No.3
The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al's algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.
스타이너 트리 문제를 위한 Max-Min Ant Colony Optimization
서민석(Minseok Seo),김대철(Daecheol Kim) 한국경영과학회 2009 經營 科學 Vol.26 No.1
The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim’s algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.