{"id":"https://openalex.org/W4413531690","doi":"https://doi.org/10.32604/cmc.2025.068781","title":"Dung Beetle Optimization Algorithm Based on Bounded Reflection Optimization and Multi-Strategy Fusion for Multi-UAV Trajectory Planning","display_name":"Dung Beetle Optimization Algorithm Based on Bounded Reflection Optimization and Multi-Strategy Fusion for Multi-UAV Trajectory Planning","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4413531690","doi":"https://doi.org/10.32604/cmc.2025.068781"},"language":"en","primary_location":{"id":"doi:10.32604/cmc.2025.068781","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.068781","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.32604/cmc.2025.068781","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110198062","display_name":"Weicong Tan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Weicong Tan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055005745","display_name":"Qiwu Wu","orcid":"https://orcid.org/0009-0007-8711-819X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiwu Wu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044519560","display_name":"Lingzhi Jiang","orcid":"https://orcid.org/0000-0003-1047-451X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lingzhi Jiang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090089941","display_name":"Tao Tong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Tong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100381764","display_name":"Yan Su","orcid":"https://orcid.org/0009-0006-9687-9356"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yunchen Su","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110198062"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.304,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83891012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"85","issue":"2","first_page":"3621","last_page":"3652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9965000152587891,"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.9965000152587891,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9764999747276306,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.92330002784729,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/trajectory","display_name":"Trajectory","score":0.61083984375},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.5988715291023254},{"id":"https://openalex.org/keywords/reflection","display_name":"Reflection (computer programming)","score":0.5509214401245117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5317251682281494},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5304381847381592},{"id":"https://openalex.org/keywords/fusion","display_name":"Fusion","score":0.5161548852920532},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.499377965927124},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46113479137420654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4084435999393463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28485509753227234},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.06612572073936462},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.055310845375061035}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.61083984375},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.5988715291023254},{"id":"https://openalex.org/C65682993","wikidata":"https://www.wikidata.org/wiki/Q1056451","display_name":"Reflection (computer programming)","level":2,"score":0.5509214401245117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5317251682281494},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5304381847381592},{"id":"https://openalex.org/C158525013","wikidata":"https://www.wikidata.org/wiki/Q2593739","display_name":"Fusion","level":2,"score":0.5161548852920532},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.499377965927124},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46113479137420654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4084435999393463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28485509753227234},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.06612572073936462},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.055310845375061035},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.32604/cmc.2025.068781","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.068781","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.32604/cmc.2025.068781","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.068781","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W560737395","https://openalex.org/W1963969090","https://openalex.org/W1991080137","https://openalex.org/W1993687622","https://openalex.org/W2061438946","https://openalex.org/W2088073762","https://openalex.org/W2092180017","https://openalex.org/W2122032069","https://openalex.org/W2161794031","https://openalex.org/W2162597485","https://openalex.org/W2543580944","https://openalex.org/W2585392941","https://openalex.org/W2790662215","https://openalex.org/W2803958211","https://openalex.org/W2906436642","https://openalex.org/W2909688514","https://openalex.org/W2911283711","https://openalex.org/W2964884740","https://openalex.org/W2971255750","https://openalex.org/W3094704314","https://openalex.org/W3151306683","https://openalex.org/W3163638304","https://openalex.org/W3197557242","https://openalex.org/W4200063339","https://openalex.org/W4229001178","https://openalex.org/W4249545506","https://openalex.org/W4281687867","https://openalex.org/W4310004251","https://openalex.org/W4365145973","https://openalex.org/W4377107315","https://openalex.org/W4386074793","https://openalex.org/W4386391043","https://openalex.org/W4386609086","https://openalex.org/W4391014866","https://openalex.org/W4391812979","https://openalex.org/W4392550986","https://openalex.org/W4396854183","https://openalex.org/W4399850440","https://openalex.org/W4401957890","https://openalex.org/W4402200351","https://openalex.org/W4404585271","https://openalex.org/W4406027380","https://openalex.org/W4407241473","https://openalex.org/W4407424968","https://openalex.org/W4412529607"],"related_works":["https://openalex.org/W4385832323","https://openalex.org/W4244391535","https://openalex.org/W2356996864","https://openalex.org/W2904060783","https://openalex.org/W2015393961","https://openalex.org/W2378339670","https://openalex.org/W2359353485","https://openalex.org/W2361427670","https://openalex.org/W2139910871","https://openalex.org/W2119925415"],"abstract_inverted_index":{"This":[0,182],"study":[1],"introduces":[2],"a":[3,40,75,85,156,159],"novel":[4],"algorithm":[5,12],"known":[6],"as":[7],"the":[8,27,46,53,63,96,105,113,119,185],"dung":[9,65],"beetle":[10,66],"optimization":[11,17,59,67,140,145],"based":[13],"on":[14,62],"bounded":[15],"reflection":[16,77],"and":[18,84,101,138,171,187],"multi-strategy":[19],"fusion":[20],"(BFDBO),":[21],"which":[22],"is":[23,49],"designed":[24],"to":[25,94,143,169],"tackle":[26],"complexities":[28],"associated":[29],"with":[30],"multi-UAV":[31,47],"collaborative":[32,41],"trajectory":[33,54,164],"planning":[34,42,55,165],"in":[35,135,162,191],"intricate":[36],"battlefield":[37,149],"environments.":[38],"Initially,":[39],"cost":[43,114],"function":[44,122],"for":[45],"system":[48],"formulated,":[50],"thereby":[51],"converting":[52],"challenge":[56],"into":[57],"an":[58,79],"problem.":[60],"Building":[61],"foundational":[64],"(DBO)":[68],"algorithm,":[69],"BFDBO":[70,129,154,190],"incorporates":[71],"three":[72,126,172],"significant":[73],"innovations:":[74],"boundary":[76],"mechanism,":[78],"adaptive":[80],"mixed":[81],"exploration":[82,100],"strategy,":[83],"dynamic":[86],"multi-scale":[87],"mutation":[88],"strategy.":[89],"These":[90],"enhancements":[91,127],"are":[92],"intended":[93],"optimize":[95],"equilibrium":[97],"between":[98],"local":[99],"global":[102],"exploitation,":[103],"facilitating":[104],"discovery":[106],"of":[107,128,151,158,189],"globally":[108],"optimal":[109],"trajectories":[110],"that":[111,124],"minimize":[112],"function.":[115],"Numerical":[116],"simulations":[117],"utilizing":[118],"CEC2022":[120],"benchmark":[121],"indicate":[123],"all":[125],"positively":[130],"influence":[131],"its":[132],"performance,":[133],"resulting":[134],"accelerated":[136],"convergence":[137],"improved":[139],"accuracy":[141],"relative":[142],"leading":[144],"algorithms.":[146],"In":[147],"two":[148],"scenarios":[150],"varying":[152],"complexities,":[153],"achieved":[155],"minimum":[157],"39%":[160],"reduction":[161],"total":[163],"costs":[166],"when":[167],"compared":[168],"DBO":[170],"other":[173],"high-performance":[174],"variants,":[175],"while":[176],"also":[177],"demonstrating":[178],"superior":[179],"average":[180],"runtime.":[181],"evidence":[183],"underscores":[184],"effectiveness":[186],"applicability":[188],"practical,":[192],"real-world":[193],"contexts.":[194]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-26T15:22:09.906841","created_date":"2025-10-10T00:00:00"}