Microrobot Path Planning Based on the Multi-Module DWA Method in Crossing Dense Obstacle Scenario

Abstract

A hard issue in the field of microrobots is path planning in complicated situations with dense obstacle distribution. Although the Dynamic Window Approach (DWA) is a good obstacle avoidance planning algorithm, it struggles to adapt to complex situations and has a low success rate when planning in densely populated obstacle locations. This paper suggests a multi-module enhanced DWA (MEDWA) obstacle avoidance planning algorithm to address the aforementioned issues. An obstacle-dense area judgment approach is initially presented by combining Mahalanobis distance, Frobenius norm, and covariance matrix on the basis of a multi-obstacle coverage model. Second, MEDWA is a hybrid of enhanced DWA (EDWA) algorithms in non-dense areas with a class of two-dimensional analytic vector field methods developed in dense areas. The vector field methods are used instead of the DWA algorithms with poor planning performance in dense areas, which greatly improves the passing ability of microrobots over dense obstacles. The core of EDWA is to extend the new navigation function by modifying the original evaluation function and dynamically adjusting the weights of the trajectory evaluation function in different modules using the improved immune algorithm (IIA), thus improving the adaptability of the algorithm to different scenarios and achieving trajectory optimization. Finally, two scenarios with different obstacle-dense area locations were constructed to test the proposed method 1000 times, and the performance of the algorithm was verified in terms of step number, trajectory length, heading angle deviation, and path deviation. The findings indicate that the method has a smaller planning deviation and that the length of the trajectory and the number of steps can both be reduced by about 15%. This improves the ability of the microrobot to pass through obstacle-dense areas while successfully preventing the phenomenon of microrobots going around or even colliding with obstacles outside of dense areas.

Path-Planning Strategy: Adaptive Ant Colony Optimization Combined with an Enhanced Dynamic Window Approach

“…The DWA is a widely employed local path planning algorithm that samples multiple velocity sets in a vector space comprising velocities and accelerations integrating the constraints of velocity and acceleration; then, it models the trajectories of these velocities over a specified time interval based on the robot's motion model and evaluates the obtained trajectories according to evaluation metrics; then, it uses the corresponding velocities and accelerations as the robot's drive velocity parameters. The core of this algorithm is to transform the path-planning problem into a constrained velocity vector space optimization problem [30,31].…”