An Improved Path Planning Algorithm With Adaptive Parameters and Predictions

An improved path planning algorithm based on dynamic window approach (DWA) is proposed to optimize real-time paths for agents moving in complex environments with plenty of static and/or dynamic obstacles, path constraints, and performance constraints. In order to improve the accuracy of the evaluati...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE systems journal Ročník 17; číslo 3; s. 1 - 11
Hlavní autori: Fan, Jiazhe, Huang, Na, Huang, Di, Kong, Yaguang, Chen, Zhangping, Zhang, Fan, Zhang, Yao
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Adaptive algorithms
Algorithms
Barriers
Collision avoidance
Dynamic obstacles
dynamic window approach (DWA)
Heuristic algorithms
Low speed
obstacle avoidance
Optimization
Path planning
Prediction algorithms
Run time (computers)
Steering
Trajectory
trap escape
Turning
Vehicle dynamics
ISSN:1932-8184, 1937-9234
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:An improved path planning algorithm based on dynamic window approach (DWA) is proposed to optimize real-time paths for agents moving in complex environments with plenty of static and/or dynamic obstacles, path constraints, and performance constraints. In order to improve the accuracy of the evaluation function and the adaptability of the agents to different obstacle environments, the weight of the evaluation function is ameliorated by designing adaptive laws in this article. Meanwhile, aiming at the defect of local minima in DWA algorithm, a low-speed steering strategy is presented to help the robot escape the U-shaped trap. Especially, in the case of dynamic obstacle environment, a predictive scheme is carried out for the agents to reach the destination safely by fitting the trajectory of the dynamic obstacles to calculate their possible future positions, and then setting these positions as virtual obstacles. By comparison, some simulations and experiments are illustrated to show that the proposed algorithms are superior to the DWA algorithm in terms of running time, path length, and security to a large extent.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2023.3274187