Obstacles Avoidance for Mobile Robot Using Enhanced Artificial Potential Field

In this paper, an enhanced artificial potential field (EAPF) planner is introduced. This planner is proposed to rapidly find online solutions for the mobile robot path planning problems, when the underlying environment contains obstacles with unknown locations and sizes. The classical artificial pot...

Full description

Saved in:
Bibliographic Details
Main Authors: Mustaffa Waad Abbas, Mohamed Jasim Mohamed
Format: article
Language:EN
Published: Al-Khwarizmi College of Engineering – University of Baghdad 2013
Subjects:
Online Access:https://doaj.org/article/e1d20e303f9043a2ba32efaa8698fcdb
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, an enhanced artificial potential field (EAPF) planner is introduced. This planner is proposed to rapidly find online solutions for the mobile robot path planning problems, when the underlying environment contains obstacles with unknown locations and sizes. The classical artificial potential field represents both the repulsive force due to the detected obstacle and the attractive force due to the target. These forces can be considered as the primary directional indicator for the mobile robot. However, the classical artificial potential field has many drawbacks. So, we suggest two secondary forces which are called the midpoint repulsive force and the off-sensors attractive force. These secondary forces and modified primary forces are merged to overcomethe drawbacks like dead ends and U shape traps. The proposed algorithm acquirs information of unknown environment by collecting the readings of five infrared sensors with detecting range of 0.8 m. The proposed algorithm is applied on two different environments also it is compared with another algorithm. The simulation and experimental results confirm that the proposed algorithm always converges to the desired target. In addition, the performance of algorithm is well and meets the requirements in terms of saved time and computational resources.