• Journal of Navigation and Port Research
• /
• v.47 no.6
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.45-59
• /
• 1996

The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

• Journal of the Korean Society for Railway
• /
• v.14 no.3
• /
• pp.276-284
• /
• 2011

In our study, we present a new LOGIT-based traffic assignment model applicable to intercity railway network. Most traffic assignment models have been developed for public transit assignment in urban area, so that they are known to produce unrealistic results in intercity railway demand analysis. Especially, since the introduction of KTX, more passengers are using a route including KTX service and the schedule becomes more compatible with transfer. Our study presents a new LOGIT-based traffic assignment model considering passenger transfer. To do so, we suggest a new route search algorithm to find K paths with non increasing order in the utility value.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.87-110
• /
• 2006

In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.2
• /
• pp.99-106
• /
• 2014

Weather routing of a ship provides an optimal route to the destination by using minimal time or fuel in a given sea condition. These days, weather routing came into a spotlight with soaring fuel price and the environmental regulations of IMO and several countries. This study presents three scenarios of voyaging strategies for a ship and compared them in terms of the fuel consumption. The first strategy fixes the speed of a ship as a constant value for entire sailing course, the second fixes the RPM of the ship as constant for entire course, and the third determines the RPMs of the ship for each segment of the course. For each strategy, a ship route is optimized by using the $A^*$ search method. Wind, ocean current and wave are considered as ocean environment factors when seeking the optimal routes. Based on 7000 TEU container ship's sea trial records, simulation has been conducted for three scenarios, and the most efficient routing scenario is determined in the view of fuel consumption.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.831-839
• /
• 2009

An interlocking equipment of railway signalling systems is manufactured with electrical devices and electrical interlocking equipment has been substituted for existing interlock equipment(relay sequential logic type). But interlock conditions are still generated from rail diagram and used to make Interlock Table manually. In order to make EIS(Electrical Interlock System) operate, we should write interlock data which is made from interlock table. But, as the station is larger and more complicated, handwork may becomes a very tediou work and makes more mistakes. Therefore the development of CAD system for Interlocking System is very significant, if CAD can reduce the mistakes from handwork and help the configuring the interlocking system. In this paper, we first arrange some rules which can be used to extract route information automatically from rail diagram and interlocking rules. And then we propose "Search-And-Rollback" algorithm to extract route information and individual interlocking rules. The proposed algorithm is implemented and tested through the signal design process of the Hyundai-Steel private railway to carry melted pig iron from the blast furnace to the steel-making workshop. some cases. It shows that CAD for Interlocking system is very helpful in time saving aspect and system reliability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.258-259
• /
• 2021

Forest lodge are divided into forest resources, auxiliary facilities, and users, and are constantly being used along with well-being culture. In addition, attention to the safety of users is also required, and this study aims to study how users evacuate within a short time (golden time) in situations of natural disasters that may occur in forests. In order to search for the current location of the user and find the best evacuation route, 3D scans of the entire forest lodge(forest resources, auxiliary facilities, etc.) are performed, and the optimal trajectory to the evacuation site is found through recognition of the current location. It is believed that it is possible to provide a quick evacuation guide through a mobile device with gps.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.3
• /
• pp.1-12
• /
• 2022

In the event of a maritime distress accident, rapid search and rescue operations using rescue assets are very important to ensure the safety and life of drowning person's at sea. In this paper, we analyzed the surface layer current in the northwest sea area of Ulleungdo by applying machine learning such as multiple linear regression, decision tree, support vector machine, vector autoregression, and LSTM to the meteorological information collected from the maritime observation buoy. And we predicted the drowning person's route at sea based on the predicted current direction and speed information by constructing each prediction model. Comparing the various machine learning models applied in this paper through the performance evaluation measures of MAE and RMSE, the LSTM model is the best. In addition, LSTM model showed superior performance compared to the other models in the view of the difference distance between the actual and predicted movement point of drowning person.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.1-6
• /
• 2023

The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

• Korean Journal of Acupuncture
• /
• v.39 no.4
• /
• pp.172-183
• /
• 2022

Objectives : An error was found in the recent standard by the World Health Organization (WHO) on the locations of the Upper arm Route of Lung Meridian (URLM) and its acupoints LU3 and LU4. This possible incorrect information is being taught throughout Korean medicine colleges nationwide, which follow WHO standards. Therefore, an investigation is required to sort out this discrepancy based on the evidence in historical documents. Methods : The location of WHO's URLM and LU3 and LU4 were compared with corresponding information in the classical literature. The anatomical structure mentioned in these classical documents was examined. Finally, an assessment was conducted on whether this structure is reflected in the WHO standards. Results : Classical literature prior to the early 20th century records the locations of the Lung Meridian and LU3 and LU4 of the upper arm to be in the artery on the medial aspect. This artery corresponds to the brachial artery. The location established by the WHO is on the anterolateral side of the upper arm, where no large arteries exist that can be found by haptic search or angiographically. The anterolateral side of the upper arm belongs to the Yang aspect, which does not coincide with the Yin aspect of Lung Meridian. Conclusions : The WHO's URLM and LU3-4 standards do not agree with the classical literature. The correct route must coincide with the brachial artery passing through the medial side of the humerus. The actual location of LU3-4 is on the medial aspect of the arm, just medial to the border of the biceps brachii muscle, on the brachial artery, 3-4 B-cun inferior to the anterior axillary fold.