• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.4
• /
• pp.887-895
• /
• 1995

Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.770-772
• /
• 2015

어미로부터 생후 21일령 또는 28일령에 젖을 때는 이유자돈들만을 개별적인 돈사에서 합사하는 경우, 낯선 환경 및 새로운 동료들과의 서열 구분을 위한 공격적인 행동이 매우 빈번하게 발생한다. 이로 인한 돼지의 성장 저하는 농가의 소득 하락으로 이어져 국내 외 양돈 농가의 큰 문제로 인식되고 있다. 본 논문에서는 키넥트 카메라에서 취득할 수 있는 영상의 깊이정보를 이용하여 이유자돈들의 공격적인 행동을 조기 탐지할 수 있는 프로토타입 모니터링 시스템을 제안한다. 먼저 제안한 시스템은 키넥트의 적외선 센서에서 실시간으로 취득하는 깊이 정보로부터 움직임이 있는 객체들만을 탐지하고, 해당 객체들의 ROI를 설정한다, 둘째, ROI를 이용하여 5가지 특정 정보(객체의 평균, 최고, 최소 속도, 객체 속도의 표준편차, 두 객체 사이의 최소 거리)를 추출한다. 셋째, 취득한 특징 정보는 이진 클래스 분류 문제로 해석하여, 기계학습의 대표적인 모델인 SVM을 탐지기로 사용하였다. 실제 이유자돈사에서 취득한 키넥트 영상을 이용하여 모의 실험을 수행한 결과 안정적인 성능을 확인하였다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.18 no.3
• /
• pp.113-127
• /
• 2015

Recently, there has been a growing interest in UAS(Unmanned Aerial System), and it is required to develop techniques to effectively detect water body from the recorded images in order to implement flood monitoring using UAS. This study used a UAS with RGB and NIR+RG bands to achieve images, and applied supervised classification method to evaluate the accuracy of water body detection. Firstly, the result for accuracy in water body image classification by RGB images showed high Kappa coefficients of 0.791 and 0.783 for the artificial neural network and minimum distance method respectively, and the maximum likelihood method showed the lowest, 0.561. Moreover, in the evaluation of accuracy in water body image classification by NIR+RG images, the magalanobis and minimum distance method showed high values of 0.869 and 0.830 respectively, and in the artificial neural network method, it was very low as 0.779. Especially, RGB band revealed errors to classify trees or grasslands of Songsan amusement park as water body, but NIR+RG presented noticeable improvement in this matter. Therefore, it was concluded that images with NIR+RG band, compared those with RGB band, are more effective for detection of water body when the mahalanobis and minimum distance method were applied.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.135-143
• /
• 2012

This paper suggests the optimal blood distribution center algorithm that satisfies the minimum total transportation cost and within the allowable distribution time $T^*$. Zhang and Yang proposes shifting the location of each point that has less than the average distance of two maximum distance points from each point. But they cannot decide the correct facility location because they miscompute the shortest distance. This algorithm computes the shortest distance $l_{ij}$ from one area to another areas. Then we select the $v_i$ area to thecandidate distribution center location such that $_{max}l_{ij}{\leq}L^*$ and the $v_i$ such that $l_{ij}-L^*$ area that locates in ($v_i,v_k$) and ($v_j,v_l$) from $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$ path and satisfies the $_{max}l_{ij}{\leq}L^*$ condition. Finally, we decide the candidate distribution area that has minimum transportation cost to optimal distribution area.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.10
• /
• pp.1349-1354
• /
• 2001

In the Traveling Salesman Problem(TSP), a set of N cities is given and the problem is to find the shortest route connecting them all, with no city visited twice and return to the city at which it started. Since TSP is a well-known combinatorial optimization problem and belongs to the class of NP-complete problems, various techniques are required for finding optimum or near optimum solution to the TSP. Especially DNA computing, which uses real bio-molecules to perform computations supported by molecular biology, has been studied by many researchers to solve NP-complete problem using massive parallelism of DNA computing. Though very promising, DNA computing technology of today is inefficiency because the effective computing models and operations reflected the characteristics of bio-molecules have not been developed yet. In this paper, I design new Polymerase Chain Reaction(PCR) operations of DNA computing to solve TSP.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.45-49
• /
• 2004

