• 한국항행학회논문지
• /
• 제21권5호
• /
• pp.443-449
• /
• 2017

무인기를 이용한 조난자 수색 등의 임무에서 고가의 단일 무인기를 활용하는 것보다 저가의 군집 무인기 운용을 통한 탐색이 효율적이다. 운용하는 무인기의 수가 증가할수록 임무계획에 소요되는 시간이 증가하며 무인기 운용 시스템의 부담이 커진다. 본 논문에서는 확장성, 강건성 및 단순성 측면에서 복수 무인기 운용에 적합한 분산형 지역 탐색 알고리즘을 제안한다. 비용 절감을 위해 각각의 무인기는 근거리 통신, 기본 연산, 그리고 제한된 메모리 능력을 가진다고 가정한다. 근거리 통신에서는 비행 상태 및 기탐색 정보가 공유되며, 이를 바탕으로 상호간 충돌 회피와 다음 탐색 지역을 결정한다. 미탐색 지역으로의 이동에 대한 가중치를 높이고 중복 탐색 기능을 제공하기 위해 score function을 도입하였다. 제안한 알고리즘 및 임무 수행절차의 성능과 특징을 수치시뮬레이션을 통해 검증하였다.

• Nuclear Engineering and Technology
• /
• 제55권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.

• 한국컴퓨터정보학회논문지
• /
• 제4권2호
• /
• pp.135-140
• /
• 1999

본 논문은 영상 부호화시에 걸리는 오랜 시간을 줄이기 위해 스케일링 방식과 탐색영역 제한방식을 이용한 어핀변환 부호화 방식을 제안한다. 제안한 방법의 성능을 평가하기 위해, 제안한 알고리즘과 전통적인 어핀변환 부호화 방식을 사용하는 Jacquin의 방법과 비교하였다. 시뮬레이션 결과, 제안한 알고리즘은 스케일링 방식과 탐색영역 제한 방식을 사용하므로써, 부호화 시간을 상당히 줄일 수 있었다. Jacquin의 방식과 비교해, 복원된 영상의 화질은 약간 저하되었지만 부호화 시간을 많이 단축하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.57-59
• /
• 2006

The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

• 대한한의학원전학회지
• /
• 제25권4호
• /
• pp.105-113
• /
• 2012

Objectives : Acquiring information from symptoms is one of the important method to gain clinically available information in korean medicine. Therefore, up to now, study of symptom terms was frequently implemented in promotion of various information project. In data extraction methods using symptom information from DB, information search using synonym and method using ontology is studied and utilized. However, considering concept of symptom has essential information of appeared body area and phenomenon we think that extending synonym and ontology relationship in symptom terms can be useful for search and set to this study. Methods : We collect terms relevant to human body area and structure described in Donguibogam. Synonymous relationship between collected terms is organized. Relationship between collected terms is build to human-body-knowledge table which has form of Concept+Relation+Concept. Type of relationship is limited on a range of expressing content about parts of human body. Result & Conclusion : Search condition is generated automatically using relationship of the upper area in knowledge table contents. Information of next and previous acupuncture point, upper and lower acupuncture point, left and right acupuncture point can be searched using information of acupuncture point location, order, relative position in area, direction in knowledge table contents.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• 한국군사과학기술학회지
• /
• 제13권5호
• /
• pp.824-830
• /
• 2010

It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.791-796
• /
• 1987

In this paper, an efficient algorithm to estimate the volume and surface area from ultrasonic imaging and a reconstruction algorithm to generate three-dimensional graphics are presented. The computing efficiency is Improved by using the graph theory and the algorithm to determine proper contour points is performed by applying several tolerances. The search for contour points is limited by the change in curvature in order to provide an efficient search of the minimum cost path. These algorithms are applied to a selected mathematical model of ellipsoid. The results show that the measured value of the volume and surface area for the tolerances of 1.0005, 1.001 and 1.002 approximate to the measured values for the tolerance of 1.000 resulting in small errors. The reconstructed 3-dimensional Images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increased.

• 한국컴퓨터정보학회논문지
• /
• 제3권3호
• /
• pp.99-106
• /
• 1998

본 논문에서는 탐색영역 제한방식과 스케일링 방식을 이용하여 프랙탈 부호화시에걸리는 시간을 줄이는 방법으로서 영상통신을 위한 새로운 프랙탈 부호화 기법을 제안한다.먼저, 원영상을 스케일링 방식을 이용해 이분의 일과 사분의 일의 크기를 가지는 영상으로축소한다. 이어서, 이분의 일의 크기를 가지는 레인지 블럭들 중에 사분의 일의 크기를 가지는 도메인 블럭과 가장 유사한 블럭을 탐색영역 제한방식을 이용해 검색하게 된다. 실험 결과, 제안된 알고리즘은 Jacquin의 방법에 비해 복원된 영상의 화질은 약간 떨어졌으나, 압축율이 향상되고 부호화 시간을 크게 감소시킬 수 있었다.

• 한국컴퓨터정보학회논문지
• /
• 제5권3호
• /
• pp.64-69
• /
• 2000

본 논문은 고속 및 고압축을 위한 프랙탈 영상 부호화 기법에 대해서 제안한다. 먼저, 원영상의 크기를 스케일링 방식 및 비트플레인 이용하여 1/2 및 1/4로 축소한다. 이어서, 부호화 시간의 단축을 위해 제한된 영역내에서 원영상의 1/4 크기의 도메인 블록과 가장 유사한 블록을 원영상의 1/2 크기를 가지는 레인지 영역에서 찾는다. 실험 결과, 제안된 알고리즘은 재퀸의 방식에 비해 화질은 다소 저하되었으나, 부호화 시간과 압축율은 많이 향상되었다.