• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.91-97
• /
• 2002

This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.139-144
• /
• 2008

In this study, damage detection method using harmony search method and frequency response is proposed. In order to verify this method, the following approaches are implemented. Firstly, damage detection method using harmony search is developed. To detect damage, objective function that minimize difference with natural frequency and modal strain energy from undamaged and damaged model is used. Secondly, finite element model for beam structure is created. And damage scenario is determined. Lastly, damage detection is performed by proposed method and utility of proposed method is verified.

• IE interfaces
• /
• v.22 no.1
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.4
• /
• pp.811-825
• /
• 1998

An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.39-47
• /
• 1997

There are four parameters (i.e. overall density, local density, grouping, layout complexity) to consider in designing screen of a visual display terminal. Among these, only the optimum level of overall density is known to be about 25~30% by some studies. Therefore, the present experiment is conducted to define the optimum levels of the other parameters to achieve the user's best performance in visual search task. The results are as follows; (1) The function related to the levels of local density and user's search times is shown to be U -shaped. When the level of local density is about 40%, the search time is shorter than those of any other levels. (2) In the experiment of grouping, user's performance is best when the number of group is 5, and the size of group does not exceed visual angle $5^{\circ}$ (0,088rad). (3) The user performance is improved as the layout becomes less complex.

• Smart Structures and Systems
• /
• v.7 no.2
• /
• pp.117-132
• /
• 2011

This paper is aimed at presenting two methods on the basis of pattern search and genetic algorithms to detect and estimate damage in plates using the modal data of a damaged plate. The proposed methods determine the damages of plate structures using optimization of an objective function by pattern search and genetic algorithms. These methods have been applied to two numerical examples, namely four-fixed supported and cantilever plates with and without noise in the modal data and containing one or several damages. The obtained results clearly reveal that the proposed methods can be viewed as a powerful and reliable method for structural damage detection in plates using the modal data.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1830-1831
• /
• 2006

In this paper, the search is conducted along each of the coordinate directions for finding the minimum. If $e_i$ is the unit vector along the coordinate direction i, we determine the value a, minimizing f(a)= $f(x+ae_i)$, where a is a real number. A move is made to the new point $x+a_ie_i$ at the end of the search along the direction i. In an n dimensional problem, we define the search along all the directions as one stage. The function value at the end of the stage is compared to the value at the beginning of the stage in establishing the convergence. The gradient appears to be zero at point. We can safeguard this by introducing an acceleration step of one additional step along the pattern direction developed by moves along the coordinate directions.

• International journal of advanced smart convergence
• /
• v.9 no.3
• /
• pp.239-245
• /
• 2020

The Ewha Music Database (EMDB) is an online database comprised of primary source materials related to music education from East Asia during the modern era (1880 to 1945) when Korea, Japan, and China were geopolitically and culturally intertwined. We developed the incipit search in EMDB as an embedded tool. This is the first attempt in Korea to implement a unique search function of musical data using alphabets of musical notes. Unlike in traditional search system that uses general literature information search conditions, such as author, title, publisher, year, number of pages, etc., it offers a new way of searching a musical piece/work and sheet music. This study confirms that digital information technology is an important methodology for research of music culture as a field of humanities.

• Journal of Magnetics
• /
• v.13 no.1
• /
• pp.34-36
• /
• 2008

For the measurement of the magnetic field distribution with high spatial resolution and high accuracy, the magnetic field sensing probe must be non-magnetic, but the MFM probe and sub-millimeter-meter size Hall probe use a ferromagnetic tip and block, respectively, to increase the sensitivity. To overcome this drawback, we developed a micro-size search coil magnetometer which consists of a single turn search coil, Terfenol-D actuator, scanning system, and control software. To reduce the noise generated by the stray ac magnetic field of the actuator driving coil, we employed an even function $\lambda$-H magnetostriction curve and lock-in technique. Using the developed magnetometer, we were able to measure the magnetic field distribution with a magnetic field resolution of 1 mT and spatial resolution of $0.1mm{\times}0.2mm$ at a coil vibration frequency of 1.8 kHz.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.609-614
• /
• 1989

A collision avoidance algorithm based on a heuristic graph search and subgoals is presented. The joint angle space is quantized into cells. The evaluation function for a heuristic search is defined by the sum of the distance between the links of a manipulator and middle planes among the obstables and the distance between the end-effector and the subgoals on desired trajectory. These subgoals reduce the combinatorial explosion in the search space. This method enables us to avoid a dead-lock in searching. Its effectiveness has been verified by simulation studies.