• Journal of the Korea Convergence Society
• /
• v.10 no.4
• /
• pp.33-38
• /
• 2019

Recently, to support location-based services, there have been many researches which consider the spatial network. For this, there are many experimental data for data processing on the road network. However, the data to process the trajectory of moving objects are not suitable. Therefore, we propose index structure to process the trajectory data on the road network and the trajectory data generation algorithm. In addition, to prove efficiency of our index structure and algorithm, we show that edge-based trajectory data are generated through the proposed algorithm using the map data of San Francisco Bay.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.

• International Journal of Aeronautical and Space Sciences
• /
• v.13 no.3
• /
• pp.377-385
• /
• 2012

The Automatic Dependent Surveillance Broadcast (ADS-B) system is a key component of CNS/ATM recommended by the International Civil Aviation Organization (ICAO) as the next generation air traffic control system. ADS-B broadcasts identification, positional data, and operation information of an aircraft to other aircraft, ground vehicles and ground stations in the nearby region. This paper explores the ADS-B based trajectory prediction and the conflict detection algorithm. The multiple-model based trajectory prediction algorithm leads accurate predicted conflict probability at a future forecast time. We propose an efficient and accurate algorithm to calculate conflict probability based on approximation of the conflict zone by a set of blocks. The performance of proposed algorithms is demonstrated by a numerical simulation of two aircraft encounter scenarios.

• Journal of Power System Engineering
• /
• v.16 no.1
• /
• pp.84-90
• /
• 2012

In unmanned vehicles' navigation, the shapes of obstacles are generally irregular and complex. The motion of vehicles based on the range sensor system such as ultrasonic sensors or laser sensors can be unstable due to the irregular shape of the obstacles. In this case, to generate stable trajectory of unmanned vehicles equipped with range sensors, we need an approach that can simplify an obstacle's irregular shape information. In this paper, we propose the trajectory generation algorithm that an vehicle can stably navigate in the environments where irregular shaped obstacles are scattered. The proposed method is verified through the analysis of vehicle's trail and direction data acquired by simulations and implementations.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.419-425
• /
• 2016

In navigator systems, keeping map data up-to-date is an important task. Manual update involves a substantial cost and it is difficult to achieve immediate reflection of changes with manual updates. In this paper, we present a method for trajectory-center extraction, which is essential for automatic road map generation with GPS data. Though clustered trajectories are necessary to extract the center road, real trajectories are not clustered. To address this problem, this paper proposes a new method using the maximum overlapping interval and trajectory clustering. Finally, we apply the Virtual Running method to extract the center road from the clustered trajectories. We conducted experiments on real massive taxi GPS data sets collected throughout Gang-Nam-Gu, Sung-Nam city and all parts of Seoul city. Experimental results showed that our method is stable and efficient for extracting the center trajectory of real roads.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.6
• /
• pp.53-61
• /
• 2014

For monitoring the flight trajectory and the status of a launch vehicle, the mission control system in NARO space center process data acquired from the ground tracking system, which consists of two tracking radars, four telemetry stations, and one electro-optical tracking system. Each tracking unit exhibits its own tracking error mainly due to multi-path, clutter and radio refraction, and by utilizing only one among transmitted informations, it is not possible to determine the actual vehicle trajectory. This paper presents a way of generating flight trajectory via post-processing the data received from the ground tracking system. The post-processing algorithm is divided into two parts: compensation for atmosphere radio refraction and multi-sensor fusion, for which a decentralized Kalman filter was adopted and implemented based on constant acceleration model. Applications of the present scheme to real data resulted in the flight trajectory where the tracking errors were minimized than done by any one sensor.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.29 no.3
• /
• pp.281-287
• /
• 2023

Establishing a ship's passage plan is an essential step before it starts to sail. The research related to the automatic generation of ship passage plans is attracting attention because of the development of maritime autonomous surface ships. In coastal water navigation, the land, islands, and navigation rules need to be considered. From the path planning algorithm's perspective, a ship's passage planning is a global path-planning problem. Because conventional global path-planning methods such as Dijkstra and A^* are time-consuming owing to the processes such as environmental modeling, it is difficult to modify a ship's passage plan during a voyage. Therefore, the D^* algorithm was used to address these problems. The starting point was near Busan New Port, and the destination was Ulsan Port. The navigable area was designated based on a combination of the ship trajectory data and grid in the target area. The initial path plan generated using the D^* algorithm was analyzed with 33 waypoints and a total distance of 113.946 km. The final path plan was simplified using the Douglas-Peucker algorithm. It was analyzed with a total distance of 110.156 km and 10 waypoints. This is approximately 3.05% less than the total distance of the initial passage plan of the ship. This study demonstrated the feasibility of automatically generating a path plan in coastal navigation for maritime autonomous surface ships using the D^* algorithm. Using the shortest distance-based path planning algorithm, the ship's fuel consumption and sailing time can be minimized.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1051-1058
• /
• 2012

The unified lateral control algorithm for automatic valet parking for various types of vehicles is presented and its feasibility is shown experimentally via field tests for the given parking scenario. First, a trajectory generation algorithm for forward driving and backward multi-step parking maneuvers is developed. Then, with consideration of different types of vehicles and operating conditions, a kinematic vehicle model is used and validated using field test data. Using the nonlinear vehicle model, the lateral controller is designed based on dynamic surface control. Finally the proposed lateral control law is validated via hardware-in-the-loop simulations for different types of vehicles and experimentally using a test vehicle through field tests.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.288-295
• /
• 2003

An adaptive procedure in finite element analysis is presented by p-refinement of meshes in conjunction with a posteriori error estimator that is based on the recovery technique. In case of the recovery technique, the SPR(superconvergent patch recovery) approach has been modified for p-adaptive mesh refinement. The strategy of finding a nearly optimal distribution of polynomial degrees on a fixed finite element mesh is discussed such that a particular element has to be refined automatically to obtain an acceptable level of accuracy by increasing p-levels non-uniformly. To verify the proposed algorithm, the limit value approach is proposed which utilizes the exact strain energy computed from the extrapolation equation. A new pre-processor is developed for the p-version finite element program in which the vector graphic editor is used for the automatic generation of node connection and coordinate by halfedge solid data structure according to uniform or nonuniform p-distribution. The general 2-D algorithm is also developed to generate face modes and internal modes in accordance with different mesh types. The quality of the error estimator is investigated with the help of two mumerical examples. The results show that the sequences of p-distributions obtained by the proposed error indicator closely follow the optimal trajectory.