An improved fuzzy-controlled local path planning algorithm based on dynamic window approach

被引:2
作者
Liu, Aizun [1 ]
Liu, Chong [2 ]
Li, Lei [2 ]
Wang, Ruchao [2 ]
Lu, Zhiguo [2 ]
机构
[1] Aerosp Era Feihong Technol Co Ltd, Beijing 100094, Peoples R China
[2] Northeastern Univ, Sch Mech Engn & Automat, Shenyang, Peoples R China
关键词
DWA algorithm; dynamic obstacle avoidance; fuzzy control; local optimal; local path planning; mobile robot; trajectory similarity; NAVIGATION;
D O I
10.1002/rob.22419
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
With the increasingly complex operating environment of mobile robots, the intelligent requirements of robots are getting higher and higher. Navigation technology is the core of mobile robot intelligent technology research, and path planning is an important function of mobile robot navigation. Dynamic window approach (DWA) is one of the most popular local path planning algorithms nowadays. However, there are also some problems. DWA algorithm is easy to fall into local optimal solution without the guidance of global path. The traditional solution is to use the key nodes of the global path as the temporary target points. However, the guiding ability of the temporary target points will be weakened in some cases, which still leads DWA to fall into local optimal solutions such as being trapped by a "C"-shaped obstacle or go around outside of a dense obstacle area. In a complex operating environment, if the local path deviates too far from the global path, serious consequences may be caused. Therefore, we proposed a trajectory similarity evaluation function based on dynamic time warping method to provide better guidance. The other problem is poor adaptability to complex environments due to fixed evaluation function weights. And, we designed a fuzzy controller to improve the adaptability of the DWA algorithm in complex environments. Experiment results show that the trajectory similarity evaluation function reduces algorithm execution time by 0.7% and mileage by 2.1%, the fuzzy controller reduces algorithm execution time by 10.8% and improves the average distance between the mobile robot and obstacles at the global path's danger points by 50%, and in simulated complex terrain environment, the finishing rate of experiments improves by 25%.
引用
收藏
页码:430 / 454
页数:25
相关论文
共 39 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]   Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm [J].
Ajeil, Fatin H. ;
Ibraheem, Ibraheem Kasim ;
Sahib, Mouayad A. ;
Humaidi, Amjad J. .
APPLIED SOFT COMPUTING, 2020, 89
[3]   Grid-Based Mobile Robot Path Planning Using Aging-Based Ant Colony Optimization Algorithm in Static and Dynamic Environments [J].
Ajeil, Fatin Hassan ;
Ibraheem, Ibraheem Kasim ;
Azar, Ahmad Taher ;
Humaidi, Amjad J. .
SENSORS, 2020, 20 (07)
[4]   Path Planning of Mobile Robot With Improved Ant Colony Algorithm and MDP to Produce Smooth Trajectory in Grid-Based Environment [J].
Ali, Hub ;
Gong, Dawei ;
Wang, Meng ;
Dai, Xiaolin .
FRONTIERS IN NEUROROBOTICS, 2020, 14
[5]  
[Anonymous], 2008, Springer handbook of robotics, DOI DOI 10.1007/978-3-540-30301-518
[6]  
Maróti A, 2013, IEEE 11TH INTERNATIONAL SYMPOSIUM ON APPLIED MACHINE INTELLIGENCE AND INFORMATICS (SAMI 2013), P95, DOI 10.1109/SAMI.2013.6480952
[7]   UAV Path Planning Based on Improved A* and DWA Algorithms [J].
Bai, Xiong ;
Jiang, Haikun ;
Cui, Junjie ;
Lu, Kuan ;
Chen, Pengyun ;
Zhang, Ming .
INTERNATIONAL JOURNAL OF AEROSPACE ENGINEERING, 2021, 2021
[8]   Managing Massive Trajectories on the Cloud [J].
Bao, Jie ;
Li, Ruiyuan ;
Yi, Xiuwen ;
Zheng, Yu .
24TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2016), 2016,
[9]  
Cai Jia Cheng, 2022, 2022 2nd International Conference on Computer, Control and Robotics (ICCCR)., P20, DOI 10.1109/ICCCR54399.2022.9790216
[10]   Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots [J].
Castillo, Oscar ;
Trujillo, Leonardo ;
Melin, Patricia .
SOFT COMPUTING, 2007, 11 (03) :269-279