• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.8
• /
• pp.195-202
• /
• 2018

With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.67-79
• /
• 2005

For tracing tag locations, the trajectories should be modeled and indexed in a radio frequency identification (RFID) system. The trajectory of a tag is represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as intervals and new index scheme called the Interval R-tree. We also propose new insert and split algorithms to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with the R-tree and the R*-tree. Our experiments show that the new index scheme outperforms the other two in processing queries of tags on various datasets.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2405-2407
• /
• 2003

This study deals with the gait optimization of via points on biped robot. ZMP(Zero Moment Point) is most important index in a biped robot's dynamic walking stability. To stable walking of a biped robot, legs's trajectory and a desired ZMP trajectory is required, balancing weight's movement is solved by FDM(Finite Difference Method). In this study, optimal index is defined to dynamically static walking of a biped robot, and optimization of via points is applied by GA(Genetic Algorithm).

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.325-336
• /
• 2006

For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper. design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.161-168
• /
• 2009

Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.56-68
• /
• 2006

For tracing tag locations, the trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as time-parameterized intervals and new index scheme called the Time Parameterized Interval R-tree. We also propose new insert and split algorithms that reduce the area of nodes to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with previous indexes on various datasets.

• Journal of the Society of Disaster Information
• /
• v.17 no.3
• /
• pp.655-666
• /
• 2021

Purpose: This study is to develop a method for measuring dynamic speeding risks using vehicle trajectory big data and to demonstrate the feasibility of the devised speeding index. Method: The speed behaviors of vehicles were analysed in microscopic space and time using individual vehicle trajectories, and then the boundary condition of speeding (i.e., boundary speed) was determined from the standpoint of crash risk. A novel index for measuring the risk exposure of speeding was developed in microscopic space and time with the boundary speed. Result: A validation study was conducted with vehicle-GPS trajectory big data and ground-truth vehicle crash data. As a result of the analysis, it turned out that the index of speeding-risk exposure has a strong explanatory power (R²=0.7) for motorway traffic accidents. This directly indicates that speeding behaviors should be analysed at a microscopic spatiotemporal dimension. Conclusion: The spatial and temporal evolution of vehicle velocity is very variable. It is, hence, expected that the method presented in this study could be efficaciously employed to analyse the causal factors of traffic accidents and the crash risk exposure in microscopic space using mobility trajectory data.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.406-412
• /
• 1996

Optimal trajectory for a robot manipulator minimizing actuator torques or energy consumption in a fixed traveling time is obtained in the presence of obstacles. All joint displacements are represented in finite terms of Fourier cosine series and the coefficients of the series are obtained optimally by nonlinear programming. Thus, the geometric path need not be prespecified and the full dynamic model is employed. To avoid the obstacles, the concept of penalty area is newly introduced and this penalty area is included in the performance index with an appropriate weighting coefficient. This optimal trajectory will be useful as a geometric path in the minimum-time trajectory planning problem.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.147-155
• /
• 1997

Optimal trajectory for a robot manipulator minimizing actuator torques or energy consumptions ina fixed traveling time is obtained in the presence of obstacles. All joint displacements are represented in finite terms of Fourier cosine series and the coefficients of the series are obtained optimally by nonlinear programming. Thus, the geometric path need not be prespecified and the full dynamic model is employed. To avoid the obstacles, the concept of the penalty area is newly introduced and this penalty area is includ- ed in the performance index with an appropriate weighting coefficient. This optimal trajectory will be useful as a geometric path in the minimum-time trajectory planning problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1584-1590
• /
• 2008

The combined query which consists of the region and trajectory query finds trajectories of moving objects which locate in a certain region. The trajectory query is very informant factor to determine query performance because it processes a point query continuously to find predecessors. This results in bad performance due to revisiting nodes in an index. This paper suggests an efficient method for the combined query based on the 3-dimensional R-tree which has good performance of the region query. The basic idea is that we define the least common search line which enables to search single path and a filtering method based on prediction without revisiting nodes.