• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.123-132
• /
• 2017

The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

• Journal of Aerospace System Engineering
• /
• v.13 no.3
• /
• pp.15-22
• /
• 2019

In this paper, a global and local flight path system for autonomous flight of the UAV is proposed. The overall system is based on the ROS robot operating system. The UAV in-built computer detects obstacles through 2-D Lidar and generates real-time local path and global path based on VFH and Modified $RRT^*$-Smart, respectively. Additionally, a movement command is issued based on the generated path on the UAV flight controller. The ground station computer receives the obstacle information and generates a 2-D SLAM map, transmits the destination point to the embedded computer, and manages the state of the UAV. The autonomous UAV flight system of the is verified through a simulator and actual flight.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.65-69
• /
• 1998

차량주행안내 시스템에서 경로 안내 기능은 사용자에게 출발지와 목적지간의 최단의 경로를 찾아 주는 역할을 수행한다. 그런데 최단경로를 찾는 문제도 중요하지만, 다음과 같이 최단 경로 이외에 대체경로가 필요한 경우가 자주 발생한다. 첫째, 목적지나 출발지가 유사한 차량에 대해서 복수개의 경로를 제시함으로써, 교통량을 분산시킬수 있어, 전체 도로망의 효율을 높일 수 있다. 둘째, 운전자의 선호도가 각기 다르기 때문에 이를 만족시키기 위해서는 복수개의 경로 제시가 필요하다. 본 연구에서는 대체경로의 적합성을 평가할수 있는 지표와 유전 알고리즘 기반의 효율적인 대체경로를 탐색 기법을 제시한다.

• Cement
• /
• s.202
• /
• pp.9-14
• /
• 2014

남북통일은 국가 경제활동의 기반을 질적으로 변화시킴으로써 새로운 성장의 기회를 창출할 것으로 보인다. 특히 국내 경제는 인프라 확충, 산업생산 기반 정비, 생산재 수요 증가, 소비재 및 서비스 수요 증가로 이어지며 다양한 산업에 새로운 성장의 계기를 제공할 것으로 기대된다. 여기서는 현대경제연구원의 '통일 한국의 12대 유망 산업' 보고서를 통해 통일 이후 경제활동 기반의 변화, 산업발전 경로, 성장이 기대되는 주요 산업 등에 대해 살펴본다.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.451-457
• /
• 2012

Recently, as the use of real time traffic information of a car navigation system increases rapidly with the development of Intelligent Transportation Systems (ITS), path search is getting more important. Previous algorithms, however, are mostly for the shortest distance searching and provide route information using static distance and time information. Thus they could not provide the most optimal route at the moment which changes dynamically according to traffic. Accordingly, in this study, Semantic Shortest Path algorithm with Reduction ratio & Distance(SSP_RD) is proposed to solve this problem. Additionally, a routing model based on velocity reduction ratio and distance and a dynamic route link map are proposed.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.73-82
• /
• 2009

Location-based concierge services (LBCS) are considered to be one of the main service functions provided in a city in ubiquitous technology spaces. A "Ubiquitous City" is defined as a city in which both public and private services can be delivered and received anywhere and anytime. One of the key elements that make location-based concierge services successful is the interoperability of location data. Currently, several existing technologies could provide LBCS including car navigation services and ubiquitous computing. However, lack of standardized structure for location data makes it impossible for heterogeneous technologies to be able to deliver uniform LBCS. The purpose of this paper is to develop standardized locational data structure so that heterogeneous technologies could provide efficient LBCS to all users of the various transportation modes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.241-244
• /
• 2009

Recently car navigation systems which are widely spreaded and provide routes exactly have been evolved. The systems use various information and techniques as follows. In order to provide shortest path with good flow, realtime traffic information provided by DMB is used. Augmented reality technique is also introduced to give the sense of real to driver by displaying real images captured by camera during driving. But these operate well when the GPS receives data normally. Exact information about the position of vehicles becomes a base that supports the above function with realities. This paper proposes a method for compensating a given path. It uses various information by integrated vehicle networks when the GPS does not operates normally.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.302-304
• /
• 2012

스마트폰 사용자가 증가 할수록 사용자들을 위한 다양한 어플리케이션들이 개발 되어 지고 있다. 본 논문에서는 안드로이드 플랫폼에서 실행 가능한 발전된 위치기반 응용 프로그램인 ALS를 제안하고 개발하였으며 기존 유사 서비스와 성능을 비교하였다. ALS는 기본적으로 경로 등록, 경로 검색 등 2가지 기능을 사용자들에게 제공하며 이들은 웹 및 데이터베이스 서버, 그리고 사용자의 이동 단말기에 의해 동적으로 관리된다. 사용자들은 스마트폰을 이용하여 위치 정보를 검색 및 업데이트 할 때, 서버들은 필요한 정보를 제공하여 사용자들이 자유롭게 자신들이 등록한 정보를 추가, 수정, 그리고 제거를 할 수 있도록 한다. 이는 기존의 다른 지도 서비스들이 사용자들로부터 직접적으로 정보 입력을 허용하지 않는 것과 달리 사용자들에게 정보입력을 담당하게 한다는 점에서 구별된다. 또한 본 논문에서는 위치 기반 경로서비스 시스템 구현 과정과 함께 각 동작에 대한 실험결과를 보여주며, 마지막으로 기존 서비스들과의 성능 평가를 통해 더 나은 성능을 제공할 수 있음을 설명한다.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.835-838
• /
• 2008

Many researches on hierarchical path search have been studied so far. Even though partitioning regions is essential part, the researches are not enough. This paper proposes two efficient methods to partition regions: 1)a method based on voronoi algorithm in which a major node is central point of a region, 2) a method based on fired grid that partitions regions into major and minor. The performances of the proposed methods are compared with the conventional hierarchical path search method in which a region is formed by the boundary line of nearest 4 points of a major node in terms of the path search time and the accuracy. The results obtained from the experiments show that the method based on voronoi achieves short execution time and the method based grid achieves high accuracy.