{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T14:37:34Z","timestamp":1778423854967,"version":"3.51.4"},"reference-count":32,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272423"],"award-info":[{"award-number":["62272423"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62472423"],"award-info":[{"award-number":["62472423"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62203480"],"award-info":[{"award-number":["62203480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Joint Fund Key Project of Science and Technology R&D Plan of Henan Province, China","award":["235200810022"],"award-info":[{"award-number":["235200810022"]}]},{"name":"Distinguished Youth Science Foundation of Henan province of China","award":["242300421055"],"award-info":[{"award-number":["242300421055"]}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan","doi-asserted-by":"crossref","award":["252300420389"],"award-info":[{"award-number":["252300420389"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Henan Province Key R&D Project","award":["241111210400"],"award-info":[{"award-number":["241111210400"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In view of the complex flight scenarios existing in UAV path planning, it is necessary to model the UAV flight trajectory. When constructing the model, cost factors such as the minimum flight path of the UAV, obstacle avoidance, flight altitude, and trajectory smoothness are fully taken into account. To reduce the overall flight cost, a novel secretary bird optimization algorithm (NSBOA) is proposed in this paper, which effectively addresses the limitations of traditional algorithms in handling UAV path planning tasks. First of all, the Singer chaotic map is adopted to initialize the population instead of the conventional random initialization method. This improvement increases population diversity, enables the initial population to be more evenly distributed in the search space, and further accelerates the algorithm\u2019s convergence speed in the subsequent optimization process. Second, an adaptive adjustment mechanism is integrated with the Levy flight mechanism to optimize the core logic of the algorithm, with a specific focus on improving the exploitation stage. By introducing appropriate perturbations near the current optimal solution, the algorithm is guided to jump out of local optimal traps, thereby enhancing its global optimization capability and avoiding premature convergence caused by insufficient population diversity. By comparing and analyzing NSBOA with SBOA, WOA, PSO, POA, NGO, and HHO algorithms in 12 common evaluation functions and CEC 2017 test functions, and applying NSBOA to the UAV path optimization problem, the simulation results show the effectiveness and superiority of the proposed scheme.<\/jats:p>","DOI":"10.3390\/a19010064","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T09:13:01Z","timestamp":1768209181000},"page":"64","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Secretary Bird Optimization Algorithm for UAV Path Planning"],"prefix":"10.3390","volume":"19","author":[{"given":"Huanlong","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"},{"name":"Research  Institute of Industrial Technology, ZZULI\uff0cZhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Cheng","sequence":"additional","affiliation":[{"name":"College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liao","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dian","family":"Jiao","sequence":"additional","affiliation":[{"name":"College of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhoujingzi","family":"Qiu","sequence":"additional","affiliation":[{"name":"Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, Shenzhen 518110, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.epsr.2016.07.030","article-title":"AC OPF in radial distribution networks\u2013Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers","volume":"143","author":"Christakou","year":"2017","journal-title":"Electr. Power Syst. Res."},{"key":"ref_2","first-page":"67","article-title":"FACTS devices optimization for optimal power flow using particle swarm optimization In Sulselrabar system","volume":"100","author":"Saini","year":"2024","journal-title":"Prz. Elektrotech."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijepes.2015.12.021","article-title":"Differential search algorithm for solving multi-objective optimal power flow problem","volume":"79","author":"Abaci","year":"2016","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"43107","DOI":"10.1109\/ACCESS.2021.3060710","article-title":"A modified crow search optimizer for solving non-linear OPF problem with emissions","volume":"9","author":"Shaheen","year":"2021","journal-title":"IEEE Access"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2016.01.041","article-title":"Optimal power flow using an Improved Colliding Bodies Optimization algorithm","volume":"42","author":"Bouchekara","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"106543","DOI":"10.1016\/j.ijepes.2020.106543","article-title":"Universal branch model for the solution of optimal power flows in hybrid AC\/DC grids","volume":"126","author":"Kazemtabrizi","year":"2021","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2864","DOI":"10.1109\/TPAS.1984.318284","article-title":"Optimal power flow by Newton approach","volume":"10","author":"Sun","year":"1984","journal-title":"IEEE Trans. Power Appar. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1049\/ip-gtd:19951586","article-title":"Optimal-power-flow solution by Newton\u2019s method applied to an augmented Lagrangian function","volume":"142","author":"Santos","year":"1995","journal-title":"IEE Proc.-Gener. Transm. Distrib."},{"key":"ref_9","first-page":"31","article-title":"Sparse reactive power scheduling by a penalty function-linear programming technique","volume":"1","author":"Quintana","year":"2007","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.energy.2007.08.004","article-title":"The established mega watt linear programming-based optimal power flow model applied to the real power 56-bus system in eastern province of Saudi Arabia","volume":"33","author":"Qamber","year":"2008","journal-title":"Energy"},{"key":"ref_11","first-page":"3267","article-title":"Quadratically convergent optimal power flow","volume":"11","author":"Burchett","year":"2007","journal-title":"IEEE Trans. Power Appar. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Miao, F., Li, H., Yan, G., Mei, X., Wu, Z., Zhao, W., Liu, T., and Zhang, H. (2024). Optimizing UAV Path Planning in Maritime Emergency Transportation: A Novel Multi-Strategy White Shark Optimizer. J. Mar. Sci. Eng., 12.","DOI":"10.3390\/jmse12071207"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.apm.2024.03.001","article-title":"Enhanced multi-strategy bottlenose dolphin optimizer for UAVs path planning","volume":"130","author":"Hu","year":"2024","journal-title":"Appl. Math. Model."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s12667-012-0056-y","article-title":"Optimal power flow: A bibliographic survey I: Formulations and deterministic methods","volume":"3","author":"Frank","year":"2012","journal-title":"Energy Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.epsr.2008.10.004","article-title":"Applications of computational intelligence techniques for solving the revived optimal power flow problem","volume":"79","author":"AlRashidi","year":"2009","journal-title":"Electr. Power Syst. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"e8120","DOI":"10.1002\/cpe.8120","article-title":"UAV path planning: Integration of grey wolf algorithm and artificial potential field","volume":"36","author":"Chen","year":"2024","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.24846\/v33i2y202408","article-title":"A Clustering-Based Hybrid Particle Swarm Optimization Algorithm for Solving a Multisectoral Agent-Based Model","volume":"33","author":"Akopov","year":"2024","journal-title":"Stud. Inform. Control"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10462-015-9445-7","article-title":"Particle swarm optimization with crossover: A review and empirical analysis","volume":"45","author":"Engelbrecht","year":"2016","journal-title":"Artif. Intell. Rev."},{"key":"ref_19","first-page":"111","article-title":"Optimal Power Flow under Both Normal and Contingent Operation Using Hybrid Particle Swarm Optimization and Nelder Mead Algorithms (PSO-NM)","volume":"12","author":"Joorabian","year":"2015","journal-title":"J. Iran. Assoc. Electr. Electron. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Meng, Q.C., Chen, K., and Qu, Q.J. (2024). Ppswarm: Multi-uav path planning based on hybrid pso in complex scenarios. Drones, 8.","DOI":"10.3390\/drones8050192"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"26766","DOI":"10.1109\/ACCESS.2021.3056407","article-title":"Metaheuristic algorithms on feature selection: A survey of one decade of research (2009\u20132019)","volume":"9","author":"Agrawal","year":"2021","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"e37286","DOI":"10.1016\/j.heliyon.2024.e37286","article-title":"A novel multi-objective dung beetle optimizer for Multi-UAV cooperative path planning","volume":"10","author":"Shen","year":"2024","journal-title":"Heliyon"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"17734","DOI":"10.1109\/JIOT.2023.3277850","article-title":"UAV path planning for target coverage task in dynamic environment","volume":"10","author":"Li","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Chen, Q.L., He, Q., and Zhang, D.M. (2023). UAV path planning based on an improved chimp optimization algorithm. Axioms, 12.","DOI":"10.3390\/axioms12070702"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1007\/s12559-021-09984-w","article-title":"A bio-inspired multi-population-based adaptive backtracking search algorithm","volume":"14","author":"Nama","year":"2022","journal-title":"Cogn. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"7881","DOI":"10.1007\/s10489-020-01974-z","article-title":"A modification of I-SOS: Performance analysis to large scale functions","volume":"51","author":"Nama","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"107779","DOI":"10.1016\/j.knosys.2021.107779","article-title":"An improved symbiotic organisms search algorithm for higher dimensional optimization problems","volume":"236","author":"Chakraborty","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2050029","DOI":"10.1142\/S1793962320500294","article-title":"A new parameter setting-based modified differential evolution for function optimization","volume":"11","author":"Nama","year":"2020","journal-title":"Int. J. Model. Simul. Sci. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10462-024-10729-y","article-title":"Secretary bird optimization algorithm: A new metaheuristic for solving global optimization problems","volume":"57","author":"Fu","year":"2024","journal-title":"Artif. Intell. Rev."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"407","DOI":"10.18280\/ts.360505","article-title":"A tweakable image encryption algorithm using an improved logistic chaotic map","volume":"36","author":"Herbadji","year":"2019","journal-title":"Trait. Signal"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"4385","DOI":"10.1007\/s00521-018-3343-2","article-title":"Chaotic grasshopper optimization algorithm for global optimization","volume":"31","author":"Arora","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"ref_32","first-page":"1","article-title":"Particle swarm optimization with chaos-based initialization for numerical optimization","volume":"24","author":"Tian","year":"2017","journal-title":"Intell. Autom. Soft Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/64\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T09:10:59Z","timestamp":1768381859000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,12]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["a19010064"],"URL":"https:\/\/doi.org\/10.3390\/a19010064","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,12]]}}}