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 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.
Copyright: Open Access authors retain the copyrights of their papers, and all open access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided that the original work is properly cited. The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations. While the advice and information in this journal are believed to be true and accurate on the date of its going to press, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.