• The Journal of the Korea Contents Association
• /
• v.21 no.1
• /
• pp.541-551
• /
• 2021

Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.

• Journal of The Korean Association of Information Education
• /
• v.20 no.3
• /
• pp.243-254
• /
• 2016

This study has produced a checker of the shortest path search problem with a total of 19 questions as a web-based computer evaluation based on the 'TRAFFIC' questions of PISA 2012. It is because the computer has been settled as an indispensable and significant instrument in the process of solving the problems of everyday life and as a media that is underlying in assessment. Therefore, information gifted students should be able to solve the problem using the computer and give clear enough commands to the computer so that it can perform the procedure. In addition, since it is the age that the computational thinking is affecting every sectors, it should give students new educational stimuli. The relationship between the rate of correct answers and the time took to solve the problem through the shortest route search process showed a significant correlation the variable that affected the problem solving as the difficulty of the question rises due to the increase of nodes and edges turned out to be the node than the edge. It was revealed that information gifted students went through algorithmic thinking in the process of solving the shortest route search problem. And It could be confirmed cognitive characteristics of the information gifted students such as 'ability streamlining' and 'information structure memory'.

• Journal of the Economic Geographical Society of Korea
• /
• v.11 no.3
• /
• pp.459-475
• /
• 2008

This study analyzes the network structure of the Metropolitan Seoul subway system by applying complex network analysis methods. For the purpose, we construct the Metropolitan Seoul subway system as a network graph, and then calculate various indices introduced in complex network analysis. Structural characteristics of Metropolitan Seoul subway network are discussed by these indices. In particular, this study determines the shortest paths between nodes based on the weighted distance (physical and time distance) as well as topological network distance, since urban travel movements are more sensitive for them. We introduce an accessibility measurement based on the shortest distance both in terms of physical distance and network distance, and then compare the spatial structure between two. Accessibility levels of the system have been getting up overall, and thus the accessibility gaps have been getting lessen between center located subway stops and remote ones during the last 10 years. Passenger traffic volumes are explored from real passenger transaction databases by utilizing data mining techniques, and mapped by GIS. Clear differences reveal between the spatial patterns of real passenger flows and accessibility. That is, passenger flows of the Metropolitan Seoul subway system are related with population distribution and land use around subway stops as well as the accessibility supported by the subway network.

• Journal of Aerospace System Engineering
• /
• v.14 no.5
• /
• pp.9-17
• /
• 2020

Mobile robots, including UAVs perform missions with limited fuel. Therefore, the energy-aware path planning is required to maximize efficiency when the robot is operated for a long time. In this study, we estimated the power consumption for each maneuver of a quadcopter UAV in the 3D environment and applied to the cost functions of D^⁎ Lite. The simulations were performed in a 3D environment that is similar to the industrial sites. The efficiency of path generation was high when the energy-aware path planning with simplified heuristic was applied. In addition, the energy-aware path was generated 19.3 times faster than the shortest path with a difference within 3.2%.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.234-235
• /
• 2012

