{"id":12958,"date":"2026-10-09T14:33:37","date_gmt":"2026-10-09T06:33:37","guid":{"rendered":"\/jase\/?post_type=tkuisotope&#038;p=12958"},"modified":"2026-10-09T21:59:51","modified_gmt":"2026-10-09T13:59:51","slug":"jase-202701-36-018","status":"publish","type":"tkuisotope","link":"\/jase\/?tkuisotope=jase-202701-36-018","title":{"rendered":"SIR-Inspired Risk-Field-Guided Ant Colony Optimization for Static Fixed-Altitude UAV Path Planning"},"content":{"rendered":"\n<div class=\"wp-block-tkuwpbs5-bs5-row row article-info\">\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-3 align-self-start\">\n<p><i class=\"fa fa-folder\" aria-hidden=\"true\"><\/i>&nbsp;<a href=\"\/jase\/?page_id=12663\" data-type=\"page\" data-id=\"12663\">2027<\/a><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-3 align-self-start\">\n<p><i class=\"fa fa-folder-open\" aria-hidden=\"true\"><\/i>&nbsp;<a href=\"\/jase\/?page_id=12665\" data-type=\"page\" data-id=\"12665\">Volume 36<\/a><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-6 align-self-start\">\n<div class=\"wp-block-tkuwpbs5-bs5-div dv_publish\" data-aos=\"normal\"><div class=\"wp-block-post-date\"><time datetime=\"2026-10-09T14:33:37+08:00\">2026-10-09<\/time><\/div><\/div>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-row row\">\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-5 align-self-start\">\n<div class=\"wp-block-tkuwpbs5-bs5-div au-ol\" data-aos=\"normal\">\n<p>Songru Yang, Ruicheng Zhang, Qianda Luo*, and Yuehua Zhao<a href=\"mailto:luoqianda@ncst.edu.cn\"><i class=\"fa fa-envelope\"><\/i><\/a><\/p>\n\n\n\n<p style=\"font-size:14px\">College of Electrical Engineering, North China University of Science and Technology, Tangshan 063210, China<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-div\" style=\"margin-top:var(--wp--preset--spacing--40)\" data-aos=\"normal\">\n<p>Received: July 31, 2026<br>Accepted: September 14, 2026<br>Publication Date: October 09, 2026<\/p>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-7 align-self-start clk=\u5716\u7247\"><img decoding=\"async\" src=\"\/jase\/wp-content\/uploads\/2026\/10\/36_018.jpg\" class=\"img-fluid img-fluid mx-auto d-block\" alt=\"\u4e0a\u50b3\u5716\u7247\">\n\n\n<p class=\"has-text-align-center\">Length\u2013risk trade-off for the cross-algorithm comparison. Points closer to the lower-left region indicate shorter and safer paths <\/p>\n<\/div>\n<\/div>\n\n\n\n<p class=\"has-small-font-size\"><i class=\"fab fa-creative-commons\"><\/i>&nbsp;<strong>Copyright&nbsp;<\/strong>The Author(s). This is an open access article distributed under the terms of the&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\" target=\"_blank\">Creative Commons Attribution&nbsp;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<p>Download Citation:  <a href=\"\/jase\/wp-content\/uploads\/2026\/10\/V36.0018.txt\" data-type=\"attachment\" data-id=\"13041\" target=\"_blank\" rel=\"noreferrer noopener\">BibTeX <\/a>| <a rel=\"noreferrer noopener\" href=\"http:\/\/dx.doi.org\/10.6180\/jase.202701_36.018\" target=\"_blank\">http:\/\/dx.doi.org\/10.6180\/jase.202701_36.018<\/a>  <\/p>\n\n\n\n<p class=\"btn btn-primary article-btn\"><a href=\"\/jase\/wp-content\/uploads\/2026\/10\/018_2026_2120_V36.pdf\" data-type=\"attachment\" data-id=\"12992\" target=\"_blank\" rel=\"noreferrer noopener\">Download PDF<\/a><\/p>\n\n\n\n<div style=\"height:24px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>Collision-free routing is not necessarily safe for unmanned aerial vehicles operating near spatially distributed hazards, because a geometrically short path may accumulate excessive exposure. This paper studies static fixed-altitude UAV path planning in known environments with non-blocking soft risks. An SIR-inspired risk-field-guided ant colony optimization framework, termed SIR-ACO, is proposed. A deterministic influence propagation surrogate based on susceptible-infected-removed states transforms sparse risk sources into a continuous horizontal risk field; the field is then coupled with ACO through path evaluation, transition guidance, and pheromone regulation. Experiments in three representative environments with 30 independent runs show that SIR-ACO reduces mean risk exposure by 64.2%, 74.1%, and 68.9% relative to basic ACO, and additional 40\u00d740 random-map tests show the same exposure-reduction trend against stochastic ACO baselines. Incremental component analysis identifies SIR-inspired risk-field evaluation as the primary source of exposure reduction, while mass-matched distance-decay and risk-weight-sweep comparisons show that the proposed representation changes the spatial safety-efficiency trade-off beyond merely adding a continuous distance penalty. Comparisons with A*, Risk-A*, and RRT* are included as deterministic and stochastic references. The results support SIR-ACO as a safety-enhanced ACO framework for static global planning, while also showing that it is not a universal replacement for deterministic graph search when a fixed risk cost is directly available.<\/p>\n\n\n\n<p><em>Keywords:&nbsp;Fixed-altitude UAV; Path planning; Ant colony optimization; Risk field; SIR model; Swarm intelligence<\/em><\/p>\n\n\n\n<div style=\"height:2rem\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-div ref_ol\" data-aos=\"normal\">\n<div class=\"container\">\n<div id=\"model-response-message-contentr_53180f64958e6cc2\" class=\"markdown markdown-main-panel md-content enable-luminous-fast-follows enable-updated-hr-color stronger\" dir=\"ltr\" aria-busy=\"false\" aria-live=\"polite\">\n<ol>\n<li data-path-to-node=\"0\">[1] S. Aggarwal and N. Kumar, (2020) &#8220;Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges&#8221; Computer Communications 149: 270-299. DOI: https:\/\/doi.org\/10.1016\/j.comcom.2019.10.014.<\/li>\n<li data-path-to-node=\"0\">[2] J. Luo, Y. Tian, and Z. Wang, (2024) &#8220;Research on unmanned aerial vehicle path planning&#8221; Drones 8(2): 51. DOI: https:\/\/doi.org\/10.3390\/drones8020051.<\/li>\n<li data-path-to-node=\"0\">[3] M. Rahman, N. I. Sarkar, and R. Lutui, (2025) &#8220;A Survey on Multi-UAV Path Planning: Classification, Algorithms, Open Research Problems, and Future Directions&#8221; Drones 9(4): 263. DOI: https:\/\/doi.org\/10.3390\/drones9040263.<\/li>\n<li data-path-to-node=\"0\">[4] D. Debnath, F. Vanegas, J. Sandino, A. F. Hawary, and F. Gonzalez, (2024) &#8220;A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications&#8221; Remote Sensing 16(21): 4019. DOI: https:\/\/doi.org\/10.3390\/rs16214019.<\/li>\n<li data-path-to-node=\"0\">[5] D. Alaa, K. Abdelmadjid, and L. Fadhila, (2025) &#8220;Intelligent path planning algorithms for UAVs: Classification, complexity analysis, hybrid ablation insights, and future directions&#8221; Advances in Mechanical Engineering 17(7): 16878132251355020. DOI: https:\/\/doi.org\/10.1177\/16878132251355020.<\/li>\n<li data-path-to-node=\"0\">[6] Y. Jiang, X.-X. Xu, M.-Y. Zheng, and Z.-H. Zhan, (2024) &#8220;Evolutionary computation for unmanned aerial vehicle path planning: a survey&#8221; Artificial Intelligence Review 57(10): 267. DOI: https:\/\/doi.org\/10.1007\/s10462-024-10913-0.<\/li>\n<li data-path-to-node=\"0\">[7] S. Alshammrei, S. Boubaker, and L. Kolsi, (2022) &#8220;Improved Dijkstra algorithm for mobile robot path planning and obstacle avoidance&#8221; Computers, Materials &#038; Continua 72(3): 5939-5954. DOI: https:\/\/doi.org\/10.32604\/cmc.2022.028165.<\/li>\n<li data-path-to-node=\"0\">[8] G. Tang, C. Tang, C. Claramunt, X. Hu, and P. Zhou, (2021) &#8220;Geometric A-star algorithm: An improved A-star algorithm for AGV path planning in a port environment&#8221; IEEE access 9: 59196-59210. DOI: https:\/\/doi.org\/10.1109\/ACCESS.2021.3070054.<\/li>\n<li data-path-to-node=\"0\">[9] C. Li, X. Huang, J. Ding, K. Song, and S. Lu, (2022) &#8220;Global path planning based on a bidirectional alternating search A* algorithm for mobile robots&#8221; Computers &#038; Industrial Engineering 168: 108123. DOI: https:\/\/doi.org\/10.1016\/j.cie.2022.108123.<\/li>\n<li data-path-to-node=\"0\">[10] R. Guo, X. Quan, and C. Bao, (2025) &#8220;Research on Mobile Robot Path Planning Based on an Improved Bidirectional Jump Point Search Algorithm&#8221; Electronics 14(8): 1669. DOI: https:\/\/doi.org\/10.3390\/electronics14081669.<\/li>\n<li data-path-to-node=\"0\">[11] J. Xiang, J. Xie, and J. Chen. &#8220;Learning-accelerated A* search for risk-aware path planning&#8221;. In: AIAA SCITECH 2024 Forum. 2024, 2895. DOI: https:\/\/doi.org\/10.2514\/6.2024-2895.<\/li>\n<li data-path-to-node=\"0\">[12] Y. He, T. Hou, and M. Wang, (2024) &#8220;A new method for unmanned aerial vehicle path planning in complex environments&#8221; Scientific Reports 14(1): 9257. DOI: https:\/\/doi.org\/10.1038\/s41598-024-60051-4.<\/li>\n<li data-path-to-node=\"0\">[13] L. Xu, M. Xi, R. Gao, Z. Ye, and Z. He, (2025) &#8220;Dynamic path planning of UAV with least inflection point based on adaptive neighborhood A* algorithm and multi-strategy fusion&#8221; Scientific Reports 15(1): 8563. DOI: https:\/\/doi.org\/10.1038\/s41598-025-92406-w.<\/li>\n<li data-path-to-node=\"0\">[14] W. Zhang, J. Li, W. Yu, P. Ding, J. Wang, and X. Zhang, (2024) &#8220;Algorithm for UAV path planning in high obstacle density environments: RFA-star&#8221; Frontiers in Plant Science 15: 1391628. DOI: https:\/\/doi.org\/10.3389\/fpls.2024.1391628.<\/li>\n<li data-path-to-node=\"0\">[15] J. Qi, H. Yang, and H. Sun, (2021) &#8220;MOD-RRT*: A sampling-based algorithm for robot path planning in dynamic environment&#8221; IEEE Transactions on Industrial Electronics 68(8): 7244-7251. DOI: https:\/\/doi.org\/10.1109\/TIE.2020.2998740.<\/li>\n<li data-path-to-node=\"0\">[16] J. Wang, J. Li, Y. Song, Y. Tuo, and C. Liu, (2024) &#8220;FC-RRT*: A modified RRT with rapid convergence in complex environments&#8221; Journal of Computational Science 77: 102239. DOI: https:\/\/doi.org\/10.1016\/j.jocs.2024.102239.<\/li>\n<li data-path-to-node=\"0\">[17] J. Wang, Z. Zhao, J. Qu, and X. Chen, (2024) &#8220;APPA-3D: an autonomous 3D path planning algorithm for UAVs in unknown complex environments&#8221; Scientific Reports 14(1): 1231. DOI: https:\/\/doi.org\/10.1038\/s41598-024-51286-2.<\/li>\n<li data-path-to-node=\"0\">[18] J. Deng, W. Wang, L. Wang, A. K. Bashir, T. R. Gadekallu, H. Feng, M. Lv, and K. Fang, (2025) &#8220;FID-SUS: Federated Intrusion Detection for Securing UAV Swarms in Smart Aerial Computing&#8221; IEEE Internet of Things Journal 12(9): 11312-11328. DOI: https:\/\/doi.org\/10.1109\/JIOT.2025.3549508.<\/li>\n<li data-path-to-node=\"0\">[19] M. Nazarahari, E. Khanmirza, and S. Doostie, (2019) &#8220;Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm&#8221; Expert Systems with Applications 115: 106-120. DOI: https:\/\/doi.org\/10.1016\/j.eswa.2018.08.008.<\/li>\n<li data-path-to-node=\"0\">[20] S. Lin, A. Liu, J. Wang, and X. Kong, (2023) &#8220;An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse&#8221; Journal of Computational Science 67: 101938. DOI: https:\/\/doi.org\/10.1016\/j.jocs.2022.101938.<\/li>\n<li data-path-to-node=\"0\">[21] S. Zhang and L. Wang, (2026) &#8220;Multi-UAV cooperative path planning based on chaotic grey wolf optimiser&#8221; The Aeronautical Journal 130(1345): 741-761. DOI: https:\/\/doi.org\/10.1017\/aer.2025.10101.<\/li>\n<li data-path-to-node=\"0\">[22] J. Feng, C. Sun, J. Zhang, Y. Du, Z. Liu, and Y. Ding, (2023) &#8220;A UAV path planning method in three-dimensional space based on a hybrid gray wolf optimization algorithm&#8221; Electronics 13(1): 68. DOI: https:\/\/doi.org\/10.3390\/electronics13010068.<\/li>\n<li data-path-to-node=\"0\">[23] F. Xu, H. Li, C.-M. Pun, H. Hu, Y. Li, Y. Song, and H. Gao, (2020) &#8220;A new global best guided artificial bee colony algorithm with application in robot path planning&#8221; Applied Soft Computing 88: 106037. DOI: https:\/\/doi.org\/10.1016\/j.asoc.2019.106037.<\/li>\n<li data-path-to-node=\"0\">[24] Y. Zhao, H. Feng, T. Wang, T. R. Gadekallu, K. Fang, and W. Wang. &#8220;Communication-Efficient Federated Learning for Post-Flood Risk Assessment Using UAV Swarms&#8221;. In: Proceedings of the ACM Web Conference 2026. Association for Computing Machinery, 2026, 8984-8994. DOI: https:\/\/doi.org\/10.1145\/3774904.3792983.<\/li>\n<li data-path-to-node=\"0\">[25] M. Dorigo, V. Maniezzo, and A. Colorni, (1996) &#8220;Ant system: optimization by a colony of cooperating agents&#8221; IEEE transactions on systems, man, and cybernetics, part b (cybernetics) 26(1): 29-41. DOI: https:\/\/doi.org\/10.1109\/3477.484436.<\/li>\n<li data-path-to-node=\"0\">[26] L. Wu, X. Huang, J. Cui, C. Liu, and W. Xiao, (2023) &#8220;Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot&#8221; Expert Systems with Applications 215: 119410. DOI: https:\/\/doi.org\/10.1016\/j.eswa.2022.119410.<\/li>\n<li data-path-to-node=\"0\">[27] S. Zhu, W. Zhu, X. Zhang, and T. Cao, (2020) &#8220;Path planning of lunar robot based on dynamic adaptive ant colony algorithm and obstacle avoidance&#8221; International Journal of Advanced Robotic Systems 17(3): 1729881419898979. DOI: https:\/\/doi.org\/10.1177\/1729881419898979.<\/li>\n<li data-path-to-node=\"0\">[28] G. Yi, Z. Feng, T. Mei, P. Li, W. Jin, and S. Chen, (2019) &#8220;Multi-AGVs path planning based on improved ant colony algorithm&#8221; The Journal of Supercomputing 75(9): 5898-5913. DOI: https:\/\/doi.org\/10.1007\/s11227-019-02884-9.<\/li>\n<li data-path-to-node=\"0\">[29] Y. Yu and S. Lee, (2023) &#8220;Efficient multi-UAV path planning for collaborative area search operations&#8221; Applied Sciences 13(15): 8728. DOI: https:\/\/doi.org\/10.3390\/app13158728.<\/li>\n<li data-path-to-node=\"0\">[30] F. H. Ajeil, I. K. Ibraheem, A. T. Azar, and A. J. Humaidi, (2020) &#8220;Grid-based mobile robot path planning using aging-based ant colony optimization algorithm in static and dynamic environments&#8221; Sensors 20(7): 1880. DOI: https:\/\/doi.org\/10.3390\/s20071880.<\/li>\n<li data-path-to-node=\"0\">[31] C. Liu, L. Wu, W. Xiao, G. Li, D. Xu, J. Guo, and W. Li, (2023) &#8220;An improved heuristic mechanism ant colony optimization algorithm for solving path planning&#8221; Knowledge-Based Systems 271: 110540. DOI: https:\/\/doi.org\/10.1016\/j.knosys.2023.110540.<\/li>\n<li data-path-to-node=\"0\">[32] Q. Li, Q. Li, and B. Cui, (2024) &#8220;Improved ant colony optimization algorithm based on islands type for mobile robot path planning&#8221; International Journal of Advanced Robotic Systems 21(5): 17298806241278170. DOI: https:\/\/doi.org\/10.1177\/17298806241278170.<\/li>\n<li data-path-to-node=\"0\">[33] Y. Lu and C. Da, (2025) &#8220;Global and local path planning of robots combining ACO and dynamic window algorithm&#8221; Scientific Reports 15(1): 9452. DOI: https:\/\/doi.org\/10.1038\/s41598-025-93571-8.<\/li>\n<li data-path-to-node=\"0\">[34] J. Ma, Q. Liu, Z. Yang, and B. Wang, (2025) &#8220;Improved Trimming Ant Colony Optimization Algorithm for Mobile Robot Path Planning&#8221; Algorithms 18(5): 240. DOI: https:\/\/doi.org\/10.3390\/a18050240.<\/li>\n<li data-path-to-node=\"0\">[35] Y. Wang, J. Liu, Y. Qian, and W. Yi, (2025) &#8220;Path Planning for Multi-UAV in a Complex Environment Based on Reinforcement-Learning-Driven Continuous Ant Colony Optimization&#8221; Drones 9(9): 638. DOI: https:\/\/doi.org\/10.3390\/drones9090638.<\/li>\n<li data-path-to-node=\"0\">[36] W. O. Kermack and A. G. McKendrick, (1927) &#8220;A contribution to the mathematical theory of epidemics&#8221; Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character 115(772): 700-721. DOI: https:\/\/doi.org\/10.1098\/rspa.1927.0118.<\/li>\n<li data-path-to-node=\"0\">[37] M. Dorigo and L. M. Gambardella, (1997) &#8220;Ant colony system: A cooperative learning approach to the traveling salesman problem&#8221; IEEE Transactions on Evolutionary Computation 1(1): 53-66. DOI: https:\/\/doi.org\/10.1109\/4235.585892.<\/li>\n<li data-path-to-node=\"0\">[38] T. St\u00fctzle and H. H. Hoos, (2000) &#8220;MAX-MIN ant system&#8221; Future Generation Computer Systems 16(8): 889-914. DOI: https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<p><\/p>\n","protected":false},"author":3,"template":"wp-custom-template-detail-4-aricles","meta":{"_uag_custom_page_level_css":""},"categories":[2188,6,2189],"tags":[2298],"acf":[],"uagb_featured_image_src":[],"uagb_author_info":{"display_name":"\u6797\u923a\u6db5","author_link":"\/jase\/?author=3"},"uagb_comment_info":0,"uagb_excerpt":"&nbsp;Copyright&nbsp;The Author(s). This is an open access article distributed under the terms of the&nbsp;Creative Commons Attribution&nbsp;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: BibTeX | http:\/\/dx.doi.org\/10.6180\/jase.202701_36.018 Download PDF Collision-free routing is not necessarily safe for unmanned aerial vehicles operating&hellip;","_links":{"self":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope\/12958"}],"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=12958"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=12958"},{"taxonomy":"post_tag","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=12958"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}