• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.113-119
• /
• 2012

In this paper we propose the method that detects moving objects in autonomous navigation vehicle using LRF sensor data. Object detection and tracking methods are widely used in research area like safe-driving, safe-navigation of the autonomous vehicle. The proposed method consists of three steps: data segmentation, mobility classification and object tracking. In order to make the raw LRF sensor data to be useful, Occupancy grid is generated and the raw data is segmented according to its appearance. For classifying whether the object is moving or static, trajectory patterns are analysed. As the last step, Markov chain Monte Carlo (MCMC) method is used for tracking the object. Experimental results indicate that the proposed method can accurately detect moving objects.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.283-286
• /
• 2004

This paper refers and implements XML Web services, which supports networked interchanges of moving object information. XML Web services are expected to be fundamental building blocks in the move to distributed computing on the Internet. As an interchange format, GML encodes semantics, syntax, and schema of geospatial and geoprocessing-related information resources. It can give great benefits to utilize raw data easily as an XML encoding format does. This paper proposes a full coverage of interoperable location trajectory services consisting of 3 independent modules: a moving object database, a data processing server, and a web services interface module. For communications, SOAP protocols and WSDL documents are used, which can guarantee an interoperability of a system regardless of different platforms and service channels. This paper also designs a GML data format that represents location information of probe cars.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.157-162
• /
• 2002

Recently, location based services, which make use of location information of moving objects, have obtained increasingly high attention. The moving objects are time-evolving spatial objects, that is, their locations are dynamically changed as time varies. Generally, GIS server stores and manages the spatial objects, of which locations are rarely changed. The traditional GIS server, however, has a difficulty to manage the moving objects, due to the fact of locations being frequently changed and the trajectory information (past locations of moving objects) being managed. In this paper, we have designed a moving object server, which stores and manages the locations in order to support various location based services. The moving object server is composed of a location acquisition component, a location storage component, and a location query component. The contribution of this paper is that we integrate the each work for location acquisition, storage, and query into a moving objects server.

• Korean Journal of Optics and Photonics
• /
• v.6 no.4
• /
• pp.274-281
• /
• 1995

The new method of recording and reconstructing a synthetic object, which was called as scannedobject holography (SOH), was proposed and its feasibility was demonstrated theoretically and experimentally. The hologram was recorded by interfering the fixed reference beam with spherical waves emitting from a moving point source, whose trajectory determined the shape of the synthetic object to be recorded. The end face of an optical fiber and the output from a pulsed laser were utilized in order to implement a moving point source experimentally. tally.

• Journal of the Korean Society of Industry Convergence
• /
• v.22 no.4
• /
• pp.415-425
• /
• 2019

This study proposes a new approach to control Moving Stuff Action Through Iterative Learning robot with dual arm for smart factory. When robot moves object with dual arm, not only position of each hand but also contact force at surface of an object should be considered. However, it is not easy to determine every parameters for planning trajectory of the an object and grasping object concerning about variety compliant environment. On the other hand, human knows how to move an object gracefully by using eyes and feel of hands which means that robot could learn position and force from human demonstration so that robot can use learned task at variety case. This paper suggest a way how to learn dynamic equation which concern about both of position and path.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.114-125
• /
• 2006

Since wireless Internet services and small mobile communication devices come into wide use as well as the use of GPS is rapidly growing, researches on moving object, whose location information shifts sequently in accordance with time interval, are being carried out actively. Especially, the researches on vehicle moving object are applied to Advanced traveler information system, vehicle tracking system, and distribution transport system. These systems are very useful in searching previous positions, predicted future positions, the optimum course, and the shortest course of a vehicle by managing historical data of the vehicle movement. In addition, vehicle historical data are used for distribution transport plan and vehicle allocation. Vehicle historical data are stored at regular intervals, which can have a pattern. For example, a vehicle going repeatedly around a specific section follows a route very similar to another. If historical data of the vehicle with a repeated route course are stored at regular intervals, many redundant data occur, which result in much waste of storage. Therefore this thesis suggest a vehicle historical data store scheme for vehicles with a repeated route course using similar trajectory which efficiently store vehicle historical data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.110-116
• /
• 2013

With the recent development of wireless network technologies, there have been increasing usage of variouse position base servies. Position based services basically collect position information of moving object for the utilization of them in real life. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. In the paper, we consider volume of Extended Minimum Bounding Rectangles(EMBR) to be determined by average size of range queries. We proposed the methode that split efficiently moving object with long distance between location, and split moving object for decrease searching space an Estimated-Split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.59-66
• /
• 2016

For the performance experiments of databases systems with moving object databases, we need moving object trajectory data sets. For example, benchmark data sets of moving object trajectories are required for experiments on query processing of moving object databases. For those reasons, several tools have been developed for generating moving objects in Euclidean spaces or road network spaces. Indoor space differs from outdoor spaces in many aspects and moving object generator for indoor space should reflect these differences. Even some tools were developed to produce virtual moving object trajectories in indoor space, the movements generated by them are not realistic. In this paper, we present a moving object generation tool for indoor space. First, this tool generates trajectories for pedestrians in an indoor space. And it provides a parametric generation of trajectories considering not only speed, number of pedestrians, minimum distance between pedestrians but also type of spaces, time constraints, and type of pedestrians. We try to reflect the patterns of pedestrians in indoor space as realistic as possible. For the reason of interoperability, several geospatial standards are used in the development of the tool.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1402-1407
• /
• 2004

Moving a fragile object from an initial point to a goal location in minimum time without damage is pursued in this paper. In order to achieve the goal, first of all, the range of maximum acceleration and velocity are specified, which the manipulator can generate dynamically on the path that is planned a priori considering the geometrical constraints. Later, considering the impulsive force constraint of the object, the range of maximum acceleration and velocity are going to be obtained to keep the object safe while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of the acceleration and velocity. This time optimal trajectory planning can be applied for real applications and is suitable for not only a continuous path but also a discrete path.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.109-120
• /
• 2006

This paper addresses techniques for predicting a future path of an object moving on a road network. Most prior methods for future prediction mainly focus their attention on objects moving in Euclidean space. A variety of applications such as telematics, however, deal with objects that move only over road networks in most cases, thereby requiring an effective method of future prediction of moving objects on road networks. In this paper, we propose a novel method for predicting a future path of an object by analyzing past trajectories whose changing pattern is similar to that of a current trajectory of a query object. We devise a new function that measures a similarity between trajectories by reflecting the characteristics of road networks. By using this function, we predict a future path of a given moving object as follows: First, we search for candidate trajectories that contain subtrajectories similar to a given query trajectory by accessing past trajectories stored in moving object databases. Then, we predict a future path of a query object by analyzing the moving paths along with a current position to a destination of candidate trajectories thus retrieved. Also, we suggest a method that improves the accuracy of path prediction by regarding moving paths that have just small differences as the same group.