• Wind and Structures
• /
• v.39 no.1
• /
• pp.15-30
• /
• 2024

In this paper, detailed wind field data of the full path of typhoon "Bailu" were obtained based on site measurements. Typhoon "Bailu" made first landfall southeast of the Taiwan Strait with a wind speed of approximately 30 m/s near the center of the typhoon eye and a second landfall in Dongshang County in Fujian Province. The moving process is classified into 3 regions for analysis and comparison. Detailed analyses of wind characteristics including wind profile, turbulence intensity, gust factor, turbulence integral scale and wind power spectral density function at the full process of the typhoon are conducted, and the findings are presented in this paper. Wind speed shows significant dependence on both the direction of the moving path and the distance between the typhoon center and measurement site. Wind characteristics significantly vary with the moving path of the typhoon center. The relationship between turbulence intensity and gust factor at different regions is investigated. The integral turbulence scales and wind speed are fitted by a Gaussian model. Such analysis and conclusions may provide guidance for future bridge wind-resistant design in engineering applications.

• Proceedings of the Safety Management and Science Conference
• /
• 2012.11a
• /
• pp.215-223
• /
• 2012

Or maybe moving dangerous goods tanks of motorists excluded from the scope of the supervision of the fire department and fire prevention education as a blind spot on the part of a large party evidence of markers of contamination loading of dangerous goods according to the type of education that can be handled only by preparing the institutional arrangements accident is blocking the moving path of Dangerous Goods moving tanks and loading dangerous goods on fire budget move the path that corresponds to the report received by securing the extinguishing agent is required to neutralize the ash and fire suppression and repression through skills training from large disasters in advance blocking devices should prepare that will.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11b
• /
• pp.780-785
• /
• 2001

A moving-magnet type pickup actuator is proposed, which has the back-yoke to improve th sensitivity. Through the magnetic path analysis, we can find that the flux density is increased i the air gap by the pole assignment of magnet and the adding of back-yoke can reduce the flu leakage and induce 40％ up of flux density. Experimental results show that the sensitivity i improved in the tracking direction, however, the improvement doesn't occur in the focusing direction. Finally, the compensation performance is tested in HD-DVD system. And it is verifie that the actuator can compensate the disc tilt of ${\pm}$0.7$^{\circ}$.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.1
• /
• pp.113-118
• /
• 2010

"Domestic delivery service" is defined the service to deliver goods or packages from point of senders to point of receiver. With the characteristics of door to door, it is must a service provider should know the exact location of destination assuring best utilization of moving path. Generally, location information consist of postal code and address only, which result in difficulties to identify the precise location of destination. It is relatively less correlated between the information that address refers and practical location in Korea address system. For example, the next door to house number 100 is not always house number 101. Therefore, a delivery man additionally uses a paper map or a GPS navigation which carry extra job to input every code of location to the device in order to know precise location. It is also very inconvenient that every delivery man identify the location that address information refers and make a personal decision of the optimum moving path dropping each destination without calculating provisioning process of whole delivery path. As explained above, it is inefficient to find information delivery service required and to generate the optimum path. In results, these difficulties bring in delay of service and increase of cost. In this point, the contents of the thesis suggest a GPS navigation system easy to obtain accuracy of delivery information which enables to automate optimum moving path based on RFID which contains location information.

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

This paper describes a moving path generation method for the Autonomous vehicles (AV) to search for paths in an unknown environment by using fixed obstacle information. Algorithms for the AV which were recently proposed have some problems, so it was difficult to utilize these algorithms in the real world. The purpose of this research is to examine the applicability of real-time control and efficient improvement by reducing calculation iterations. In the network which is constructed by the cell-decomposition method, a gate is installed in each cell. By verifying the possibility of gate pass-over, the number of cells which should be considered to find the solution can be reduce. Therefore, algorithm iterations can be dramatically improved. In this paper we have proven that path-generated algorithms are efficient by using simulation.

• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). 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 a solution that is very fast in computing the routes.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

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

In this paper, we deal with a novel path planning algorithm to find collision-free path for a moving robot to find an appropriate path from initial position to goal position. The robot should make progress by avoiding obstacles located at unknown position. Such problem is called the path planning. We propose so called the subgoal generation algorithm to find an effective collision-free path. The generation and selection of the subgoal are the key point of this algorithm. Several subgoals, if necessary, are generated by analyzing the map information. The subgoal is the candidate for the final path to be pass through. Then selection algorithm is executed to choose appropriate subgoal to construct a correct path. Deep and through explanations are given for the proposed algorithm. Simulation example is given to show the effectiveness of the proposed algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.913-917
• /
• 1994

A collision-free geometric path for industrial articulated robot is searched among polyhedral obstacles considering kinematic charcteristics. Then minimum-time control of the geometric path is studied considering dynamic characteristics. The algorithm is simulated on PC for maximum speed, moving time and so forth.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.771-779
• /
• 2010

This paper presents a method that integrates the geometric path tracking and the obstacle avoidance for nonholonomic mobile robot. The mobile robot follows the path by moving through the turning radius given from the pure pursuit method which is the one of the geometric path tracking methods. And the obstacle generates the obstacle potential, from this potential, the virtual force is obtained. Therefore, the turning radius for avoiding the obstacle is calculated by proportional to the virtual force. By integrating the turning radius for avoiding the obstacle and the turning radius for following the path, the mobile robot follows the path and avoids the obstacle simultaneously. The effectiveness of the proposed method is verified through the real experiments for path tracking only, static obstacle avoidance, dynamic obstacle avoidance.