Obstacle Avoidance for Groups of Mobile Robots Using Potential Field Technique

Author(s):  
F. Fahimi ◽  
C. Nataraj ◽  
H. Ashrafiuon

An efficient real time path planning method for groups of mobile robots in dynamic environments is introduced. Harmonic potential functions are utilized along with the panel method known in fluid mechanics. First, a complement to the traditional panel method is introduced to generate a more effective harmonic potential field for obstacle avoidance in dynamically changing environments. Second, a group of mobile robots working in an environment containing stationary and moving obstacles is considered. Each robot is assigned to move from its current position to a goal position. The group is not forced to maintain a formation during the motion. Every robot considers the other robots of the group as moving obstacles and hence the physical dimensions of the robots are also taken into account. The path of each robot is planned based on the changing position of the other robots and the position of stationary and moving obstacles. Finally, the effectiveness of the scheme is shown by modeling groups of an arbitrary number of mobile robots and the theory is validated by several computer simulations and hardware experiments.

Robotica ◽  
2009 ◽  
Vol 27 (2) ◽  
pp. 189-198 ◽  
Author(s):  
Farbod Fahimi ◽  
C. Nataraj ◽  
Hashem Ashrafiuon

SUMMARYAn efficient, simple, and practical real time path planning method for multiple mobile robots in dynamic environments is introduced. Harmonic potential functions are utilized along with the panel method known in fluid mechanics. First, a complement to the traditional panel method is introduced to generate a more effective harmonic potential field for obstacle avoidance in dynamically changing environments. Second, a group of mobile robots working in an environment containing stationary and moving obstacles is considered. Each robot is assigned to move from its current position to a goal position. The group is not forced to maintain a formation during the motion. Every robot considers the other robots of the group as moving obstacles and hence the physical dimensions of the robots are also taken into account. The path of each robot is planned based on the changing position of the other robots and the position of stationary and moving obstacles. Finally, the effectiveness of the scheme is shown by modeling an arbitrary number of mobile robots and the theory is validated by several computer simulations and hardware experiments.


2018 ◽  
Vol 30 (3) ◽  
pp. 485-492
Author(s):  
Satoshi Hoshino ◽  
◽  
Tomoki Yoshikawa

Motion planning of mobile robots for occluded obstacles is a challenge in dynamic environments. The occlusion problem states that if an obstacle suddenly appears from the occluded area, the robot might collide with the obstacle. To overcome this, we propose a novel motion planner, the Velocity Obstacle for occlusion (VOO). The VOO is based on a previous motion planner, the Velocity Obstacle (VO), which is effective for moving obstacles. In the proposed motion planner, information uncertainties about occluded obstacles, such as position, velocity, and moving direction, are quantitatively addressed. Thus, the robot based on the VOO is able to move not only among observed obstacles, but also among the occluded ones. Through simulation experiments, the effectiveness of the VOO for the occlusion problem is demonstrated by comparison with the VO.


Sign in / Sign up

Export Citation Format

Share Document