• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1433-1448
• /
• 2013

This study presents empirical evidence of the benefit of viewing narrative video clips on embedded virtual reality (VR) websites of hotels to relieve travel anxiety. As the effectiveness of using VR functions to relieve travel anxiety has been shown, we proposed that a VR website enhanced with narrative video clips could relieve travelers' anxiety about accommodations by showing the important aspects of a hotel. Thus, we created a website with a narrative video showing the escape route from a hotel room and another narrative video showing the surrounding neighborhood. We then conducted experiments by having human subjects explore the enhanced VR website and fill out a questionnaire. The results confirmed our hypothesis that there is a statistically significant relationship between relief from travel anxiety and the use of narrative videos on embedded VR websites of hotels.

• Journal of the Korean Society of Industry Convergence
• /
• v.5 no.3
• /
• pp.239-246
• /
• 2002

The propose of this study is to analysis driver's behavior of traveler information. This research made an attempt to explore driver's route change behavior in the en-route stage. Model were developed for each analysis with LIMDEP software which was developed by Willams H Greene. Commuters' transportation change in before trip stage are affected by their income, travel time, and incident information and constant of this model showed their reluctance of change mode. This was resulted from the inappropriateness of traffic information to general commuters which is the main target of traffic information.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.241-249
• /
• 2001

The objective of this paper is to develop the optimal path algorithm for dynamic route guidance system in advanced traveler information system (ATIS). The travel time is forecasted in each path between network nodes. Floyd-Warshall algorithm is used to find the optimal route based on this forecasted travel time in dynamic traffic network. This algorithm is modified to apply the real traffic network that has left-turn restriction, U-turn, and P-turn. A big value is assigned to one of arcs in turn restriction and a virtual node is used to consider U-turn and P-turn for Floyd-Warshall algorithm.

• Journal of Korean Society of Transportation
• /
• v.27 no.3
• /
• pp.49-58
• /
• 2009

Four alternative plans for the bus network in Daejeon metropolitan city, which have different hierarchical structure, were proposed : Alternative 1 represents a bus network without hierarchical structure, and Alternative 2, 3, and 4 represent bus networks with primary, intermediate, and advanced hierarchical structures, respectively. Efficiency of the alternative plans were evaluated based on the evaluation index including travel time cost, waiting time cost, and transition penalty cost. The travel time cost was decreased as the level of hierarchical structure gets higher until it reaches the extremely high level. As the level of hierarchical structure get higher, the waiting time cost significantly decreased while the transition penalty cost increased. Collectively, a bus network with hierarchical structure was shown to be more efficient than without it in the light of total travel cost. For the bus network with hierarchical structure, total travel cost shows a concave curve, which implies that there exists an optimal level of hierarchical structure in a bus network.

• Journal of Korean Society of Transportation
• /
• v.29 no.6
• /
• pp.7-16
• /
• 2011

This study investigates the degree of dependency on freeways when auto travelers make route choices in the Seoul Metropolitan Area. The investigation is conducted based on aggregated auto trip data, defining the degree of dependency as the proportion of auto trips selecting freeways in their travel paths. The analyses reveal that the trips departing from the areas with higher accessibility to freeways tend to exhibit higher dependency on freeways. In addition, the dependency is significantly affected by the travel time differences between two paths including and excluding freeways, respectively. The number of service interchanges was found to be one of significant factors for trips to Incheon and Gyenggi areas. The finding indicates that the factors affecting the degree of dependency on freeways may vary depending on the areas' characteristics. The findings would enhance the understanding of drivers' route choice behavior in Seoul at an aggregate level.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.2
• /
• pp.65-71
• /
• 2018

In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.38-46
• /
• 1999

One of the tasks of maritime navigation is to decide upon the optimal navigation route that minimizes a vessals travel time and fuel consumption. Recently. ECDIS(Electronic Chart Display Information System) is used to decide the optimal navigation route and have expert knowledge of maritime navigation. In this paper, the system use $A^*$algorithm for optimal navigation route on ECDIS. But some problems is discovered in this situation. it requires many memory device and searching time. So this paper has tried to develope a advanced algorithm system that decides the optimal navigation route.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1091-1098
• /
• 2010

Victory and defeat of the war depends on follow-on logistics support. The spending time of follow-on logistics support at combat area is greatly influenced by the degree of combat intensity. The main purpose of this study is to compose a optimal supply route for operational sustainability of combat unit at combat area using transport vehicles. This study suggests a composition of optimal supply route for follow-on logistics support which considers the degree of combat intensity. A mathematical programming model and a genetic algorithm suggest to minimize the total spending time of follow-on logistics support. The suggested mathematical programming model is verified by using CPLEX 11.1. This study computes supply route, total spending time, total travel distance, and the number of transport vehicle.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.42-53
• /
• 2000

The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.