Fusion of DWA algorithm and improved Bi RRT obstacle avoidance path planning method in dynamic obstacle environments
Open Computer Science · 23.01.2026 · 16 (1)
DOI: 10.1515/comp-2025-0057 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Computer Science, online erschienen am 07.07.2026. Verfasst von Yange Li. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Aiming at the problem that path planning in dynamic obstacle environments is difficult to balance global optimality and local real-time performance, a collision avoidance path planning method is proposed by integrating improved bidirectional fast expanding random tree (Bi RRT) and dynamic window method (DWA). This method is divided into two stages: dynamic obstacle space reconstruction and algorithm fusion. Firstly, in the spatial reconstruction stage, static and dynamic obstacle information is collected to construct obstacle reconstruction reference points, and configuration functions are used to reconstruct the obstacle information points, achieving accurate modeling of dynamic obstacle environments. Secondly, in the algorithm fusion stage, the improved Bi RRT algorithm introduces greedy expansion and bidirectional adaptive strategies, combined with the cost evaluation mechanism of the A* algorithm, to improve the efficiency and goal orientation of global path search; Improve the DWA algorithm to optimize the evaluation function, set up a threat space to screen obstacles and enhance target navigation capabilities, and improve the real-time and accuracy of local obstacle avoidance. The fusion of the two forms a path planning mechanism that combines global path guidance and local dynamic obstacle avoidance for collaborative optimization. The experimental results show that this method can effectively avoid local optima and collision problems in complex dynamic environments, and the reconstruction position and width are dynamically adjusted with the movement of obstacles. The shortest running time can reach 0.247 s, significantly improving real-time performance and adaptability of path planning.
Zitieren
APA
Li, Y. (2026). Fusion of DWA algorithm and improved Bi RRT obstacle avoidance path planning method in dynamic obstacle environments. Open Computer Science, 16(1). https://doi.org/10.1515/comp-2025-0057
Vancouver
Li Y. Fusion of DWA algorithm and improved Bi RRT obstacle avoidance path planning method in dynamic obstacle environments. Open Computer Science. 2026;16(1). doi:10.1515/comp-2025-0057
BibTeX
@article{Li2026,
author = {Li, Yange},
title = {Fusion of DWA algorithm and improved Bi RRT obstacle avoidance path planning method in dynamic obstacle environments},
journal = {Open Computer Science},
year = {2026},
volume = {16},
number = {1},
doi = {10.1515/comp-2025-0057}
}
EUVIMED