• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.317-320
• /
• 2005

The LBS (Location-Based Services) are valuable information services combined the location of moving object with various contents such as map, POI (point of Interest), route and so on. The must general service of LBS is route determination service and its applicable parts are FMS (Fleet Management System), travel advisory system and mobile navigation system. The core function of route determination service is determination of optimal route from source to destination in various environments. The MODB (Moving Object Database) system, core part of LBS composition systems, is able to manage current or past location information of moving object and massive trajectory information stored in MODB is value-added data in CRM, ERP and data mining part. Also this past trajectory information can be helpful to determine optimal route. In this paper, we suggest methods to determine optimal route by querying past trajectory information in MODB system and verify the effectiveness of suggested method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.10
• /
• pp.1014-1022
• /
• 2009

A biped robot in locomotion can be regarded to be kinetically redundant in that the link-chain from its foot on the ground to its swing foot has more degrees of freedom that needed to realize stable bipedal locomotion. This paper proposes a new method to generate a trajectory for bipedal locomotion based on this redundancy, which directly generates a locomotion trajectory at the joint level unlike some other methods such as LIPM (linear inverted-pendulum mode) and GCIPM (gravity-compensated inverted-pendulum mode), each of which generates a trajectory of the center of gravity or the hip link under the assumption of the dominance of the hip-link inertia before generating the trajectory of the whole links at the joint level. For the stability of the trajectory generated in the proposed method, a stability condition based on the ZMP (zero-moment point) is used as a constraint as well as other kinetic constraints for bipedal motions. A 6-DOF biped robot is used to show how a stable locomotion trajectory can be generated in the sagittal plane by the proposed method and to demonstrate the feasibility of the proposed method.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.9
• /
• pp.875-881
• /
• 2010

During the lunar mission, spacecraft are subject to various unexpected disturbance sources such as third body attraction, solar pressure and operating impulsive maneuver error. Therefore, efficient trajectory correction maneuver (TCM) strategy must be required to follow the designed mission trajectory. In the early days of space exploration, the mission trajectory has been designed by using patched conic approach based on two-body dynamics for the lunar mission. Thus the TCM based on two-body dynamics has been usually adopted. However, with the advanced in computing power, the mission trajectory based on three-body dynamics is attempted recently. Thus, these approaches based on two-body dynamics are essentially different from real environment and large amount of energy for the TCM is required. In this work, we study the trajectory correction maneuver based on three-body dynamics.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.9
• /
• pp.1551-1556
• /
• 2016

A combined CPG (Central Pattern Generator) based foot trajectory and GP (Genetic Programming) based joint compensation method is presented for the adaptive humanoid walking. The CPG based foot trajectory methods have been successfully applied to basic slops and variable slops with slow rates, but have a limitation for the steep slop terrains. In order to increase an adaptability of humanoid walking for the rough terrains, a GP based joint compensation method is proposed and combined to the CPG (Central Pattern Generator) based foot trajectory method. The experiments using humanoid robot Nao are conducted in an ODE based Webots simulation environmemt to verify a stability of walking for the various aslope terrains. The proposed method is compared to the previous CPG foot trajectory technique and shows better performances especially for the steep varied slopes.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.750-759
• /
• 2020

The wide application of various integrated location-based services (LBS social) and tourism application (app) has generated a large amount of trajectory space data. The trajectory data are used to identify popular tourist attractions with high density of tourists, and they are of great significance to smart service and emergency management of scenic spots. A hot spot analysis method is proposed, based on spatial clustering of trajectory stop points. The DBSCAN algorithm is studied with fast clustering speed, noise processing and clustering of arbitrary shapes in space. The shortage of parameters is manually selected, and an improved method is proposed to adaptively determine parameters based on statistical distribution characteristics of data. DBSCAN clustering analysis and contrast experiments are carried out for three different datasets of artificial synthetic two-dimensional dataset, four-dimensional Iris real dataset and scenic track retention point. The experiment results show that the method can automatically generate reasonable clustering division, and it is superior to traditional algorithms such as DBSCAN and k-means. Finally, based on the spatial clustering results of the trajectory stay points, the Getis-Ord Gi* hotspot analysis and mapping are conducted in ArcGIS software. The hot spots of different tourist attractions are classified according to the analysis results, and the distribution of popular scenic spots is determined with the actual heat of the scenic spots.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.14-26
• /
• 2003

