{"id":7410,"date":"2026-06-01T09:48:10","date_gmt":"2026-06-01T01:48:10","guid":{"rendered":"\/jase\/?post_type=tkuisotope&p=7410"},"modified":"2026-06-01T12:29:15","modified_gmt":"2026-06-01T04:29:15","slug":"jase-202609-32-061","status":"publish","type":"tkuisotope","link":"\/jase\/?tkuisotope=jase-202609-32-061","title":{"rendered":"Robot Dynamic Environment Path Planning Based on Kalman-filter-based Prediction and Complexity-Adaptive Collaboration"},"content":{"rendered":"\n
\n
\n

<\/i> 2026<\/a><\/p>\n<\/div>\n\n\n\n

\n

<\/i> Volume 32<\/a><\/p>\n<\/div>\n\n\n\n

\n
\n
\n
\n

Ruiyang Wang and Qi Yang<\/i><\/a><\/p>\n\n\n\n

School of Mechanical Engineering, Shenyang Ligong University, Shenyang, Liaoning, China<\/p>\n<\/div>\n\n\n\n

\n

Received: April 23, 2026
Accepted: May 16, 2026
Publication Date: June 1, 2026<\/p>\n<\/div>\n<\/div>\n\n\n\n

\"\u4e0a\u50b3\u5716\u7247\"\n\n\n

Overall framework of the PADP method <\/p>\n<\/div>\n<\/div>\n\n\n\n

<\/i> Copyright <\/strong>The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0)<\/a>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.<\/p>\n\n\n\n

Download Citation:\u00a0 BibTeX <\/a>| http:\/\/dx.doi.org\/10.6180\/jase.202609_32.061<\/a>\u00a0\u00a0<\/p>\n\n\n\n

Download PDF<\/a><\/p>\n\n\n\n

<\/div>\n\n\n\n

To tackle the critical challenges confronted by mobile robots in dynamic environments, such as the demand for short replanning time, high computational complexity, and unreliable planning results arising from environmental uncertainty, the majority of existing methods merely implement local obstacle avoidance in the post-processing phase, which leads to limited improvements in global path optimization. Moreover, the fixed coordination mechanism between global and local planning is difficult to adapt to varying scenario pressures. To this end, this paper proposes a planning method with a predictive dynamic cost field and a complexity-adaptive coordination mechanism (PADP), which employs Kalman-filter-based prediction to construct a direction-aware dynamic cost field and integrates it into global path generation. An online complexity indicator composed
of obstacle density and other metrics is designed to dynamically adjust planning weights. Meanwhile, a lightweight residual correction module is introduced to reduce multi-step prediction errors while retaining the core Kalman filtering framework. Experimental results based on MATLAB grid simulations demonstrate that PADP achieves an overall success rate of 80.56% and has the minimum average collision count among all comparison methods in 36 dynamic scenarios. The hybrid PADP-KFRes reduces the prediction RMSE from 1.053 to 0.457.<\/p>\n\n\n\n

Keywords: Mobile robot; Kalman filter; Dynamic path planning; Adaptive coordination mechanism<\/em><\/p>\n\n\n\n

<\/div>\n\n\n\n
\n
\n
\n
\n
\n
    \n
  1. [1] G. Fragapane, R. de Koster, F. Sgarbossa, et al., (2021) \u201cPlanning and control of autonomous mobile robots for intralogistics: Literature review and research agenda\u201d European Journal of Operational Research 294(2): 405\u2013426. DOI: 10.1016\/j.ejor.2021.01.019.<\/li>\n
  2. [2] M. Aizat, A. Azmin, and W. Rahiman, (2023) \u201cA survey on navigation approaches for automated guided vehicle robots in dynamic surrounding\u201d IEEE Access 11: 33934\u201333955. DOI: 10.1109\/ACCESS.2023.3263734.<\/li>\n
  3. [3] R. Moller, A. Furnari, S. Battiato, et al., (2021) \u201cA survey on human-aware robot navigation\u201d Robotics and Autonomous Systems 145: 103837. DOI: 10.1016\/j.robot.2021.103837.<\/li>\n
  4. [4] C. Mavrogiannis, F. Baldini, A. Wang, et al., (2023) \u201cCore challenges of social robot navigation: A survey\u201d ACM Transactions on Human-Robot Interaction 12(3): 1\u201339. DOI: 10.1145\/3583741.<\/li>\n
  5. [5] X. Deng, R. Li, L. Zhao, et al., (2021) \u201cMulti-obstacle path planning and optimization for mobile robot\u201d Expert Systems with Applications 183: 115445. DOI: 10.1016\/j.eswa.2021.115445.<\/li>\n
  6. [6] K. Katona, H. Neamah, and P. Korondi, (2024) \u201cObstacle avoidance and path planning methods for autonomous navigation of mobile robot\u201d Sensors 24(11): 3573. DOI: 10.3390\/s24113573.<\/li>\n
  7. [7] Y. Li, R. Jin, X. Xu, et al., (2022) \u201cA mobile robot path planning algorithm based on improved A* algorithm and dynamic window approach\u201d IEEE Access 10: 57736\u201357747. DOI: 10.1109\/ACCESS.2022.3179397.<\/li>\n
  8. [8] M. Kobayashi, H. Zushi, T. Nakamura, et al., (2023) \u201cLocal path planning: Dynamic window approach with Q-learning considering congestion environments for mobile robot\u201d IEEE Access 11: 96733\u201396742. DOI: 10.1109\/ACCESS.2023.3311023.<\/li>\n
  9. [9] Y. Sun, W. Wang, M. Xu, et al., (2023) \u201cLocal path planning for mobile robots based on fuzzy dynamic window algorithm\u201d Sensors 23(19): 8260. DOI: 10.3390\/s23198260.<\/li>\n
  10. [10] L. Xiang, X. Li, H. Liu, et al., (2022) \u201cParameter fuzzy self-adaptive dynamic window approach for local path planning of wheeled robot\u201d IEEE Open Journal of Intelligent Transportation Systems 3: 1\u20136. DOI: 10.1109\/OJITS.2021.3137931.<\/li>\n
  11. [11] M. Shoeib, J. Lewandowski, and A. Omara, (2024) \u201cA novel methodology for vision-based path planning and obstacle avoidance in mobile robot applications\u201d Advanced Robotics 38(12): 802\u2013817. DOI: 10.1080\/01691864.2024.2315591.<\/li>\n
  12. [12] K. Zheng, (2024) \u201cAutonomous obstacle avoidance and trajectory planning for mobile robot based on dual-loop trajectory tracking control and improved artificial potential field method\u201d Actuators 13(1): 37. DOI: 10.3390\/act13010037.<\/li>\n
  13. [13] S. Shao, J. Zhang, T. Wang, et al., (2024) \u201cDynamic obstacle-avoidance algorithm for multi-robot flocking based on improved artificial potential field\u201d IEEE Transactions on Consumer Electronics 70(1): 4388\u20134399. DOI: 10.1109\/TCE.2023.3340327.<\/li>\n
  14. [14] C. Gong, Y. Yang, L. Yuan, et al., (2022) \u201cAn improved ant colony algorithm for integrating global path planning and local obstacle avoidance for mobile robot in dynamic environment\u201d Mathematical Biosciences and Engineering 19(12): 12405\u201312426. DOI: 10.3394\/mbe.2022579.<\/li>\n
  15. [15] J. Hou, W. Jiang, Z. Luo, et al., (2024) \u201cDynamic path planning for mobile robots by integrating improved sparrow search algorithm and dynamic window approach\u201d Actuators 13(1): 24. DOI: 10.3390\/act13010024.<\/li>\n
  16. [16] Y. Li, J. Zhao, Z. Chen, et al., (2023) \u201cA robot path planning method based on improved genetic algorithm and improved dynamic window approach\u201d Sustainability 15(5): 4656. DOI: 10.3390\/su15054656.<\/li>\n
  17. [17] W. Chen, L. Liu, L. Zhang, et al., (2025) \u201cPath planning of mobile robots with an improved grey wolf optimizer and dynamic window approach\u201d Applied Sciences 15(7): 3999. DOI: 10.3390\/app15073999.<\/li>\n
  18. [18] M. Pei, H. An, B. Liu, et al., (2022) \u201cAn improved Dyna-Q algorithm for mobile robot path planning in unknown dynamic environment\u201d IEEE Transactions on Systems, Man, and Cybernetics: Systems 52(7): 4415\u20134425. DOI: 10.1109\/TSMC.2021.3096935.<\/li>\n
  19. [19] R. Huang, C. Qin, J. Li, et al., (2023) \u201cPath planning of mobile robot in unknown dynamic continuous environment using reward-modified deep Q-network\u201d Optimal Control Applications and Methods 44(3): 1570\u20131587. DOI: 10.1002\/oca.2781.<\/li>\n
  20. [20] Y. Zhang and P. Chen, (2023) \u201cPath planning of a mobile robot for a dynamic indoor environment based on an SAC-LSTM algorithm\u201d Sensors 23(24): 9802. DOI: 10.3390\/s23249802.<\/li>\n
  21. [21] Y. Chen, Y. Wang, B. Li, et al., (2024) \u201cMulti-robot navigation based on velocity obstacle prediction in dynamic crowded environments\u201d Industrial Robot 51(4): 607\u2013616. DOI: 10.1108\/IR-12-2023-0337.<\/li>\n
  22. [22] H. Wang, L. He, S. Zhang, et al., (2025) \u201cMobile robot path planning considering obstacle gap features\u201d Applied Sciences 15(11): 5979. DOI: 10.3390\/app15115979.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

    <\/p>\n","protected":false},"author":3,"template":"wp-custom-template-detail-4-aricles","meta":{"_uag_custom_page_level_css":""},"categories":[12,720,6],"tags":[1470],"acf":[],"uagb_featured_image_src":[],"uagb_author_info":{"display_name":"\u6797\u923a\u6db5","author_link":"\/jase\/?author=3"},"uagb_comment_info":0,"uagb_excerpt":" Copyright The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited. Download Citation:\u00a0 BibTeX | http:\/\/dx.doi.org\/10.6180\/jase.202609_32.061\u00a0\u00a0 Download PDF To tackle the critical challenges confronted by mobile robots in dynamic…","_links":{"self":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope\/7410"}],"collection":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope"}],"about":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/types\/tkuisotope"}],"author":[{"embeddable":true,"href":"\/jase\/index.php?rest_route=\/wp\/v2\/users\/3"}],"wp:attachment":[{"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7410"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7410"},{"taxonomy":"post_tag","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7410"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}