• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.3
• /
• pp.1-14
• /
• 2008

Mass transit information should contribute many benefits to users. Especially transportation information technology is developing highly with information technology in Korea recently. Hereafter it is expected to provide customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithms in public transportation networks including travel and transfer attributes. In this research, multi objectives such as travel time, transfer time, and number of transfer and so on are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding alternatives arbitrarily is proposed by selecting the best alternative which provides maximum utility to users among non dominated paths. Therefore, the ultimate goal of this study proposes a multi objective shortest paths finding algorithm which can take into account multiple user classes in a transit network with multiple travel modes. The proposed algorithm is demonstrated based on the two case studies - a small toy network and the large-scaled Seoul Metropolitan subway network.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.84-86
• /
• 2001

A new navigation method is developed and implemented for mobile robot. The mobile robot navigation problem has traditionally been decomposed into the path planning and path following. Unlike tracking-based system, which minimize intercept time and moved mobile robot distance for optimal rendezvous point selection. To research of random moving object uses algorithm of Adaptive Control using Auto-regressive Model. A fine motion tracking object's trajectory is predicted of Auto-regressive Algorithm. Thus, the mobile robot can travel faster than the target wi thin the robot's workspace. The can select optimal rendezvous point of various intercept time.

• Journal of Biosystems Engineering
• /
• v.38 no.1
• /
• pp.1-8
• /
• 2013

Purpose: Path planning and tracking algorithms applicable to various agricultural operations, such as tillage, planting, and spraying, are needed to generate steering angles for auto-guidance tractors to track a point ahead on the path. An optimal coverage path algorithm can enable a vehicle to effectively travel across a field by following a sequence of parallel paths with fixed spacing. This study proposes a path generation and tracking algorithm for an auto-guided Korean tractor with a tillage implement that generates a path with C-type turns and follows the generated path in a paddy field. A mathematical model was developed to generate a waypoint path for a tractor in a field. This waypoint path generation model was based on minimum tractor turning radius, waypoint intervals and LBOs (Limit of Boundary Offsets). At each location, the steering angle was calculated by comparing the waypoint angle and heading angle of the tractor. A path following program was developed with Labview-CVI to automatically read the waypoints and generate steering angles for the tractor to proceed to the next waypoint. A feasibility test of the developed program for real-time path tracking was performed with a mobile platform traveling on flat ground. The test results showed that the developed algorithm generated the desired path and steering angles with acceptable accuracy.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.8
• /
• pp.46-59
• /
• 1998

This paper presents shape design, surface construction, and cutting path generation for the surface of marine ship propeller blades. A propeller blade should be designed to satisfy performance constraints that include operational speed which impacts rotations per minutes, stresses related to deliverable horst power, and the major length of the marine ship which impacts the blade size and shape characteristics. Primary decision variables that affect efficiency in the design of a marine ship propeller blade are the blade diameter and the expanded area ratio. The blade design resulting from these performance constraints typically consists of sculptured surfaces requiring four or five axis contoured machining. In this approach a standard blade geometry description consisting of blade sections with offset nominal points recorded in an offset table is used. From this table the composite Bezier surface geometry of the blade is created. The control vertices of the Hazier surface patches are determined using a chord length fitting procedure from tile offset table data. Cutter contact points and path intervals are calculated to minimize travel distance and production time while maintaining a cusp height within tolerance limits. Long path intervals typically generate short tool paths at the expense of increased however cusp height. Likewise, a minimal tool path results in a shorter production time. Cutting errors including gouging and under-cut, which are common errors in machining sculptured surfaces, are also identified for both convex and concave surfaces. Propeller blade geometry is conducive to gouging. The result is a minimal error free cutting path for machining propeller blades for marine ships.

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

• Ocean and Polar Research
• /
• v.36 no.3
• /
• pp.225-234
• /
• 2014

The 2011 Tohoku earthquake triggered extremely destructive tsunami waves which propagated over the Pacific Ocean, Atlantic Ocean through Drake Passage and Indian Ocean respectively. A total of 10 tide-gauge records collected from the UNESCO/IOC site were analyzed through a band-pass digital filtering device to examine the observed tsunami characteristics. The ray tracing method and finite-difference model with GEBCO 30 arc second bathymetry were also applied to compare the travel times of the Tohoku-originated tsunami, particularly at Rodrigues in the Indian Ocean and King Edward Point in the Atlantic Ocean with observation-based estimates. At both locations the finite-difference model produced the shortest arrival times, while the ray method produced the longest arrival times. Values of the travel time difference however appear to be within tolerable ranges, considering the propagation distance of the tsunami waves. The observed tsunami at Rodrigues, Mauritius in the west of the Madagascar was found to take a clockwise travel path around Australia and New Zealand, while the observed tsunami at King Edward Point in the southern Atlantic Ocean was found to traverse the Pacific Ocean and then passed into the Atlantic Ocean through the Drake Strait. The formation of icebergs captured by satellite images in Sulzberger in the Antarctica also supports the long-range propagation of the Tohoku-originated tsunami.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.8 no.6
• /
• pp.349-353
• /
• 2003

The physiological characteristics of cultures of very high cell mass (e.g. 10g cell mass/L), termed“ultrahigh cell density cultures”is reviewed. A close relationship was found between the length of the optical path (OP) in flat-plate reactors and the optimal cell density of the culture as well as its areal (g m$\^$-2/ day$\^$-1/) productivity. Cell-growth inhibition (GI) unfolds as culture density surpasses a certain threshold. If it is constantly relieved, a 1.0cm OP reactor could produce ca. 50% more than reactors with longer OP, e.g. 5 or 10cm. This unique effect, discovered by Hu et al. [3], is explained in terms of the relationships between the frequency of the light-dark cycle (L-D cycle), cells undergo in their travel between the light and dark volumes in the reactor, and the turnover time of the photosynthetic center (PC). In long OP reactors (5cm and above) the L-D cycle time may be orders of magnitude longer than the PC turnover time, resulting in a light regime in which the cells are exposed along the L-D cycle, to long, wasteful dark periods. In contrast, in reactors with an OP of ca. 1.0 cm, the L-D cycle frequency approaches the PC turnover time resulting in a significant reduction of the wasteful dark exposure time, thereby inducing a surge in photosynthetic efficiency. Presently, the major difficulty in mass cultivation of ultrahigh-density culture (UHDC) concerns cell growth inhibition in the culture, the exact nature of which is awaiting detailed investigation.

• Journal of Korean Society of Transportation
• /
• v.34 no.4
• /
• pp.341-353
• /
• 2016

Highway is mainly in charge of middle-long distance of vehicular travel. Trip length has shown a growing trend due to increased commute distances by the relocation of public agencies. For this reason, the proportion of driver-driven accidents, caused by their fatigue or sleepiness, are very high on highways. However, existing studies related to accident prediction have mainly considered external factors, such as road conditions, environmental factors and vehicle factors, without driving behavior. In this study, we suggested an accident index (FDR, Fatigued Driving Rate) based on traffic behavior using large-scale Car Navigation path data, and exlpored the relationship between FDR and traffic accidents. As a result, FDR and traffic accidents showed a high correlation. This confirmed the need for a paradigm shift (from facilities to travel behavior) in traffic accident prediction studies. FDR proposed in this study will be utilized in a variety of fields. For example, in providing information to prevent traffic accidents (sleepiness, reckless driving, etc) in advance, utilization of core technologies in highway safety diagnostics, selection of priority location of rest areas and shelter, and selection of attraction methods (rumble strips, grooving) for attention for fatigued sections.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.