• Proceedings of the Optical Society of Korea Conference
• /
• 2006.07a
• /
• pp.467-468
• /
• 2006

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2387-2392
• /
• 2003

In this paper, We designed the local path planning direction algorithmusing fuzzy controller applied fuzzy logic. Algorithm decieded a direction angle by theposition of obstacle, the distance with obstacle, the progress direction of robot, the speed of vehicles and the perception area of sensor. The robot designed with proposed algorithm carried out soft moving without any particular operation, and we could observe that it had very soft curved moving as if an expert drove.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.266-268
• /
• 2005

Recently, the ability of sensing obstacles by oneself and creating suitable moving path in mobile robots are required to provide various kinds automation services. Therefore, in this paper, we studied the avoidance behavior of mobile robots from dynamic obstacles using potential function that minimizes distance and time. We examined the performance of the proposed algorithm by comparing the method of based on the geometrical experience in simulations.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.82-85
• /
• 2003

This paper proposes a preprocessing method for tracking aircraft's take-off and lading. The method uses accumulative difference image technique for segmenting the object from the background, and obtains the centroid of the object exactly using centroid method. Then the moving object is analyzed and represented with the information such as feature point, velocity, and distance. A simulation result reveals that the proposed algorithm has good performance in segmenting and tracking the aircraft.

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

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.71-78
• /
• 2013

An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

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

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.270-271
• /
• 2008

The positioning technology for a moving object is an important and essential component of ubiquitous communication computing environment and applications, for which Radio Frequency IDentification Identification(RFID) is has been considered as also a core technology for ubiquitous wireless communication. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and k can be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in 1-Dimensional space, the square in 2-Dimensional space and the cubic in 3-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2- and 3-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space and 143% of the tag spacing distance in 3-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

• KIEAE Journal
• /
• v.13 no.2
• /
• pp.67-76
• /
• 2013

The purpose of this study is to analyze the accessibility to the place for outdoor exercise. For that, the departure (resident) location of the users of outdoor exercise equipment within 12 parks in Seoul have been investigated. A total of 1,733 people have been surveyed during the two-week period between Aug.2 and Aug. 15 and 815 cases were analyzed. We also investigated demographic characteristics, access method and related factors such as location, climate and visiting time. The results were coded through ArcGis program and the accessibility to each exercise location, difference in regional accessibility and accessibility characteristics in terms of climate and time have been analyzed. The results are as follows: First, visitors to the Han River start from the places further than the visitors to the streamlines. Second, the average moving distance is longer for the users aged under-60 than for the users aged 60 and over to reach the exercise place. And the average moving distance for visitors to the Han River destination is the longest with 748 meters, followed by 203 meters for general parks and 92 meters for streamline parks, respectively. Third, in each non-waterfront parks, the moving distance by users under-60 was longer by about 230 meters than that by users 60 and over. Fourth, exercisers in the weekend travel more by 244 meters than those during the midweek users to reach the exercise place. Fifth, the number of visitors to the Han River increased in the weekend while visitors to the streamlines decreased in the same period. Sixth, the traveling length for bicycle users is three times as much as that for pedestrian visitors. And the departure locations of bicycle users were more widely distributed.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.48-64
• /
• 2003

Recently, as the number of mobile users keeps increasing explosively, the location management to track the mobile users in mobile communication systems is being more important. However, the previous location management schemes have been used static location information without the consideration of a user's moving direction. This results in unnecessary pagings, consequently it increases location management costs. In this paper, we propose a mew location management costs. In this paper, we propose a new location the cell occurred a location update. It also determines whether the location update will be executed or not, by the offset operation of direction vector. Thus, a user's paging areas are generated dynamically along the user's moving direction. The wide of paging areas is also determined dynamically. Besides, we present analytic model for our scheme. To compare with our scheme, the distance-based scheme is analyzed. The numerical result shows that our scheme is more efficient than the distance-based scheme in the most cases except a low CMR. Particularly if a user move into a specific direction, our scheme has the lower location management cost than that of the distance-based scheme.