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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.214-215
• /
• 2013

The main criteria for objective measure of the level of transportation service is travel time and delay time. In this paper, the level of service is measured by using moving vehicles method. Through this, we get the hourly traffic volume, the average travel time, space average speed, etc. In addition, we get the density of traffic.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.365-374
• /
• 1998

Control Chart is a powerful tool to detect that process is in control or out of control. CIM can have real effect when CIM involve automated quality control. A neural network approach is used for unnatural pattern detecting of control chart. The previous moving window method uses all unnatural pattern that is detected as moving time window. Therefore, It trains a large number of unnatural pattern and takes training time long. In this paper, the proposed method tests a small number of training unnatural pattern which modifies test data without repeating time. We shows that the proposed method has differences In training time and identification rate on the previous moving windows method. As results, we reduced training time and obtain the same identification rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.191-196
• /
• 2006

This paper presents the moving object tracking method using vision system. In order to track object in real time, the image of moving object have to be located the origin of the image coordinate axes. Accordingly, Fuzzy Control System is investigated for tracking the moving object, which control the camera module with Pan/Tilt mechanism. Hereafter, so the this system is applied to mobile robot, we design and implement image processing board for vision system. Also fuzzy controller is implemented to the StrongArm board. Finally, the proposed fuzzy controller is useful for the real-time moving object tracking system by experiment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.11
• /
• pp.1077-1081
• /
• 2004

In this Paper we discuss an algorithm for a real-time transmission of moving color image on the TCP/IP network using wavelet transform and neural network. The Image frames received from the camera are two-level wavelet-transformed in the server, and are transmitted to the client on the network. Then, the client performs the inverse wavelet-transform using only the received pieces of each image frame within the prescribed time limit to display the moving images. When the TCP/IP network is busy, only a fraction of each image frame will be delivered. When the line is free, the whole frame of each image will be transferred to the client. The receiver warns the sender of the condition of traffic congestion in the network by sending a special short frame for this specific purpose. The sender can respond to this information of warning by simply reducing the data rate which is adjusted with a neural network or fuzzy logic. In this way we can send a stream of moving images adaptively adjusting to the network traffic condition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.209-212
• /
• 2011

Triangulation is a typical method to locate or identify the location, which requires inherently at least three pre-recognized reference points. In some cases, owing to out of reachability to communication facility the target node can not reachable always to three base stations. This paper presents a predictive method, which can estimate the location of the moving target node in real time even though the target could not get in touch with all three base stations. The method is based on the PID-controlled Moving Objects Spatio-Temporal Model Algorithm. This can predict the moving direction of the moving target, and then combine with the past target position information to judge accurately the location.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.11
• /
• pp.1538-1551
• /
• 1997

Kinetic energy conservation for fixed and moving grids is examined in time-accurate finite element computation of fully unsteady inviscid flows. As numerical algorithms, fractional step method (FSM) and modified SIMPLE are used. To simulate the flow in moving grid system, arbitrary Lagrangian-Eulerian (ALE) method is adopted. In the present study, the energy conserving time integration rule for finite element algorithm is proposed and discussed schematically. It is shown that the discretization by Crank-Nicolson in time and Galerkin (central difference) in space must be used to ensure energy conservation. The developed code has been tested for a standing vortex in fixed or moving grid system, sloshing in a tank and propagation of a solitary wave, and has been shown to be a completely energy conserving algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.163-166
• /
• 2005

The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the time when a query point and objects are moving at the same time. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.4
• /
• pp.684-693
• /
• 2011

Measurement time delay in the transfer alignment is very important. It has been well known that the time delay degrades the alignment performance and makes some navigation errors on the transfer alignment of slave INS(SINS). Therefore there are many schemes to eliminate that time delay but the compensation technique through the estimation by Kalman filter through modeling the time delay as a random constant is generally used. In the case of change over measurement time delay or the large measurement time delay, estimation performance in the existing compensation technique is degraded because model of time delay is not correct any more. In this paper, we propose the method to keep the time delay almost constant even though in the abnormal communication state and very small through feedback compensation using double buffer. Double buffer consists of two moving window to temporarily store measurements from master INS and slave INS in real time.

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