Moving objects' trajectories play an important role in indexing video data on their content and semantics for content-based video retrieval. In this paper, we propose new similar sub-trajectory retrieval schemes based on k-warping algorithm for efficient retrieval on moving objects' trajectories in video data. The proposed schemes are fixed-replication similar sub-trajectory retrieval(FRSR) and variable-replication similar sub-trajectory retrieval(VRSR). The former can replicate motions with a fixed number for all motions being composed of the trajectory. The latter can replicate motions with a variable number. Our schemes support multiple properties including direction, distance, and time interval as well as a single property of direction, which is mainly used for modeling moving objects' trajectories. Finally, we show from our experiment that our schemes outperform Li's scheme(no-warping) and Shan's scheme(infinite-warping) in terns of precision and recall measures.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.56 no.1
• /
• pp.1-10
• /
• 2020

In the previous study, a shooting trajectory assuming that the purse seine shooting trajectory is a circle was proposed based on the speed and direction of the movement of the fish school. However, in practice, a trajectory that is closer to an elliptical shape than a circular one is often formed. In this study, the existing circular trajectory and the elliptical trajectory methods were compared under the same conditions to confirm the effectiveness of elliptical shooting trajectory. In addition, changes in the eccentricity of ellipses were derived to assess which type of ellipse was appropriate as a shooting trajectory. When a high-speed fish school moves in a straight line, an elliptical shooting trajectory with the eccentricity of 0.7 to 0.9 will be reasonable, and for middle-low speed fish school, an elliptical shooting trajectory with the eccentricity of 0.4 to 0.6 will be more useful than a circle shooting trajectory.

• Information and Communications Magazine
• /
• v.29 no.8
• /
• pp.72-84
• /
• 2012

This paper introduces three vehicle trajectory-based data forwarding schemes, tailored for vehicular ad hoc networks. Nowadays GPS-based navigation systems are popularly used for providing efficient driving paths for drivers. With the driving paths called vehicle trajectories, we can make data forwarding schemes more efficient, considering the micro-scoped mobility of individual vehicles in road networks as well as the macro-scoped mobility of vehicular traffic statistics. This paper shows why the vehicle trajectory is a key ingredient in the design of the vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes over multihop. Through the mathematical formulation, the key design techniques are shown for three forwarding schemes based on vehicle trajectory, compared with a state-of- the- art data forwarding scheme based on only vehicular traffic statistics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3150-3170
• /
• 2016

In Intelligent Transportation Systems (ITS), logistics distribution and mobile e-commerce, the real-time, accurate and reliable vehicle trajectory prediction has significant application value. Vehicle trajectory prediction can not only provide accurate location-based services, but also can monitor and predict traffic situation in advance, and then further recommend the optimal route for users. In this paper, firstly, we mine the double layers of hidden states of vehicle historical trajectories, and then determine the parameters of HMM (hidden Markov model) by historical data. Secondly, we adopt Viterbi algorithm to seek the double layers hidden states sequences corresponding to the just driven trajectory. Finally, we propose a new algorithm (DHMTP) for vehicle trajectory prediction based on the hidden Markov model of double layers hidden states, and predict the nearest neighbor unit of location information of the next k stages. The experimental results demonstrate that the prediction accuracy of the proposed algorithm is increased by 18.3% compared with TPMO algorithm and increased by 23.1% compared with Naive algorithm in aspect of predicting the next k phases' trajectories, especially when traffic flow is greater, such as this time from weekday morning to evening. Moreover, the time performance of DHMTP algorithm is also clearly improved compared with TPMO algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.29-40
• /
• 2008

With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.