Abstract
In response to challenges faced by mobile robots in global path planning within high-resolution grid maps—such as excessive waypoints, low efficiency, inability to evade random obstacles, and poor maneuverability in narrow passage environments during local path planning—a robot path planning algorithm is proposed. This algorithm integrates state-based decision-making A* algorithm with inertial dynamic window approach. Firstly, the exploration method of the A* algorithm is enhanced to dynamically adapt to the current state of the mobile robot, reducing the number of exploration nodes to improve exploration efficiency. Redundant turning points are eliminated from the original planned path to optimize the global path. Next, a path deviation evaluation function is incorporated into the speed space evaluation function of the dynamic window approach. This function adds weight to forward movement along the original direction, enhancing the robot’s ability to navigate through narrow environments. Finally, key points of the global path are used as sub-goals for local path planning, achieving a fusion of approaches. This enables the robot to simultaneously determine the optimal global path and perform random obstacle avoidance. Experimental verification demonstrates that deploying this integrated algorithm enhances exploration efficiency, reduces path turning points, achieves random obstacle avoidance, and excels in narrow passage environments for mobile robots.












Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Sánchez-Ibáñez JR, Pérez-Del-Pulgar CJ, Serón J et al (2023) Optimal path planning using a continuous anisotropic model for navigation on irregular terrains. Intel Serv Robot 16(1):19–32
Quigley M, Conley K, Gerkey B, et al. (2009) Ros: an open-source robot operating system. ICRA Workshop on Open Source Software, 3(3.2): 5
Hertzberg J S, Pütz J, Simón S (2018) Move base flex: a highly flexible navigation framework for mobile robots. IROS
Maekawa T, Noda T, Tamura S et al (2010) Curvature continuous path generation for autonomous vehicle using b-spline curves. Comput Aided Des 42(4):350–359
Ellekilde LP, Petersen HG (2013) Motion planning efficient trajectories for industrial bin-picking. Int J Robot Res 32:991–1004
Jan GE, Sun CC, Tsai WC et al (2013) An o(nlogn) shortest path algorithm based on delaunay triangulation. IEEE/ASME Trans Mechatron. https://doi.org/10.1109/TMECH.2013.2252076
Elbanhawi M, Simic M, Jazar R (2013) Autonomous mobile robot path planning: A novel roadmap approach. Appl Mech Mater. https://doi.org/10.4028/www.scientific.net/AMM.373-375.246
Martınez-Alfaro H, Gomez-Garcıa S (1998) Mobile robot path planning and tracking using simulated annealing and fuzzy logic control. Expert Syst Appl 15:421–429
Seraji H, Howard A (2002) Behavior-based robot navigation on challenging terrain: a fuzzy logic approach. IEEE Trans Robot Autom 18(3):308–321
Karaman S, Walter MR, Perez A et al (2011) Anytime motion planning using the RRT. In: IEEE international conference on robotics and automation, vol. 2011, pp. 1478–1483
Pivtoraiko M, Knepper RA, Kelly A (2009) Differentially constrained mobile robot motion planning in state lattices. J Field Robot 26(3):308–333
Kumar S, Sikander A (2023) A modified probabilistic roadmap algorithm for efficient mobile robot path planning. Eng Optim 55(9):1616–1634
Janglova D (2004) Neural networks in mobile robot motion. Int J Adv Rob Syst 1(1):15–22
Gerke M (1999) Genetic path planning for mobile robots. In: Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251), vol. 4, pp. 2424–2429
Hu Y, Yang S X, Xu L Z, et al. (2004) A knowledge based genetic algorithm for path planning in unstructured mobile robot environments. In: 2004 IEEE international conference on robotics and biomimetics, 18(3): 767–772
Garcia MAP, Montiel O, Castillo O et al (2009) Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation. Appl Soft Comput 9(3):1102–1110
Maekawa T, Noda T, Tamura S et al (2010) Curvature continuous path generation for autonomous vehicle using bspline curves. Comput Aided Des 42(4):350–359
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107
Singh Y, Sharma S, Sutton R et al (2018) A constrained a* approach towards optimal path planning for an unmanned surface vehicle in a maritime environment containing dynamic obstacles and ocean currents. Ocean Eng 169:187–201
Yang JM, Tseng CM, Tseng PS (2015) Path planning on satellite images for unmanned surface vehicles. Int J Nav Archit Ocean Eng 7(1):87–99
Sun G, Wu JJ, Chen HH (2022) An implicit preference multi-objective evolutionary algorithm based on Chebyshev distance. Comput Sci 49(6):297–304
Sun Y, Zhao X, Yu Y (2022) Research on a random route-planning method based on the fusion of the A* algorithm and dynamic window method. Electronics 11(17):2683
Min H, Xiong X, Wang P et al (2021) Autonomous driving path planning algorithm based on improved a* algorithm in unstructured environment. Proc Inst Mech Eng Part D J Automob Eng 235(2–3):513–526
Zhong X, Tian J, Hu H et al (2020) Hybrid path planning based on safe a* algorithm and adaptive window approach for mobile robot in large-scale dynamic environment. J Intell Robot Syst 99(1):65–77
Fu B, Chen L, Zhou Y et al (2018) An improved a* algorithm for the industrial robot path planning with high success rate and short length. Robot Auton Syst 106:26-37
Fox D, Burgard W, Thrun S (1997) The dynamic window approach to collision avoidance. IEEE Robot Autom Mag 4(1):23–33
Chang L, Shan L, Jiang C et al (2021) Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment. Auton Robot 45:51–76
Fu Q, Wang S, Zhang H, et al. (2022) Improved local path planning for mobile robot using modified dynamic window approach. IN: IECON 2022-48th annual conference of the IEEE industrial electronics society, 1–6
Zhu Z, Xie J, Wang Z (2019) Global dynamic path planning based on fusion of a* algorithm and dynamic window approach. Chin Autom Congr (CAC) 2019:5572–5576
Liu L, Lin J, Yao J et al (2021) Path planning for smart car based on Dijkstra algorithm and dynamic window approach. Wirel Commun Mob Comput. https://doi.org/10.1155/2021/8881684
Funding
The work in this article has been supported by the National Natural Science Foundation of China (Project Number: 52172371) and the Natural Science Foundation of Shanghai (Project Number: 21ZR1425800).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Xing, S., Fan, P., Ma, X. et al. Research on robot path planning by integrating state-based decision-making A* algorithm and inertial dynamic window approach. Intel Serv Robotics 17, 901–914 (2024). https://doi.org/10.1007/s11370-024-00547-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11370-024-00547-0