• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.85-96
• /
• 2004

Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.634-639
• /
• 2002

A Shortest Path Algorithm is the method to find the most efficient route among many routes from a start node to an end node. It is based on Labeling methods. In Labeling methods, there are Label-Setting method and Label-Correcting method. Label-Setting method is known as the fastest one among One-to-One shortest path algorithms. But Benjamin[1,2] shows Label-Correcting method is faster than Label-Setting method by the experiments using large road data. Since Graph Growth algorithm which is based on Label-Correcting method is made to find One-to-All shortest path, it is not suitable to find One-to-One shortest path. In this paper, we propose a new One-to-One shortest path algorithm. We show that our algorithm is faster than Graph Growth algorithm by extensive experiments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.201-210
• /
• 2019

This paper proposes the AMCS(Agricultural Machine Control System that distinguishes farms using satellite photos or drone photos of farms and controls the self-driving and operation of farm drones and tractors. The AMCS consists of the LSM(Local Server Module) which separates farm boundaries from sensor data and video image of drones and tractors, reads remote control commands from the main server, and then delivers remote control commands within the management area through the link with drones and tractor sprinklers and the PSM that sets a path for drones and tractors to move from the farm to the farm and to handle work at low cost and high efficiency inside the farm. As a result of AMCS performance analysis proposed in this paper, the PSM showed a performance improvement of about 100% over Dijkstra algorithm when setting the path from external starting point to the farm and a higher working efficiency about 13% than the existing path when setting the path inside the farm. Therefore, the PSM can control tractors and drones more efficiently than conventional methods.

• Journal of Korea Multimedia Society
• /
• v.24 no.11
• /
• pp.1538-1551
• /
• 2021

The current drone flight plan creation creates a flight path point of two-dimensional coordinates on the map and sets an arbitrary altitude value considering the altitude of the terrain and the possible flight altitude. If the created flight path is a simple terrain such as a mountain or field, or if the user is familiar with the terrain, setting the flight altitude will not be difficult. However, for drone flight in a city where buildings are dense, a safer and more precise flight path generation method is needed. In this study, using high-precision spatial information, we construct a drone safety flight map with a 3D grid map structure and propose a flight path search algorithm based on it. The safety of the flight path is checked through the virtual drone flight simulation extracted by searching for the flight path based on the 3D grid map created by setting weights on the properties of obstacles and terrain such as buildings.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.20-33
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.107-110
• /
• 2008

In this study, we propose a system for setting a Destination on CNS(Car Navigation System) or PNS(Personal Navigation System). The present Navigation does set the destination by only static method like name search, address search and wire telegraph telephone number search. But, the kind of setting a static destination does not reflect the dynamic moving situation. So we suggest setting the destination of navigation using Identifier of moving terminal. And it includes privacy protection on personal position information

• Journal of Information Technology Services
• /
• v.11 no.1
• /
• pp.59-81
• /
• 2012

Recently, in the research on online environment such as e-commerce, and internet banking, the conceptual discussion about trust and risk in an effort to explain a user's behavior is briskly underway. Most of the research on trust and risk are setting up causal relationship without clearly establishing the relationship between trust and risk. Accordingly this study conducted a meta-analysis in order to consider the relationship between trust and risk and to take a look at the difference in causal relationship. This study includes a total of 18 research papers which are setting up the causal relationship between trust and risk in online environment among the research papers published in domestic academic journals since 2000. Result of the meta-analysis, showed that the effect size was -0.367 in the path from trust to risk; -0.131 in the path from risk to trust; -0.276 in the bidirectional path between trust and risk. In addition, this study was able to confirm through literature review that there appeared a high effect of path in case where trust and risk were measured by an uni-dimensional concept than by a multi-dimensional concept.

• Journal of Digital Convergence
• /
• v.8 no.4
• /
• pp.151-164
• /
• 2010

This study utilized SPSS and AMOS program to research a process of learning satisfaction of learners, who used Ubiquitous Living English Experience Learning Center. The following results were found ; First, there was a positive correlation between learning setting and learning interest, between learning setting and learning satisfaction, between confidence and learning interest, between confidence and learning satisfaction, and between learning interest and learning satisfaction. Second, the process of the research model was meaningful in various ways: learning setting ${\rightarrow}$ confidence, learning setting ${\rightarrow}$ learning interest, learning setting ${\rightarrow}$ learning satisfaction, confidence ${\rightarrow}$ learning satisfaction, learning interest ${\rightarrow}$ learning satisfaction. Finally, learning setting had a direct influence upon learning interest and learning satisfaction.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.544-547
• /
• 2008

Navigation in 3D virtual environment(VE) is very difficult because the virtual environment is lack information than real 3D world. So navigation is import research subject in 3D VE. In this paper, we study tour path setting method using spline curve. The spline curve is augmented polynomial function. So the curve is differentiable. In particular, since the curves which are order of 2 and 3 are second order differentiable those are sufficiently smooth for using the computer graphics and CAD system.

• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.