• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.51 no.3
• /
• pp.155-160
• /
• 2002

This paper focuses on the problem of local obstacle avoidance of mobile robots. To solve this problem, the safety direction section search algorithm is suggested. This concept is mainly composed with non-collision section and collision section from the detecting area of laser scanning sensor. Then, we will search for the most suitable direction in these sections. The proposed local motion planning method is simple and requires less computation than others. An environment model is developed using the vector space concept to determine robot motion direction taking the target direction, obstacle configuration, and robot trajectory into account. Since the motion command is obtained considering motion dynamics, it results in smooth and fast as well as safe movement. Using the mobile base, the proposed obstacle avoidance method is tested, especially in the environment with pillar, wall and some doors. Also, the proposed autonomous motion planning and control algorithm are tested extensively. The experimental results show the proposed method yields safe and stable robot motion through the motion speed is not so fast.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.79-87
• /
• 2011

This paper presents the optimal design of an overlapped ultrasonic sensor ring for high resolution obstacle detection of an autonomous mobile robot. It is assumed that a set of low directivity ultrasonic sensors of the same type are arranged along a circle of nonzero radius at a regular spacing with their beams overlapped. First, taking into account the dead angle region, the entire range of obstacle detection is determined with reference to the center of an overlapped ultrasonic sensor ring. Second, the optimal design index of an overlapped ultrasonic sensor ring is defined as the area closeness of three sensing subzones resulting from beam overlap. Third, the lower and upper bounds on the number of ultrasonic sensors are derived, which can guarantee minimal beam overlap and also avoid excessive beam overlap among adjacent ultrasonic sensors. Fourth, employing a commercial low directivity ultrasonic sensor, an optimal design example of an overlapped ultrasonic sensor ring is given along with the ultrasonic sensor ring prototype mounted on top of a mobile robot. Finally, some experimental results using our prototype ultrasonic sensor ring are given to demonstrate the validity and performance of an optimally overlapped ultrasonic sensor ring for high resolution obstacle detection.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.489-496
• /
• 2006

The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.635-640
• /
• 2009

In real system application, the obstacle avoidance system for the autonomous control of the underwater flight vehicle (UFV) operates with the following problems: it has local information because the sonar can only offer the obstacle information in a local detection area, it requires a continuous control input because the system that has reduced acoustic noise and power consumption is necessary, and further, it requires an easy design procedure in terms of its structures and parameters. To solve these problems, an intelligent obstacle avoidance algorithm using the evolution strategy (ES) and the fuzzy logic controller (FLC), is proposed. To verify the performance of the proposed algorithm, the obstacle avoidance of UFV is performed. Simulation results show that the proposed algorithm effectively solves the problems in the real system application.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.800-804
• /
• 1999

An intelligent path planning algorithm for an autonomous cleaning robot is presented. This algorithm recognizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2923-2928
• /
• 2007

The study of model for velocity and turbulence within the urban canopy was carried out. To evaluate existing urban model we conducted wind tunnel experiment and large-eddy simulation (LES). Mean velocity profile and turbulence are measured within simple three different obstacle arrays. To obtain supplemental data and to verify morphological model large-eddy simulation was performed. Several methods have been used to achieve embodying the flow field in urban area. Recently, morphological method obtaining flow parameters from the statistical or physical representation of obstacle elements is a arising method. It was found that all morphological model, evaluated in this study, over predict the friction velocity, most sensitive one among the flow parameters. Velocity and turbulence in the urban canopy layer were improved by the correction using 'true' friction velocity.

• Journal of Mechanical Science and Technology
• /
• v.17 no.11
• /
• pp.1693-1703
• /
• 2003

This paper presents a new local obstacle avoidance method for indoor mobile robots. The method uses a new directional approach called the Lane Method. The Lane Method is combined with a velocity space method i.e., the Curvature-Velocity Method to form the Lane-Curvature Method (LCM). The Lane Method divides the work area into lanes, and then chooses the best lane to follow to optimize travel along a desired goal heading. A local heading is then calculated for entering and following the best lane, and CVM uses this local heading to determine the optimal translational and rotational velocities, considering some physical limitations and environmental constraint. By combining both the directional and velocity space methods, LCM yields safe collision-free motion as well as smooth motion taking the physical limitations of the robot motion into account.

• Proceedings of the KIEE Conference
• /
• 2003.07e
• /
• pp.38-41
• /
• 2003

An Autonomous Mobile Robot(AMR) performs duty by sensing a recognized situation and controlling suitably. The existing algorithm has some advantages that it is possible to express the obstacle exactly and the robot is sensitive to the change of environment. However, this algorithm needs to control repeatedly according to the modelling and working environment that requires a great quantity of calculations. In this paper, We supplement shortcoming and designed direction algorithm of AMR using fuzzy controller. Fuzzy controller does not derive special quality spinning expression for system, and uses rules by value expressed by language. It is used extensively to non-linear, plant which mathematical modelling is difficult etc... Fuzzy control algorithm of AMR that is used by this research applies obstacle position, distance of obstacle, Progress direction of robot, speed of robot, Perception area of sensor, etc... by fuzzy control and decide steering angle of robot.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.809-812
• /
• 1999

This paper presents the radio propagation effects in the shadow region due to the presence of obstacle, like building and tree, along the path at the B-WLL band. Using the Uniform Theory of Diffraction(UTD), the total field was obtained as the sum of contributions with diffraction ray from the each obstacle's edge, the direct ray, and the reflected rays from ground. The normalized signal level(in ㏈) is calculated with the parameters of the base station elevation and the distance between obstacle and receiver. This results are used to provide the suitable radio cell planning and coverage prediction in the area of shadow region.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.