A local path planning algorithm based on improved dynamic window approach

Author:

Xu Wan1,Zhang Yuhao1,Yu Leitao1,Zhang Tingting2,Cheng Zhao1

Affiliation:

1. School of Mechanical Engineering, Hubei University of Technology, Wuhan, China

2. Hubei University of Technology Engineering and Technology College, Wuhan, China

Abstract

In order to solve the problem that the traditional DWA algorithm cannot have both safety and speed because of the fixed parameters in the complex environment with many obstacles, a parameter adaptive DWA algorithm (PA-DWA) is proposed to improve the robot running speed on the premise of ensuring safety. Firstly, the velocity sampling space is optimized by the current pose of the mobile robot, and a criterion of environment complexity is proposed. Secondly, a parameter-adaptive method is presented to optimize the trajectory evaluation function. When the environment complexity is greater than a certain threshold, the minimum distance between the mobile robot and the obstacle is taken as the input, and the weight of the velocity parameter is adjusted according to the real-time obstacle information dynamically. The current velocity of the mobile robot is used as input to dynamically adjust the weight of the direction angle parameter. In the Matlab simulation, the total time consumption of PA-DWA is reduced by 47.08% in the static obstacle environment and 39.09% in the dynamic obstacle environment. In Gazebo physical simulation experiment, the total time of PA-DWA was reduced by 26.63% in the case of dynamic obstacles. The experimental results show that PA-DWA can significantly reduce the total time of the robot under the premise of ensuring safety.

Publisher

IOS Press

Subject

Artificial Intelligence,General Engineering,Statistics and Probability

Reference45 articles.

1. Attoyibi M.M. , Fikrisa F.E. and Handayani A.N. , The implementation of a star algorithm (A*) in the game education about numbers introduction. Proceedings of the 2nd International Conference on Vocational Education and Training (ICOVET 2018) (2019), 234–238.

2. Fusion of probabilistic A algorithm and fuzzy inference system for robotic path planning;Kala;Artificial Intelligence Review,2010

3. Santoso L.W. , Setiawan A. and Prajogo A.K. , Performance Analysis of Dijkstra, A* and Ant Algorithm for Finding Optimal Path Case Study: Surabaya City Map. Doctoral dissertation. Petra Christian University, (2010).

4. A suboptimal path planning algorithm using rapidly-exploring random trees;Kothari;International Journal of Aerospace Innovations,2010

5. Follow the gap with dynamic windowapproach;Özdemir;International Journal of Semantic Computing,2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3