• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.327-330
• /
• 1995

If a mobile robot is used in a real situation, robot must face a moving obstacles. In that case, the collision avoidance algorithm for moving obstacle is a indispensible element in mobile robot control. We csrried out a research to find and evaluate the advanced algorithm for mobile robot. At first we generate the continous path for mobi;e robot. Then by creating a curved path for avoidance, the mobile robot can change its path smoothly. Smoothed path made the robot adapt more effectively to the changing of path. Under time-varying condition, computer simulation was performed to show the validation of proposed algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.9
• /
• pp.142-150
• /
• 2002

This study describes a method of finding an optimal path of a soccer robot by using a concentric circle method with different radii of rotation. Comparing with conventional algorithms which try to find the shortest path length, the variable concentric circle method find the shortest moving time. The radius fur the shortest moving time for a given ball location depends on the relative location between a shooting robot and a ball. Practically it is difficult to find an analytical solution due to many unknowns. Assuming a radius of rotation within a possible range, total path moving time can be calculated by adding the times needed for straight path and circular path. Among these times the shortest time is obtained. In this paper, a graphical solution is presented such that the game ground is divided into 3 regions with a minimum, medium, and maximum radius of rotation.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.298-303
• /
• 2008

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths for predicting the goal position and the path to the goal by observing the user's current moving path. We develop a spatio-temporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatio-temporal position is estimated. Through experiments we confirm this method is useful and effective.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• Journal of Korea Game Society
• /
• v.6 no.3
• /
• pp.3-12
• /
• 2006

Path-finding, one of the traditional Game A.I. problems, becomes an important issue to make games more realistic. Due to the limited resources in the computer system, path-finding systems sometimes produce a simplified and unrealistic path. The most relent researches have been focused on the path-finding avoiding only static obstacles. Various moving obstacles are however deployed in real games, a method avoiding those obstacles and producing a smooth path is necessary. In this paper, navigation mesh is used to represent 3D space and its topological characteristics are used for path-finding. Intellectual repulser and attractor are also used to avoid moving obstacles and to find an optimal path. We have evaluated the path produced by the method proposed in this paper and verified its usability in real game.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.11
• /
• pp.1175-1180
• /
• 2014

This paper proposes a new technique that produces improved local information using a low-cost GPS/INS system combined with Extended Kalman Filter and Path Planning when a Quad-rotor flies. In the research, a low-cost GPS is combined with INS by Extended Kalman Filter to improve local information. However, this system has disadvantages in that estimation accuracy is getting worsens when the Quad-rotor flies through the air in a curve and precision of location information is influenced by performance of the used GPS. An algorithm based on Path Planning is adopted to deal with these weaknesses. When the Quad-rotor flies outdoors, a short moving path can be predicted because all short moving paths of quad-rotor can be assumed to be straight. Path planning is used to make the short moving path and determine the closest local information of data of the GPS/INS system to location determined by path planning. Through the foregoing process, improved local data is obtained when the quad-rotor flies, and the performance of the proposed system is verified from various outdoor experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.568-574
• /
• 2006

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths and predict the goal position and the path to the goal by observing the user's current moving path. We develop a spatiotemporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatiotemporal position is estimated. Through experiments we confirm this method is useful and effective.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.302-305
• /
• 2008

For an complete image composition to be stitched on several mosaic images, tracing displacement of direction and distance between successive images are important parameters. The input image is modeled by using a general second order two-dimensional Taylor-series and then converting it to a $3{\times}3$ correlation block and storing the data. A moving factor and coordinate is calculated by comparing the continuous correlation blocks. The experimentation result has a success rate of 85% for moving path tracing as continuous images are moved to 10% of image central position.