최적경로문제는 한 지점에서 다른 지점으로 이동할 때, 최소한의 비용으로 이동할 수 있는 경로를 찾는 문제를 의미하며, 최근 인터넷을 이용한 경로 안내 시스템에 적용되어 왔다. 이때, 보통 시간비용을 최소로 하는 경로를 제공하는 것이 일반적이다. 그러나 현실적으로 우리는 타인에게 어떠한 경로를 설명하거나 알려 줄 때, 인지도나 접근성이 높은 경로를 포함하는 경우가 많다. 이에 본 연구에서는 교통경로를 산출할 때 접근성이 높은 경로를 포함하여 경로를 구성하는 방안을 제시하였다 이를 구현하기 위해 건축, 도시공간에서 접근성 분석에 사용되고 있는 Space Syntax라는 방법론을 적용하였다. GIS 데이터 구조를 이용하기 위해 알고리즘을 일부 수정하였으며, 일반적으로 최단거리 산출에 많이 사용되고 있는 Dijkstra 알고리즘과 결합하여 구축하였다. 이렇게 구축된 알고리즘을 소규모의 교통 네트웍상에 적용하여 테스트하였다.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.246-252
• /
• 2017

In this paper, we present an algorithm that computes a minimum-width color spanning axis-parallel rectangular annulus. A rectangular annulus is a closed region between a rectangle and its offset, and it is thus bounded by two rectangles called its outer and inner rectangles. The width of a rectangular annulus is determined by the distance between its outer and inner rectangles. Given n points in the plane each of which has one of the prescribed k colors, we call a rectangular annulus color spanning if it contains at least one point for each of the k colors. Prior to this work, there was no known exact algorithm that computes a minimum-width color-spanning rectangular annulus. Our algorithm is the first to solve this problem and it runs efficiently in $O((n-k)^3nlogn)$ time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.728-734
• /
• 2007

In this paper, we propose a GOSST(Grade Of Services Steiner minimum Tree) heuristic mechanism for the design of a physical multiple security grade network with minimum construction cost. On the network, each node can communicate with other nodes by its desiring security grade. Added to the existing network security methods, the preventing method from illegal physical access is necessary for more safe communication. To construct such network with minimum cost, the GOSST problem is applied. As the GOSST problem is a NP-Hard problem, a heuristic with reasonable complexity is necessary for a practical solution. In this research, to design the physical multiple security grade network with the minimum construction cost, the reformed our previous Distance Direct GOSST heuristic mechanism is proposed. The mechanism brings average 29.5% reduction in network construction cost in comparison with the experimental control G-MST.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.5
• /
• pp.609-617
• /
• 2013

This paper presents a near-minimum time path planning algorithm for autonomous driving. The problem of near-minimum time path planning is an optimization problem in which it is necessary to take into account not only the geometry of the circuit but also the dynamics of the vehicle. The path planning algorithm consists of a candidate path generation and a velocity optimization algorithm. The candidate path generation algorithm calculates the compromises between the shortest path and the path that allows the highest speeds to be achieved. The velocity optimization algorithm calculates the lap time of each candidate considering the vehicle driving performance and tire friction limit. By using the calculated path and velocity of each candidate, we calculate the lap times and search for a near-minimum time path. The proposed algorithm was evaluated via computer simulation using CarSim and Matlab/Simulink.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.6 no.2
• /
• pp.129-139
• /
• 2004

The several assumptions and design parameters to determine the ventilation rate in tunnel ventilation system were examined. In longitudinal ventilating tunnel, the ventilation rate has been determined by the critical velocity above which the smoke propagation to the upstream of ventilating air is prevented. Based upon the examination of assumptions and experimental results, we suggested the improved method to determine the critical velocity. In transverse ventilating tunnel, we found that the ventilation rate has been determined in accordance with the custom rather than fire-smoke dynamics such as the critical velocity in the longitudinal ventilating tunnel. It is because the ventilation rate in the transverse ventilation system has been determined by considering only the ventilation of contaminant by vehicle. To improve the ventilation design parameters based upon the fire-smoke dynamics, we conducted model tunnel fire experiments. From the experimental results, smoke propagating distance and smoke filling were suggested as the design parameter to determine the ventilation rate in transverse ventilating tunnel. And tunnels in Europe designed by the custom is found to have the dangerous nature in view of fire safety.