• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.258-260
• /
• 2007

Nowadays the automotive circuit design becomes more complicated a practical modern car circuit usually contains thousands of wires. So the error connection between connector and pins becomes more difficult to be located. This paper proposes a general way to locate all error wires in an automotive circuit design. Firstly, we give an exact definition of error wire to guide our job. This definition also composes the core part of our algorithm. Then we limit the area of the error wires by several steps. During these steps, we apply breadth-first search method to step over all wires under consideration of reducing time cost. In addition, we apply bidirectional stack technique to organize the data structure for algorithm optimization. This algorithm can get a result with all error wires and doubtful wires in a very efficient way. The analysis of this algorithm shows that the complexity is linear. We also discuss some possible improvement of this algorithm.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1590-1595
• /
• 2003

Direct drive servovalve(DDV) is a kind of one-stage valve since the rotary motion of DC motor is directly transferred to the linear motion of valve spool through the link. Since the structure of DDV is simple, it is less expensive, more reliable and offers reduced internal leakage and reduced sensitivity to fluid contamination. However, the flow force effect on the spool motion is significant such that it induces large steady-state error in a step response. If the proportional control gain is increased to reduce the steady-state error, the system becomes unstable. In order to satisfy the system design requirements, the lead-lag controller is designed using the complex method that is one kind of constrained direct search method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.490-490
• /
• 2000

Parallel genetic algorithms are particularly easy to implement and promise substantial gains in performance. Its basic idea is to keep several subpopulations that are processed by genetic algorithms. Furthermore, a migration mechanism produces a chromosome exchange between subpopulation. In this paper, a new selection method based on non-linear fitness assignment presented. The use of proposed ranking selection permits higher local exploitation search, where the diversity of populations is structure. Experimental results show that the relation between local-global search balance and the probabilities of reaching a desired solution.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.1088-1090
• /
• 1997

This paper presents an effective methodology of optimal environmental and economic operation using evolution strategy. In power systems, evolution strategy, based on natural selection and genetics, can analyze non-linear and discontinuous functions in global search techniques. The formulation using this search techniques is multi-objective function, which consists of fuel cost and environmental effects concerning the pollution of the Earth's atmosphere caused by the emission of $SO_2$ and $NO_x$ from thermal generator plants. The proposed algorithms are applied on system with 6 generator.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.2019-2022
• /
• 2002

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.

• Advances in robotics research
• /
• 제2권1호
• /
• pp.1-11
• /
• 2018

To monitor the environment and determine the source of a pollutant gradient using a multiple robot swarm, we propose a hybrid algorithm that combines two bio-inspired algorithms mimicking chemotaxis and pheromones of bacteria. The algorithm is implemented in virtual robot agents in a simulator to evaluate their feasibility and efficiency in gradient maps with different sizes. Simulation results show that the chemotaxis controller guided robot agents to the locations with higher pollutant concentrations, while the pheromone marked in a virtual field increased the efficiency of the search by reducing the visiting redundancy. The number of steps required to reach the target point did not increase proportionally as the map size increased, but were less than those in the linear whole-map search method. Furthermore, the robot agents could function with simple sensor composition, minimum information about the map, and low calculation capacity.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
• /
• pp.1104-1111
• /
• 1994

Code Excited Linear Prediction(CELP) as a speech coder exhibits good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their large amount of computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the pitch searching range by estimating the preliminary pitches. Applying the proposed method to the CELP vocoder, we can get approximately 87% complexity reduction in the pitch search.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
• /
• pp.904-911
• /
• 1994

Code Excited Linear Prediction (CELP) speech coders exhibit good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their many computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reducing complexity. The basic idea is to apply the preprocessing technique beforehand grasping the autocorrelation property of speech waveform. By using the proposed method, we can get approximately 77% complexity reduction in the pitch search.

• 대한원격탐사학회지
• /
• 제8권1호
• /
• pp.15-26
• /
• 1992

This paper describes an implementation of adaptive stereo matching for DBM generation. The matching method of two stereo satellite images to find corresponding points used in this paper is area-based matching, which is usually used in the field of making DBM. Same window size and search area used as in the conventional matching methods and we propose adaptive stereo matching algorithm in this paper. We cluster three areas which are consist of mountainous areas, cultivated areas and cities, and rivers and lakes by using proposed linear feature extracting method. These classified areas are matched by adaptive window size and search area, but rivers and lakes is excluded in this experiment. The matching time is three times faster than conventional methods.

• Journal of Hydrospace Technology
• /
• 제2권2호
• /
• pp.24-35
• /
• 1996

This paper describes parameter identification techniques formulated for the estimation of maneuvering coefficients of a submerged body. The first part of this paper is concerned with the identifiability of the system parameters. The relationship between a stochastic linear time-invariant system and the equivalent dynamic system is investigated. The second is concerned with the development of the numerically stable identification technique. Two identification techniques are tested; one is the ma7mum likelihood (ML) methods using the Holder & Mead simplex search method and using the modified Newton-Raphson method, and the other is the modified extended Kalman filter (MEKF) method with a square-root algorithm, which can improve the numerical accuracy of the extended Kalman filter. As a results, it is said that the equations of motion for a submerged body have higher probability to generate simultaneous drift phenomenon compared to general state equations and only the ML method using the Holder & Mead simplex search method and the MEKF method with a square-root algorithm gives acceptable results.