Research on autonomous navigation of mobile robots based on IA-DWA algorithm

Abstract To improve the efficiency of mobile robot movement, this paper investigates the fusion of the A* algorithm with the Dynamic Window Approach (DWA) algorithm (IA-DWA) to quickly search for globally optimal collision-free paths and avoid unknown obstacles in time. First, the data from the odom...

Full description

Saved in:
Bibliographic Details
Main Authors: Quanling He, Zongyan Wang, Kun Li, Yuting Zhang, Menglong Li
Format: Article
Language:English
Published: Nature Portfolio 2025-01-01
Series:Scientific Reports
Subjects:
Online Access:https://doi.org/10.1038/s41598-024-84858-3
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Abstract To improve the efficiency of mobile robot movement, this paper investigates the fusion of the A* algorithm with the Dynamic Window Approach (DWA) algorithm (IA-DWA) to quickly search for globally optimal collision-free paths and avoid unknown obstacles in time. First, the data from the odometer and the inertial measurement unit (IMU) are fused using the extended Kalman filter (EKF) to reduce the error caused by wheel slippage on the mobile robot’s positioning and improve the mobile robot’s positioning accuracy. Second, the prediction function, weight coefficients, search neighborhood, and path smoothing processing of the A* algorithm are optimally designed to incorporate the critical point information in the global path into the DWA calculation framework. Then, the length of time and convergence speed of path planning are compared and simulated in raster maps of different complexity. In terms of path planning time, the algorithm reduces by 23.3% compared to A*-DWA; in terms of path length, the algorithm reduces by 1.8% compared to A*-DWA, and the optimization iterations converge faster. Finally, the reliability of the improved algorithm is verified by conducting autonomous navigation experiments using a ROS (Robot Operating System) mobile robot as an experimental platform.
ISSN:2045-2322