• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.78-89
• /
• 2017

This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.491-498
• /
• 1997

Geographic Infprmation System(GIS)is being apply to extended from specified ppkication to general purpose deu to the omprovement of computing power.As one part of postal Integarated Information Servies, Postalroute Optimication system(PROS) is comprsed of the composed of the shortest pathe genrator for providing fast and shortest route of postal delivery, the ischronal area generator, the boudary relacation generator, GIS engine, road map, and rdelational database , etc.This paper is related to creation algorithm of the shortest path generation (SPAWD;Shortest Path Algorithm With Direction)from PEOS model.To differ from the exsting shortest path generating methods, this paper suggests SPAWD alforithm for searching destinations of fast time between start and destination points with dirdstion.It comapares and analyzes the new algorithm with existion algorithms, and suggests directions of future studies.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.9-16
• /
• 2007

This paper describe methodology that is distributed on 2-dimensional plane to much high-dimensional facial motion datas using Isomap algorithm, and user interface techniques to control facial expressions by selecting expressions while user navigates this space in real-time. Isomap algorithm is processed of three steps as follow; first define an adjacency expression of each expression data, and second, calculate manifold distance between each expressions and composing expression spaces. These facial spaces are created by calculating of the shortest distance(manifold distance) between two random expressions. We have taken a Floyd algorithm for it. Third, materialize multi-dimensional expression spaces using Multidimensional Scaling, and project two dimensions plane. The smallest adjacency distance to define adjacency expressions uses Pearson Correlation Coefficient. Users can control facial expressions of 3-dimensional avatar by using user interface while they navigates two dimension spaces by real-time.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.142-147
• /
• 2008

In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.265-268
• /
• 2010

본 논문에서는 지하철 정보를 제공하는 모바일 응용 프로그램을 제안하였다. 윈도우 모바일 6.0을 기반으로 한 이 응용프로그램은 지하철 역정보와 관련된 사용자의 편의성을 증대시키기 위하여 설계 및 구현되었다. 이 프로그램에서 지하철 노선도와 부가기능이 성공적으로 실행될 수 있도록 UI 인터페이스, 맵 모듈, 최단거리 모듈, 메모 모듈, 다익스트라 알고리즘 등을 설계하였다. 특히 다익스트라 알고리즘은 프로그램 내의 알람 기능과 역 정보에 적용되었고, 또한 역 정보와 같은 방대한 정보와 데이터를 인접 행렬을 이용하여 구축하였다. 이 응용프로그램은 보다 쉽게 조작하기 위해 6개의 메뉴들로 구성되어있다. 지하철의 종합 관제 센터로부터 신호를 받아 이 프로그램에 적용된다면, 많은 유저들이 보다 정확한 정보를 제공 받을 수 있다고 사료한다.

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

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

• Journal of the Korean Regional Science Association
• /
• v.33 no.1
• /
• pp.29-41
• /
• 2017

This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.195-201
• /
• 2010

Recently, the necessity of the autonomous mobile robot is emphasized in order to enlarge the scope of activity and actively cope with the change of work environment. This paper proposes the algorithm which enables the mobile robot to avoid obstacles and lead it to the destination by the shortest path. And we verify the usability by a simulation. We made the algorithm with micro-GA and $\lambda$-geometry MRA. The area of simulation is limited to 320(width)$\times$200(length) pixels and one pixel is one centimeter. When we planned the path with only $\lambda$-geometry MRA, we could find the direction for path planning but could not find the shortest path. But when we planned the path with $\lambda$-geometry MRA and micro-GA, we could find the shortest path. So the algorithm enables us to find the direction for path planning and the shortest path.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.219-221
• /
• 2022

In recent summer, as it is concentrated, even in mountainous areas, flooding and flooding cause casualties in pedestrian evacuation situations. To compensate for this, a system that detects the occurrence of flooding and allows pedestrians to evacuate safely is required. Therefore, in this paper, we propose a research on pedestrian path search based on the shortest distance algorithm using Map API. The pedestrian route search system outputs a map using the T Map API, selects nearby buildings as shelters, and stores data. A shelter close to the pedestrian's current location is selected, and the shortest route is output and the distance and time are provided. If there is a problem with the current route during evacuation, another shelter route is provided from the current location. Therefore, it is thought that the pedestrian route search evacuation system proposed in this paper will prevent accidents during evacuation.