• 한국통신학회논문지
• /
• 제25권1B호
• /
• pp.128-140
• /
• 2000

본 논문에서는 이웃 탐색점에서의 평균 절대치 오차 (mean absoulte error, MAE) 및 탐색여역 줄임을 이용한 고속 블록 정합 알고리듬 제안하였다. 이 알고리듬은 두 단계로 구성되어있다. 첫 번째 단계에서는 탐색영역을 3$\times$3 크기의 영역으로 겹치지 않게 나눈 뒤, 각 영역의 중심 탐색점에 대하여 블록 정합을 행하여 MAE를 구하고, 이들 중 가장 작은 MAE를 기준 MAE로 정한다. 그리고, 두 번째 단계에서는 각 영역의 중심 탐색점에서의 MAE를 이용하여 각 3$\times$3 영역의 나머지 탐색점에서의 MAE의 최소 범위를 구한 뒤, 최소 범위가 기준 MAE로 결정된 탐색점 근처에 존재할 가능성이 매우 큼을 이용하여 기준 MAE로 결정된 탐색점을 중심으로 탐색영역의 크기를 줄인 뒤, 블록 정합이 필요한 탐색점에 대하여서만 블록 정합을 행함으로써 고속으로 움직임을 추정하였다. 모의 실험을 통하여 본 제안한 방법이 우수한 움직임 추정 성능을 유지하면서도 많은 계산량의 감소를 얻을 수 있음을 확인하였다.

• 전기전자학회논문지
• /
• 제25권3호
• /
• pp.437-444
• /
• 2021

본 논문은 로봇이 다양한 지형 탐색이 가능한 자율 주행 알고리즘을 제안하고, 지형 탐색 중 로봇의 이동 경로를 모니터링 할 수 있는 애플리케이션을 구현한다. 구현한 애플리케이션은 이동 로봇의 위치, 방향, 속력, 동작을 나타내는 상태부와 지형 탐색을 통해 얻은 지형 정보를 나타내는 지도부, 이동 로봇의 동작을 제어하는 제어부로 구성된다. 로봇의 움직임 제어는 탐색/복귀의 시작과 정지만 애플리케이션으로 명령하고, 탐색을 위한 모든 주행은 자율로 하도록 하였다. 지형 탐색의 기본적인 알고리즘은 적외선 센서를 이용해 좌측, 전방, 우측, 후방 순으로 장애물을 확인하여 장애물이 없는 곳이 이동하고 이동한 경로가 막다른 길이면 이전 위치로 돌아와 다른 방향으로 이동하여 탐색을 계속하는 과정을 반복하여 지형을 탐색한다.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.999-1005
• /
• 2018

본 논문에서는 전력계통에서 정밀하고 변화에 수렴성이 빠른 탐색을 기반으로 하는 주파수 추정 기법을 제안하였다. 제안된 주파수 추정 알고리즘은 고분해능 스펙트럼의 기울기를 추정하여 스펙트럼의 peak 점을 탐색하는 구조를 적용하였다. 과도적으로 주파수 변화가 큰 경우에 기존 방법들의 단점인 수렴속도가 늦는 점을 보완 또는 개선하기 위한 방법으로 Context analysis를 통하여 Full-search 기법과 주파수 추정변수들을 적응적으로 적용하여 주파수 추정의 정밀도와 수렴속도를 향상시키고 대표적인 주파수 추정기법인 DFT(discrete Fourier transform) 방법, ECKF(extended complex Kalman filter), MV(minimum variable)방법들과 비교하여 수렴성과 정밀도가 우수함을 보였다.

• International Journal of Control, Automation, and Systems
• /
• 제3권2호
• /
• pp.236-243
• /
• 2005

This paper presents a new stochastic approach for solving combinatorial optimization problems by using a new selection method, i.e. SA-selection, in genetic algorithm (GA). This approach combines GA with simulated annealing (SA) to improve the performance of GA. GA and SA have complementary strengths and weaknesses. While GA explores the search space by means of population of search points, it suffers from poor convergence properties. SA, by contrast, has good convergence properties, but it cannot explore the search space by means of population. However, SA does employ a completely local selection strategy where the current candidate and the new modification are evaluated and compared. To verify the effectiveness of the proposed method, the optimization of a fuzzy controller for balancing an inverted pendulum on a cart is considered.

• Structural Engineering and Mechanics
• /
• 제50권3호
• /
• pp.365-382
• /
• 2014

In this article, the force method and Charged System Search (CSS) algorithm are used for the analysis and optimal design of truss structures. The CSS algorithm is employed as the optimization tool and the force method is utilized for analysis. In this paper in addition to member's cross sections, redundant forces, geometry and topology variables are considered as the optimization variables. Minimum complementary energy principle is used directly to analyze the structure. In the presented method, redundant forces are calculated by the CSS in order to minimize the energy function. Combination of the CSS and force method leads to an efficient algorithm in comparison to some of the optimization algorithms.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(2)
• /
• pp.561-564
• /
• 2004

The motion estimation which requires huge computation consumes large power in a video encoder. Although a number of fast-search algorithms are proposed to reduce the power consumption, the smaller the computation, the worse the performance they have. In this paper, we propose an architecture that a low energy management scheme can be applied with several fast-search algorithm. In addition. we show that ECVH, a software scheduling scheme which dynamically changes the search algorithm, the operating frequency, and the supply voltage using the remaining slack time within given power-budget, can be applied to the architecture, and show that the power consumption can be reduced.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.30-47
• /
• 2004

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

• 대한안전경영과학회지
• /
• 제6권2호
• /
• pp.141-154
• /
• 2004

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.311-314
• /
• 2004

The 2 DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical rectangular bins. The 2 DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.