• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.252-259
• /
• 1998

Vehicle navigation systems employ a certain route planning algorithm that provides the shortest path between the starting point and the destination point. The performance of a given route planning algorithm is measured through the degree of optimal route selection and the time cost to complete searching an optimal path. In this paper, various route planning algorithms are evaluated through computer simulation based on a real digital map database. Among those algorithms evaluated in this paper, the Modified Bi-directional A${\ast}$ algorithm is found to be the best algorithm for use in vehicle navigation systems.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.1
• /
• pp.1-8
• /
• 2007

People tend to spend more time in indoor spaces than before such as shopping malls and subway stations. As buildings become larger and more complex, people feel difficulty in finding their ways to destinations. Consequently, a means to provide better paths can aid people in reducing time for finding ways. Routing information in large indoor spaces is especially required in emergency cases as fire, power failure and terror. This study suggests to compute optimal paths using $A^*$ algorithm based on raster GIS data structure. The suggested method can be used either in daily lives for path provision or in emergency cases for evacuation, and is illustrated on a campus building.

• 한국ITS학회:학술대회논문집
• /
• 2004.11a
• /
• pp.154-162
• /
• 2004

• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.55-62
• /
• 2005

In this paper, we propose the new technique to compute the optimal route by considering the direction of distribution vehicles and the location for delivery, developing the algorithm of the shortest route to approach the location as applying the gemetic algorithm. This approach makes it possible for us to find the best route even under itineraries which include many destinations. Lively studies are currently in progress on the development of vehicle navigation software, combining PDA GPS, and electronic maps. Many web-sites are providing a varier of services which use electronic maps. Popular among these services is one that computes the optimal route between two positions that a user inputs. This service of computing the optimal route plays an important role in distribution industries such as home-delivery. For the distribution system. the construction of a vehicle regulation system enables us to calculate and manipulate the optimal route for distribution vehicles, to enhance the efficiency in making use of vehicles and labor, and to reduce costs.

• 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.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.941-947
• /
• 2018

Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.607-608
• /
• 2016

진화 알고리즘과 인공신경망은 생물학에서 비롯되어 컴퓨터과학 분야에서 응용되고 있는 문제해결 방법이다. 본 연구는 게임 환경에서 크기를 자율적으로 설정하여 생성할 수 있는 미로를 구성하고, 주어진 미로의 시작점으로부터 목적지까지 유전 알고리즘과 인공신경망을 이용하여 경로탐색을 하는 것에 대한 연구이다. 자동 생성된 미로가 특정 크기 이상으로 커지게 되면, 진화 알고리즘은 무작위적인 값에 의해서 결정되는 것으로 수렴한다는 결론을 얻었고, 인공신경망을 이용한 결과는 진화알고리즘 보다 미로의 경로탐색 문제해결에 적합한 결과를 보여주었다. 또한 어떤 방향이 최적경로인지 아닌지를 미리 알 수 있는 특수한 조건에서는 각 유전인자를 최적값인지 아닌지 표현하는 방법으로 효율적인 진화 알고리즘을 사용할 수 있다는 것을 제안하였다.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.23 no.5
• /
• pp.574-584
• /
• 2017

In this paper, the optimizing path finding control method is studied for a Legged-robot. It's named TITAN-VIII. It has a lot of advantages over the wheeled robot in the ability to walk freely on an irregular ground. However, the moving speed on the ground of the Legged-robot is slower than the Wheeled-robot's. Consequently, the purpose of the method is presented in this paper to minimize its time when it walks to a goal. It find the path, our approach is based on an algorithm which is called Dijkstra's algorithm. In the rest of paper, the various posture of the robot is discussed to keep the robot always in the statically stable. Based on above works, the math formulas are presented to determine the joint angles of the robot. After that an algorithm is designed to find and keep robot on the desired trajectory. Experimental results of the proposed method are demonstrated in the last of paper.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.309-310
• /
• 2007

본 논문은 AGV를 사용하는 물류자동화 공장에서 운송 시간을 단축하기 위해 최단 다 경로 알고리즘을 제안한다. 최단 다 경로 알고리즘은 A* 알고리즘을 보완한 것으로써 경로 분기점에서 최단 거리 선택을 위한 휴리스틱 함수($\hat{h}$(n))보다 작은 모든 간을 선택하여 저장하고 이를 재 탐색함으로써 다수의 경로를 생성한다. 생성된 경로를 본 논문에서 제안하는 소요시간 산출 방법을 이용하여 예상 소요 시간을 산출함으로써 최단시간에 목적지에 도달 가능한 최적 경로를 선택할 수 있음을 증명한다.