A hybrid enhanced A* and DWA approach for dynamic path planning of manufacturing logistics robots
DOI:
https://doi.org/10.4108/eetsis.14220Keywords:
manufacturing logistics robots, enhanced A* algorithm, DWA algorithm, Path planningAbstract
Smart manufacturing and logistics robots require integrated navigation capabilities. Optimized global routing, fast obstacle avoidance, and stable trajectory generation are all necessary. In this paper, we develop a hybrid path planner. An enhanced A* algorithm is combined with the Dynamic Window Approach (DWA). We intend to satisfy such practical demands. Four key aspects are addressed to optimize the conventional A* algorithm. Evaluation function optimization, neighborhood search optimization, Floyd based path smoothing, and segmented path processing. Path smoothing is also enhanced. These modifications cut computational costs. Invalid node expansion is reduced. Sudden steering changes are mitigated as well. Comparative simulations on two test maps were carried out. The superiority of our improved method was validated. The results show that path turns drop by 33.3% and 37.5%, respectively. Search time is reduced by 22.2% and 31.3%, respectively. Unlike pure static planning strategies, the hybrid framework delivers faster system response. Improved real-time obstacle avoidance capability is also achieved. Consequently, it fits well with practical industrial scenarios. Automated material handling and intelligent warehouse logistics in smart factories are covered.
References
[1] Chang L, Shan L, Li J, et al. Sliding Mode Control of TShaped Pedestrian Channel. Journal of Shanghai Jiaotong University (Science), 2020, 25(4): 478-485.
[2] Kumar S, Sikander A. An Effective Mobile Robot Path Planner by Optimizing Multiple Performance Parameters Inspired by Sparrow’s Anti-predation Exploration Ability. Soft Computing, 2025, 29(11-12): 1-18.
[3] Tang Y C, Qi S J, Zhu L X, et al. Obstacle Avoidance Motion in Mobile Robotics. Journal of System Simulation, 2024, 36(1): 1-26.
[4] Miyombo E M, Liu K Y, Mulenga M C, et al. Optimal Path Planning in a Real-world Radioactive Environment: A Comparative Study of A-star and Dijkstra Algorithms. Nuclear Engineering and Design, 2024, 420: 113039.
[5] Ogata K. A Generic Approach on How to Formally Specify and Model Check Path Finding Algorithms: Dijkstra, A* and LPA*. International Journal of Software Engineering and Knowledge Engineering, 2020, 30(10): 1481-1523.
[6] Gu C C, Liu S Y, Li H S, et al. Research on Hybrid Path Planning of Underground Degraded Environment Inspection Robot Based on enhanced A* Algorithm and DWA Algorithm. Robotica, 2025, 43(3): 887-908.
[7] Bao H F, Fang J, Zhang J S, et al. Optimization on Cold Chain Distribution Routes Considering Carbon Emissions Based on Improved Ant Colony Algorithm. Journal of System Simulation, 2024, 36(1): 183-194.
[8] Cui X N, Wang C Q, Xiong Y, et al. More Quickly-RRT*: Improved Quick Rapidly-exploring Random Tree Star Algorithm Based on Optimized Sampling Point with Better Initial Solution and Convergence Rate. Engineering Applications of Artificial Intelligence, 2024, 133: 108246.
[9] Yu Y F, Wang Z W, Chen X J, et al. Particle Swarm Optimization Algorithm Based on Teaming Behavior. Knowledge-Based Systems, 2025, 318: 113555.
[10] Zeng X Y, Zhang J W, Yin W H, et al. Path Planning Strategies for Logistics Robots: Integrating Enhanced Astar Algorithm and DWA. Electronics Letters, 2024, 60(22): e70090.
[11] Yan W G, Wu X, Liang G H. Optimization of Multivehicle Obstacle Avoidance Based on Improved Artificial Potential Field Method with PID Control. Frontiers in Energy Research, 2024, 12: 1363293.
[12] Niu Q Y, Fu Y, Dong X W. Omnidirectional AGV Path Planning Based on Improved Genetic Algorithm. World Electric Vehicle Journal, 2024, 15(4): 166.
[13] Xu H M, Yu G H, Wang Y M, et al. Path Planning of Mecanum Wheel Chassis Based on enhanced A* Algorithm. Electronics, 2023, 12(8): 1754.
[14] Min H T, Xiong X Y, Wang P Y, et al. Autonomous Driving Path Planning Algorithm Based on enhanced A* Algorithm in Unstructured Environment. Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering, 2021, 235(2-3): 513- 526.
[15] Baik S, Bong J H, Jeong S. Weight-incorporating A* Algorithm with Multi-factor Cost Function for Enhanced Mobile Robot Path Planning. Actuators, 2025, 14(8): 369.
[16] Yi H, Lin R L, Wang H, et al. Dynamic Obstacle Avoidance with Enhanced Social Force Model and DWA Algorithm Using SparkLink. Sensors, 2025, 25(4): 992.
[17] Li S Y, Huang J W, Mao W P, et al. TOACA-DWA: A Path Planning Algorithm for Mobile Robot in Dynamic Environments. Journal of Intelligent & Fuzzy Systems, 2025, 48(3): 245-261
[18] Zhang J L, Su L B, Bai Z H, et al. Research on Path Planning and Trajectory Tracking for Inspection Robots in Orchard Environments. Agriculture, 2026, 16(4): 415.
[19] Zhang W, Li W L, Zheng X, et al. enhanced A* and DWA Fusion Algorithm Based Path Planning for Intelligent Substation Inspection Robot. Measurement and Control, 2026, 59(1): 113-119.
[20] Dechter, Rina, and Judea Pearl. "Generalized best-first search strategies and the optimality of A." Journal of the ACM (JACM)32. 3 (1985): 505-536.
[21] Chiu, Wei-Yu, Gary G. Yen, and Teng-Kuei Juan. "Minimum manhattan distance approach to multiple criteria decision making in multiobjective optimization problems. "IEEE Transactions on Evolutionary Computation20.6 (2016): 972-985.
[22] Dokmanic, Ivan, et al. "Euclidean distance matrices: essential theory, algorithms, and applications. "IEEE Signal Processing Magazine32.6 (2015): 12-30.
[23] Klove, Torleiv, et al. "Permutation arrays under the Chebyshev distance. "IEEE Transactions on Information Theory 56.6 (2010): 2611-2617.
[24] Nguyen Kieu Linh. A dataset of orthogonal polygon-derived maze environments for path planning benchmarking. Data in Brief, 2026, 66: 112841.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Xiaoming Zhang
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.
