• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.824-831
• /
• 2009

This paper proposes an obstacle avoidance algorithm for an autonomous mobile robot. The proposed method based on the circular navigation with probability distribution finds local-paths to avoid collisions. Futhermore, it makes mobile robots to achieve obstacle avoidance and optimal path planning due to the accurate decision of the final goal. Simulation results are included to show the feasibility of the proposed method.

• Proceedings of the KSME Conference
• /
• 2001.11b
• /
• pp.676-681
• /
• 2001

In this paper, the spin-up from rest to a state of solid-body rotation in a circular container with a slender rectangular obstacle on the bottom wall is analysed experimentally. We use a PIV method for the evolution of the free-surface flow. Laboratory experiments have been carried out for a variety of the obstacle height h(0, 5, 10 [mm]) and the liquid depth H(25, 50, 75, 100 [mm]). It was found that the spin-up time is crucially dependent on the obstacle height T. In the case of T=10[mm] the spin-up time is considerably shorter then the other cases.

• Journal of the Korean Institute of Gas
• /
• v.12 no.1
• /
• pp.54-61
• /
• 2008

Experimental investigations were performed to assess the influences of different multiple obstacles on flame propagation in a rectangular confinement. Three different multiple obstacles were used: circular, triangular and square cross-sections with blockage ratios of 15% and 30%. The same method described in Park et al. [13] to investigate the interaction between the propagating flame and the obstacle was applied. Before the freely propagating flame impinged on the obstacle, the flame propagation speed remains close to the laminar burning velocity, regardless of the obstacles used. The reported data revealed that the trend in increase of the local flame propagation speed is a result of the interaction between the obstacle and the propagating flame front behind the obstacle. The local speed was found to increase from a circular to a triangular and a square obstacle. The mean flame speed was found to be less dependent on both the obstacle types and the different blockage ratios used.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.1
• /
• pp.105-110
• /
• 2009

In this paper, we proposed a navigation algorithm of the mobile robot for obstacle avoidance using a circular path planning method. The proposed method makes circular paths in order to avoid obstacles in the front side of the mobile robot. An optimal path for approaching to the target is selected and the linear and angular speeds for stable moving of the mobile robot are controlled. Obstacles are detected by image processing which reduce image data obtained from a web camera. Performance of the proposed algorithm is shown by experiments with application to the Pioneer-2DX mobile robot.

• Journal of computational fluids engineering
• /
• v.11 no.3 s.34
• /
• pp.28-36
• /
• 2006

NSBT(No Slip Boundary Treatment) is a newly developed scheme for the treatment of a no slip condition on the solid wall of obstacle in a flow field. In our research, NSBT was used to perform LBM simulation of a flow over a circular cylinder to determine the flow feature and aerodynamics characteristic of the cylinder. To ascertain the applicability of NSBT on the complex shape of the obstacle, it was first simulated for the case of the flow over a circular and square cylinder in a channel and the results were compared against the solution of Navier-Stokes equation. The simulations were performed in a moderate range of Reynolds number at each cylinder position to identify the flow feature and aerodynamic characteristics of circular cylinder in a channel. The drag coefficients of the cylinder were calculated from the simulation results. We have numerically confirmed that the critical reynolds number for vortex shedding is in the range of 200$\sim$250. For the gap parameter $\gamma$ = 2 cases at Re > 240, the vortex shedding were symmetric and it resembled the Karmann vortex. As the cylinder approached to one wall, the vorticity significantly reduced in length while the vorticity on the other side elongated and the vorticity combined with the wall boundary-layer vorticity. The resultant $C_d$ by LBM concurred with the results of DNS simulation performed by previous researchers.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2856-2858
• /
• 2000

This paper proposes a scan code method for obstacle avoidance of mobile robot. Obstacles detected in a circular window are converted to scan codes and then to the steering angle. The safe rotating radius is obtained by the scan code to avoid the collision between robot and obstacle and. the minimum distance for rotation is calculated. Effectiveness of the method is illustrated through simulations, and the results show that the proposed method can be efficiently implemented to an unknown environment.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.11
• /
• pp.809-817
• /
• 2022

The development of unmanned robots and UAVs has increased the need for path planning methods such as RRT^* algorithm. It mostly works well in various environments and is utilized in many fields. A lot of research has been conducted to obtain a better path in terms of efficiency through various modifications to the RRT^* algorithm, and the performance of the algorithm is continuously improved thanks to these efforts. In this study, a method using the limitation of sampling range is proposed as an extension of these efforts. Based on the idea that a path passing close to obstacles is similar to the optimal path in obstacle environments, nodes are produced around the obstacle. Also, rewiring algorithm is modified to quickly obtain the path. The performance of the proposed algorithm is validated by comparative analysis of the previous basic algorithm and the generated path is tracked by a UAV's kinematic model for further verification.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1521-1522
• /
• 2008

This paper proposes a obstacle avoidance algorithm that enavles a mobile robot with autonomous. The proposed method based on circular navigation with probability distribution and finds local-paths to avoid collisions. Simulation results show the feasibility of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.1
• /
• pp.7-18
• /
• 2001

In this paper, we present a new method to generate obstacle-free path by using conformal mapping, when avatar navigates in virtual environment. First, we show that the proposed method generates a path to keep away from a circular obstacle. Then, we show that the method can be extended to an elliptical obstacle and multiple obstacles. For real applications, we combine the proposed local method with a global navigation method using sub-target to generate a global obstacle-free path by which avatar navigates naturally in virtual environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.