{"id":"https://openalex.org/W7130651857","doi":"https://doi.org/10.1002/cpe.70601","title":"Improved Whale Optimization Multiple UAVs Path Planning based on Multiple Dimension Stereo Strategy","display_name":"Improved Whale Optimization Multiple UAVs Path Planning based on Multiple Dimension Stereo Strategy","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7130651857","doi":"https://doi.org/10.1002/cpe.70601"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.70601","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70601","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ying Li","orcid":"https://orcid.org/0009-0000-8881-3193"},"institutions":[{"id":"https://openalex.org/I39333907","display_name":"Yanshan University","ror":"https://ror.org/02txfnf15","country_code":"CN","type":"education","lineage":["https://openalex.org/I39333907"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ying Li","raw_affiliation_strings":["School of Science Yanshan University  Qinhuangdao Hebei China"],"raw_orcid":"https://orcid.org/0009-0000-8881-3193","affiliations":[{"raw_affiliation_string":"School of Science Yanshan University  Qinhuangdao Hebei China","institution_ids":["https://openalex.org/I39333907"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115602019","display_name":"Fang Wang","orcid":"https://orcid.org/0000-0001-7729-5669"},"institutions":[{"id":"https://openalex.org/I39333907","display_name":"Yanshan University","ror":"https://ror.org/02txfnf15","country_code":"CN","type":"education","lineage":["https://openalex.org/I39333907"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Fang Wang","raw_affiliation_strings":["School of Science Yanshan University  Qinhuangdao Hebei China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science Yanshan University  Qinhuangdao Hebei China","institution_ids":["https://openalex.org/I39333907"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5126481716","display_name":"Chao Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I108160477","display_name":"Hebei Agricultural University","ror":"https://ror.org/009fw8j44","country_code":"CN","type":"education","lineage":["https://openalex.org/I108160477"]},{"id":"https://openalex.org/I4210117826","display_name":"Hebei University of Environmental Engineering","ror":"https://ror.org/02bjyz323","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210117826"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao Zhou","raw_affiliation_strings":["Ocean College Hebei Agricultural University  Qinhuangdao Hebei China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ocean College Hebei Agricultural University  Qinhuangdao Hebei China","institution_ids":["https://openalex.org/I4210117826","https://openalex.org/I108160477"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5115602019"],"corresponding_institution_ids":["https://openalex.org/I39333907"],"apc_list":{"value":4740,"currency":"USD","value_usd":4740},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16621763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.24609999358654022,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.24609999358654022,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.15000000596046448,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.12860000133514404,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6078000068664551},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5776000022888184},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5648999810218811},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.503000020980835},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48590001463890076},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4449999928474426},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.44279998540878296},{"id":"https://openalex.org/keywords/operability","display_name":"Operability","score":0.4390999972820282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7663999795913696},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6078000068664551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.583299994468689},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5776000022888184},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5648999810218811},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.503000020980835},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48590001463890076},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C126231374","wikidata":"https://www.wikidata.org/wiki/Q1061298","display_name":"Operability","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40139999985694885},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C22679943","wikidata":"https://www.wikidata.org/wiki/Q159375","display_name":"Standard deviation","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.31520000100135803},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.28290000557899475},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.2572999894618988}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.70601","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70601","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5419554710388184,"display_name":"Life below water","id":"https://metadata.un.org/sdg/14"}],"awards":[{"id":"https://openalex.org/G6497725696","display_name":null,"funder_award_id":"62073234","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6832122091","display_name":null,"funder_award_id":"F2022203085","funder_id":"https://openalex.org/F4320322163","funder_display_name":"Natural Science Foundation of Hebei Province"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322163","display_name":"Natural Science Foundation of Hebei Province","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1419527249","https://openalex.org/W2006694777","https://openalex.org/W2072955302","https://openalex.org/W2122032069","https://openalex.org/W2290883490","https://openalex.org/W2919979744","https://openalex.org/W2979955841","https://openalex.org/W3028989299","https://openalex.org/W3040469843","https://openalex.org/W3097771457","https://openalex.org/W3119533075","https://openalex.org/W3151306683","https://openalex.org/W3163903840","https://openalex.org/W3214232139","https://openalex.org/W4200384359","https://openalex.org/W4200539666","https://openalex.org/W4205432307","https://openalex.org/W4205574548","https://openalex.org/W4220703617","https://openalex.org/W4283734450","https://openalex.org/W4289527244","https://openalex.org/W4292083457","https://openalex.org/W4385700024","https://openalex.org/W4385739167","https://openalex.org/W4389349077","https://openalex.org/W4391232494","https://openalex.org/W4396857150","https://openalex.org/W4400438510","https://openalex.org/W4402537940","https://openalex.org/W4403561290","https://openalex.org/W4403844148","https://openalex.org/W4406088632","https://openalex.org/W4407134281","https://openalex.org/W4407899821","https://openalex.org/W4407910988","https://openalex.org/W4409346352","https://openalex.org/W4412710297"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"Given":[1],"the":[2,20,38,52,59,63,69,72,82,87,95,104,114,118,121,125,129,145,162,165,180],"whale":[3],"optimization":[4,24,84,116],"algorithm's":[5],"slow":[6],"convergence":[7,42,66],"and":[8,44,54,67,89,124,149,168,176],"a":[9,28,139],"tendency":[10],"to":[11,36,50,80,187],"become":[12],"trapped":[13],"in":[14,78,92],"local":[15,55],"optima,":[16],"this":[17],"paper":[18],"introduces":[19],"multiple":[21,99,108],"strategy\u2010based":[22],"Whale":[23],"algorithm":[25,73,88,123],"(MSWOA)":[26],"as":[27,113],"solution.":[29],"In":[30,76,178],"MSWOA,":[31],"random":[32],"initialization":[33],"is":[34,74,101,133,157,183],"used":[35],"ensure":[37],"population":[39],"diversity.":[40],"Dynamic":[41],"factors":[43,47],"adaptive":[45],"weight":[46],"are":[48],"constructed":[49],"improve":[51],"global":[53],"search":[56],"capabilities":[57],"of":[58,65,71,86,98,107,154,164,174],"algorithm.":[60],"Then,":[61],"through":[62],"analysis":[64],"complexity,":[68],"feasibility":[70],"proved.":[75],"addition,":[77,179],"order":[79],"verify":[81],"overall":[83],"performance":[85],"its":[90],"operability":[91],"practical":[93],"applications,":[94],"optimal":[96],"path":[97,105],"UAVs":[100,109],"determined.":[102],"Taking":[103],"planning":[106],"under":[110,128],"three\u2010dimensional":[111],"terrain":[112],"objective":[115,142],"problem,":[117],"comparison":[119],"between":[120],"proposed":[122],"other":[126,166],"algorithms":[127,167],"same":[130],"simulation":[131],"conditions":[132],"done.":[134],"The":[135],"MSWOA":[136],"quickly":[137],"reaches":[138],"stable":[140],"low":[141],"value":[143],"within":[144],"first":[146],"50":[147],"iterations,":[148],"achieves":[150],"an":[151],"average":[152],"fitness":[153],"0.80,":[155],"which":[156],"about":[158,169],"6%":[159],"lower":[160,171],"than":[161,172],"mean":[163],"10%":[170],"those":[173],"WOA":[175],"RDWOA.":[177],"standard":[181],"deviation":[182],"reduced":[184],"by":[185],"50%":[186],"70%.":[188]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-02-20T00:00:00"}