Journal of Xidian University ›› 2024, Vol. 51 ›› Issue (2): 84-95.doi: 10.19665/j.issn1001-2400.20230701

• Information and Communications Engineering • Previous Articles     Next Articles

Obstacle avoidance algorithm for the mobile robot with vibration suppression

WU Tingming1,2(), WU Xianyun1,2,3(), DENG Liang4(), LI Yunsong1()   

  1. 1. State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
    2. Guangzhou Institute of Technology,Xidian University,Guangzhou 510555,China
    3. Hangzhou Institute of Technology,Xidian University,Hangzhou 311200,China
    4. Guangzhou Coayu Robot Co.,Ltd,Guangzhou 511495,China
  • Received:2023-02-06 Online:2024-04-20 Published:2023-10-07
  • Contact: WU Xianyun E-mail:tingmwu@stu.xidian.edu.cn;xywu@mail.xidian.edu.cn;liangdeng@ymail.com;ysli@mail.xidian.edu.cn

Abstract:

Aiming at the problem that dynamic obstacle avoidance algorithms for indoor mobile robots are prone to local dead zones,an improved vector field histogram(VFH) dynamic obstacle avoidance algorithm is proposed.First,according to traditional VFH-class algorithms,a path lenght cost and an evaluation index of trough width are introduced to the candidate evaluation function of the trough to reduce the probability of the mobile robot falling into local dead zones and to improve path smoothness.Second,in view of the problem that local obstacle avoidance algorithms are limited to local environment and oscillate back and forth near obstacles easily,an oscillation evaluation function is introduced with an oscillation evaluation curve drawn by calculating the weighted Euclidean distances from the pose of the mobile robot to the starting and ending points.Automatic peak detection and a first-order forward difference curve are employed to obtain the oscillation positions,and then the oscillation suppression is taken to make the mobile robot escape the local dead zones.Simulation results show that within 100 groups of simulation scenarios,the number of scenarios wherein the improved VFH algorithm falls into the local dead zones is reduced by 70 groups,the average number of planning iterations is decreased by 32.3 times,the average path length is reduced by 26.2%,and the average cumulative turning angle is declined by 79.6%.The algorithm can effectively reduce the cost of the local obstacle avoidance,improve the path smoothness and reduce the probability of falling into the dead zones in local special environment.

Key words: obstacle avoidance, VFH, local dead zone, oscillation curve

CLC Number: 

  • TP242.6

Baidu
map