• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.3030-3038
• /
• 2023

Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

• Journal of Mechanical Science and Technology
• /
• v.20 no.1
• /
• pp.133-146
• /
• 2006

Collaborative optimization (CO) is a multi-level decomposed methodology for a large-scale multidisciplinary design optimization (MDO). CO is known to have computational and organizational advantages. Its decomposed architecture removes a necessity of direct communication among disciplines, guaranteeing their autonomy. However, CO has several problems at convergence characteristics and computation time. In this study, such features are discussed and some suggestions are made to improve the performance of CO. Only for the system level optimization, genetic algorithm is used and gradient-based method is used for subspace optimizers. Moreover, response surface models are replaced as analyses in subspaces. In this manner, CO is applied to aero-structural design problems of the aircraft wing and its results are compared with the multidisciplinary feasible (MDF) method and the original CO. Through these results, it is verified that the suggested approach improves convergence characteristics and offers a proper solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.852-856
• /
• 2004

An induction motor is one of the most popular electrical apparatuses owing to its simple structure and robust construction. Parameter identification of the induction motor has long been researched either for a vector control technique or fault detection. Since vector control is a well-established technique for induction motor control, this paper concentrates on successive identification of physical parameters with on-load data for the purpose of condition monitoring and/or fault detection. For extracting six physical parameters from the on-load data in the framework of the induction motor state equation, unmeasured initial state values and profiles of load torque have to be estimated as well. However, the analytic optimization methods in general fail to estimate these auxiliary but significant parameters owing to the difficulty of obtaining their gradient information. In this paper, the univariate dynamic encoding algorithm for searches (uDEAS) newly developed is applied to the identification of whole unknown parameters in the mathematical equations of an induction motor with normal operating data. Profiles of identified parameters appear to be reasonable and therefore the proposed approach is available for fault diagnosis of induction motors by monitoring physical parameters.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.11
• /
• pp.49-54
• /
• 2005

This paper proposes the low power MDCT algorithm for precise FV with minimum size of sub-window in mobile phone. Proposed algerian uses the coefficient at the middle of whole result process requiring the least number of calculations, since it has a good characteristic when used as standard of the FV and needs minimum amount of operation. In addition, using the DCT result related to the middle frequency makes the characteristic of FV more superior because it suppresses the impulsive noise and difference of focus values is larger than any others. The proposed algorithm is implemented using Verilog HDL and verified using Excalibur-ARM board.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.169-174
• /
• 2005

In this paper, we proposed a new algorithm of the inverse scattering for the reconstruction of unknown dielectric scatterers using the finite-difference time-domain method and the design sensitivity analysis. We introduced the design sensitivity analysis based on the gradient for the fast convergence of the reconstruction. By introducing the adjoint variable method for the efficient calculation, we derived the adjoint variable equation. As an optimal algorithm we used the steepest descent method and reconstructed the dielectric targets using the iterative estimation. To verify our algorithm we will show the numerical examples for the two-dimensional $TM^2$ cases.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.2062-2069
• /
• 2001

It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a method is presented in this paper which uses synthetic artificial intelligent technique, that is, Adaptive-Network-based Fuzzy Inference System(ANFIS) solved via hybrid learning algorithm(the back-propagation gradient descent and the least-squares method) are used to learn the input(the location and depth of a crack)-output(the structural eigenfrequencies) relation of the structural system. With this ANFIS and a continuous evolutionary algorithm(CEA), it is possible to formulate the inverse problem. CEAs based on genetic algorithms work efficiently for continuous search space optimization problems like a parameter identification problem. With this ANFIS, CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.182-188
• /
• 2001

It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a method is presented in this paper which uses synthetic artificial intelligent technique, that is, Adaptive-Network-based Fuzzy Inference System(ANFIS) solved via hybrid learning algorithm(the back-propagation gradient descent and the least-squares method) are used to learn the input(the location and depth of a crack)-output(the structural eigenfrequencies) relation of the structural system. With this ANFIS and a continuous evolutionary algorithm(CEA), it is possible to formulate the inverse problem. CEAs based on genetic algorithms work efficiently for continuous search space optimization problems like a parameter identification problem. With this ANFIS, CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.392-393
• /
• 2005

Due to the temporal and spatial simultaneity and the high-frequency repetition, the data set retrieved from the satellite observation is considered to be the most desirable ones for the study of air-sea interaction. With rapidly developing sensor technology, satellite-retrieved data has experienced improvement in the accuracy and the number of parameters. Nevertheless, since it is still impossible to directly measure the heat fluxes between air and sea, the bulk method is an exclusive way for the evaluation of the heat fluxes at the sea surface. It was noted that the large deviation of air temperature in the winter season by the linear regression despite good correlation coefficients. We propose a new algorithm based on the Fourier series with which the SST and the air temperature. We found that the mean of air temperature is a function of the mean of SST with the monthly gradient of SST inferred from the latitudinal variation of SST and the spectral energy of air temperature is related linearly to that of SST. An algorithm to obtain the air temperature over the sea was completed with a proper analysis on the relation between of air temperature and of SST. This algorithm was examined by buoy data and therefore the air temperature over the sea can be retrieved based on just satellite data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.2
• /
• pp.162-171
• /
• 1991

This paper presents an algorithm for compressing image data by separating the image into two parts. I.e. edge image containing high-frequency components and non-edge image containing low-frequency components of image. The edge image is extracted by using 8 level compass gradient masks and the non-edge image is obtained by removing the edge image from the original image. The edge image is coded by Huffman run-length code and the non edge image is transformed first by DCT and the transformed images is coded next by a quantized bit allocation table. For an example image. GIRL. the proposed algorithm shows bit rate of 0.52 bpp with PSNR of 36dB.

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.636-642
• /
• 2015

This paper presents an application of heuristic harmony search (HS) optimization algorithm for the identification of linear continuous time-delay system from step response. Identification model is first-order plus dead time (FOPDT), which describes a linear monotonic process quite well in most chemical processes and HAVC process and is often sufficient for PID controller tuning. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the identification method has been demonstrated through a number of simulation examples.