• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1601-1604
• /
• 1997

The most important topic in research of mobile robot is path planning in order to avoid with obstacle. In this study the path planning algorithm using a neural network model is proposed. The inputs of neural network are range data which are acquired form laser range finderm and weights are based on difference with goal direction. The thresholds are made by consdiering the marginal distance between mobile robot and obstacle. Consequently the outputs are obtained by multiplying input and weight. The obtained heading directiion enables the mobile robot to approach the goal, without any collision with obstacles around. The effectiveness of the this method of real-time navigation of a mobile robot is estimated by computer simulation in complex environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.5
• /
• pp.593-599
• /
• 1999

A mobile robot in FMS environment should be able to nevigate itself. Therefore, path planning is necessary for the mobile robot to perform its tasks without being lost. Path planning using a network model gives oprimal paths to every pair of nodes but building this model demands accurate information of environments. In this paper, a method to build a network model using sonar sensors is presented. The main idea is to build a quad tree model by using sonar sensors and convert the model to a network model for path planning. The new method has been implemented on a mobile robot. Experimental results show that the mobile robot constructs an accurate network model using inaccurate sonar data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.3
• /
• pp.200-208
• /
• 1996

This paper describes the mechanism, guidance, sensor system, and navigation algorithm of METRO, a free ranging mobile robot. METRO is designed for use in structured surroundings or factory environments rather than unstructured natural environments. An overview of the physical configuration of the mobile robot is presented as well as a description of its sensor system, an omnidirectional laser range finder. Except for the global path planning algorithm, a guidance and a navigation algorithm with a local path planning algorithm are used to navigate the mobile robot. In METRO the computer support is divided into a supervisor with image processing and local path planning and a slave with motor control. The free ranging mobile robot is self-controlled and all processing being performed on board.

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.3
• /
• pp.210-217
• /
• 2010

This paper presents integrated path planning and collision avoidance for an omni-directional mobile robot. In this scheme, the autonomous mobile robot finds the shortest path by the descendent gradient of a navigation function to reach a goal. In doing so, the robot based on the proposed approach attempts to overcome some of the typical problems that may pose to the conventional robot navigation. In particular, this paper presents a set of analysis for an omni-directional mobile robot to avoid trapped situations for two representative scenarios: 1) Ushaped deep narrow obstacle and 2) narrow passage problem between two obstacles. The proposed navigation scheme eliminates the nonfeasible area for the two cases by the help of the descendent gradient of the navigation function and the characteristics of an omni-directional mobile robot. The simulation results show that the proposed navigation scheme can effectively construct a path-planning system in the capability of reaching a goal and avoiding obstacles despite possible trapped situations under uncertain world knowledge.

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

Genetic algorithm(GA) is useful to find optimal solution without any special mathematical modeling. This study presents to search optimal path of Autonomous Mobile Robot(AMR) by using GA without encoding and decoding procedure. Therefore, this paper shows that the proposed algorithm using GA can reduce the computation time to search the optimal path.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.168-173
• /
• 2003

In this paper, we will present a deeper look on optimal design methods that are related to path-planning for a mobile robot. To control the motion of a mobile robot in a clustered environment, it's necessary to know a suitable trajectory assuming certain start and goal point. Up to now, there are many literatures that concern optimal path planning for an obstacle avoided mobile robot. Among those literatures, we have chosen 2 novel methods for our further analysis. The first approach [4] is based on HJB(Hamilton-Jacobi-Bellman) equation whose solution is the return-function that helps to generate a shortest path to the goal. The later [5] is called polynomial-path-planning approach, in this method, a shortest polynomial-shape path would become a solution if it was a collision-free path. The camera network plays the role as sensors to generate updated map which locates the static and dynamic objects in the space. Therefore, the exhibition of both path planning and dynamic obstacle avoidance by the updated map would be accomplished simultaneously. As we mentioned before, our research will include the motion control of a true mobile robot on those optimal planned paths which were generated by above algorithms. Base on the kinematic and dynamic simulation results, we can realize the affection of moving speed to the stable of motion on each generated path. Also, we can verify the time-optimal trajectory through velocity tuning. To simplify for our analysis, we assumed the obstacles are cylindrical circular objects with the same size.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.4
• /
• pp.803-808
• /
• 2010

We propose a smooth path planning method for autonomous mobile robots. Due to nonholonomic constraints by obstacle avoidance, the smooth path planning is a complicated one. We generate smooth path that is considered orientation of robot under nonholonomic constraints. The proposed smooth planning method consists of two steps. Firstly, the initial path composed of straight lines is obtained from V-graph by Dijkstra's algorithm. Then the initial path is transformed by changing the curve. We apply the cardinal spline into the stage of curve generation. Simulation results show a performance of proposed smooth path planning method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.563-568
• /
• 2007

This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.556-559
• /
• 1997

In this paper, we propose a cooperative multi-robot control algorithm. Specifically, the cooperative task is that two mobile robots should transfer a long rigid object along a predefined path. To resolve the problem, we introduce the master-slave concept for two mobile robots, which have the same structure. According to the velocity of the master robot and the positions of two robots on the path, the velocity of the slave robot is determined. In case that the robots can't move further, the role of the robot is interchanged. The effectiveness of this decentralized algorithm is proved by computer simulations.