본 논문에서는 개미 집단 최적화(Ant Colony Optimization, ACO) 알고리즘을 적용한 감속률에 따른 동적 상황인식 경로 선정 방법을 제안한다. 최근 ITS(Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 실시간 교통 정보를 이용하는 수요가 급증하면서, 경로탐색의 중요성이 더욱 가속화되고 있다. 현재 차량용 내비게이션은 멀티미디어 및 정보통신 기술의 결합과 함께 다양한 기능 및 정보를 사용자에게 제공하고 있으며, 이러한 경로탐색 알고리즘은 교통시스템, 통신 네트워크, 운송 시스템 등 다양한 분야에 적용되고 있다. 본 논문에서는 감속률에 따른 동적 상황인식 경로 선정 방법을 제안함으로써, 최단 시간 및 최소 비용의 정보를 제공해 줄 뿐만 아니라 교통정체로 인한 사회적 비용 감소의 효과를 가져다 줄 것으로 기대한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.821-824
• /
• 2014

선박경제운항이란 예보된 기상정보를 활용하여 연료소모량을 최소화하도록 선박을 운항하는 것으로서 최근 다양한 방법론이 연구되고 있다. 성공적인 경제운항시스템을 구현하기 위해서는 기상을 고려하여 지리적 운항경로를 바꾸거나 적절하게 엔진 출력을 조절하는 방법이 필요하다. 그러나 항해 시각에 따라 연료소모량이 변하는 동적 비용 문제임을 고려할 때 지리적 운항 경로의 결정은 최적의 해를 찾기가 어렵다. 이에 이 논문에서는 매우 많은 지리적 후보 경로들 중에서 우수한 품질의 해를 효과적으로 탐색하기 위한 진화전략 기반 경로탐색 알고리즘을 제안하였다. 제안된 방법을 5개 노선에 대해 실험한 결과 최단거리 운항 방법에 비해 운항소요시간은 거의 차이가 없으면서도 연료소모량을 평균 1.41%, 최대 1.45% 개선시킬 수 있었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.740-745
• /
• 2016

Cables are installed for tens of thousands of connections between various pieces of equipment to operate and control a commercial ship. The correct shortest-route data is necessary since these are complicated cable installations. Therefore, an overfill interval commonly exists in the shortest paths for cables as estimated by Dijkstra's algorithm, even if this algorithm is generally used. It is difficult for an electrical engineer to find the overfill interval in 3D cable models because the occupancy rate data exist in a data sheet unlinked to three-dimensional (3D) computer-aided design (CAD). The purpose of this study is to suggest a visualization method that displays the cable path and overfill interval in 3D CAD. This method also provides various color visualizations for different overfill ranges to easily determine the overfill interval. This method can reduce cable-installation man-hours from 7,000 to 5,600 thanks to a decreased re-installation rate, because the cable length calculation's accuracy is raised through fast and accurate reviews based on 3D cable visualization. As a result, material costs can also be reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.553-555
• /
• 2005

이중 공유기반 트리 방식인 CBT 방식은 송신자와 수신자 모두 센터 노드(Core)에 이르는 최단경로를 통해 데이터를 주고받는 방식이다. 이 방식은 Core를 이용하여 멀티캐스트의 한계인 확장성문제를 해결하기 위해서 사용된 방식이다. 그러나 현재 멀티미디어 라우팅방식은 Best-Effort 방식의 패킷 스위칭은 가능한 한 패킷을 전송하려 하기 때문에 Core와 RP를 중심으로 데이터의 폭주 현상을 유발한다. 우리는 이와 같은 문제를 해결하기 위해서 RED 알고리즘을 이용한 Anycast 방식을 제안한다. Anycast 프로토콜은 Anycast 주소를 가진 수신자 그룹 멤버들 중, 가장 근접한 라우터나 지역의 Anycast 그룹 멤버들에게 패킷을 재분배할 수 있는 최적의 서버 또는 호스트에게 패킷을 전달하는 방식이다. 이와 같이 Anycast는 Core의 패킷을 재분배하여 근접한 라우터로 재분배 하여 최적의 호스트에게 전달할 수 있다. Core의 패킷을 재분배하기 위해서는 RED 알고리즘을 도입하여 Core으 트래픽 증가를 분산시킨다.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.127-135
• /
• 2015

In this paper, we propose and implement an application that recommends safe paths for outdoor leisure activity of women based on Space Syntax theory. Compared to general navigation systems which focuses on the shortest time or the shortest distance, the proposed application makes safe paths the first priority. It generates path recommendation with regard to accessibility of travel time and correlation of regions and considers various risk factors for searching for the safest path. Concludingly, the employed Space Syntax algorithm enables the women users to select their own customized paths.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.440-445
• /
• 2013

This paper proposes a local estimation system which combines Cell Divide Algorithm with low-cost GPS/INS fused by Extended Kalman Filter(EKF) for localization of Quad-rotor when it returns to the departure point. In the research, the low-cost GPS and INS are fused by EKF to reduce the local error of low-cost GPS and the accumulative error of INS due to continuous integration of sensor error values. When the Quad-rotor returns to the departure point in the fastest path, a moving path can be known because it moves straight, where Cell Divide Algorithm is used to divide moving route into the cells. Then it determines the closest position of data of GPS/INS system fused by EKF to obtain the improved local data. The proposed system was verified through comparing experimental localization results obtained by using GPS, GPS/INS and GPS/INS with Cell Divide Algorithm respectively.