{"id":"https://openalex.org/W4416798799","doi":"https://doi.org/10.1109/apsipaasc65261.2025.11249029","title":"Multi-Strategy Improved Electric Eel Foraging Optimisation Algorithm For UAV Path Planning","display_name":"Multi-Strategy Improved Electric Eel Foraging Optimisation Algorithm For UAV Path Planning","publication_year":2025,"publication_date":"2025-10-22","ids":{"openalex":"https://openalex.org/W4416798799","doi":"https://doi.org/10.1109/apsipaasc65261.2025.11249029"},"language":null,"primary_location":{"id":"doi:10.1109/apsipaasc65261.2025.11249029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apsipaasc65261.2025.11249029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Asia Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","raw_type":"proceedings-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":"https://openalex.org/A5055268501","display_name":"Zexin Zhang","orcid":"https://orcid.org/0000-0002-7566-8449"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zexin Zhang","raw_affiliation_strings":["Kunming University of Science and Technology,Faculty of Information Engineering and Automation,Kunming,China,650500"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kunming University of Science and Technology,Faculty of Information Engineering and Automation,Kunming,China,650500","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019606366","display_name":"Chengbiao Fu","orcid":"https://orcid.org/0000-0002-4019-1839"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chengbiao Fu","raw_affiliation_strings":["Kunming University of Science and Technology,Faculty of Information Engineering and Automation,Kunming,China,650500"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kunming University of Science and Technology,Faculty of Information Engineering and Automation,Kunming,China,650500","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100639567","display_name":"Hongwei Guo","orcid":"https://orcid.org/0000-0003-3599-1572"},"institutions":[{"id":"https://openalex.org/I4210121919","display_name":"Honghe University","ror":"https://ror.org/036prgm77","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210121919"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Guo","raw_affiliation_strings":["School of Engineering, Honghe University,Mengzi,Yunnan,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, Honghe University,Mengzi,Yunnan,China","institution_ids":["https://openalex.org/I4210121919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012923816","display_name":"Anhong Tian","orcid":"https://orcid.org/0000-0002-8852-9106"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Anhong Tian","raw_affiliation_strings":["Kunming University of Science and Technology,Faculty of Land Resource Engineering,Kunming,China,650093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kunming University of Science and Technology,Faculty of Land Resource Engineering,Kunming,China,650093","institution_ids":["https://openalex.org/I10660446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33012469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1404","last_page":"1411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.7386000156402588,"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.7386000156402588,"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/T11133","display_name":"UAV Applications and Optimization","score":0.07289999723434448,"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"}},{"id":"https://openalex.org/T11170","display_name":"Biomimetic flight and propulsion mechanisms","score":0.020600000396370888,"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/differential-evolution","display_name":"Differential evolution","score":0.6384999752044678},{"id":"https://openalex.org/keywords/foraging","display_name":"Foraging","score":0.6079999804496765},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5896999835968018},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5220999717712402},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5019000172615051},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.4706000089645386},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.44269999861717224},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4300000071525574},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3874000012874603}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6809999942779541},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.6384999752044678},{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.6079999804496765},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5896999835968018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.534600019454956},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5220999717712402},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.4706000089645386},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.44269999861717224},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.3727000057697296},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","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.34220001101493835},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28119999170303345},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.27630001306533813},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.2667999863624573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/apsipaasc65261.2025.11249029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apsipaasc65261.2025.11249029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Asia Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5118434222","display_name":null,"funder_award_id":"42361007","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W3151306683","https://openalex.org/W3154719286","https://openalex.org/W4285391049","https://openalex.org/W4289831509","https://openalex.org/W4328136079","https://openalex.org/W4387873343"],"related_works":[],"abstract_inverted_index":{"The":[0],"Electric":[1,70],"Eel":[2,71],"Foraging":[3,72],"Optimization":[4,73],"(EEFO)":[5],"algorithm":[6,75],"is":[7,87,98,111,123],"a":[8,50,81,94,106,118,176],"metaheuristic":[9],"optimization":[10,20,59],"method":[11],"based":[12],"on":[13],"swarm":[14],"intelligence,":[15],"designed":[16],"to":[17,52,89,100,113,125,153],"solve":[18],"complex":[19,173],"problems":[21],"by":[22],"simulating":[23],"the":[24,136,154,161],"foraging":[25],"behavior":[26],"of":[27,145],"electric":[28],"eels.":[29],"Although":[30],"EEFO":[31,138],"demonstrates":[32,200],"strong":[33,177],"global":[34,102],"search":[35,103,115],"capabilities,":[36],"it":[37],"still":[38],"suffers":[39],"from":[40],"issues":[41],"such":[42,182],"as":[43,183],"insufficient":[44],"initial":[45],"population":[46,91],"diversity,":[47],"premature":[48],"convergence,":[49],"tendency":[51],"fall":[53],"into":[54],"local":[55,127],"optima,":[56],"and":[57,139,148,189,196,199],"limited":[58],"accuracy.":[60],"To":[61],"address":[62],"these":[63],"limitations,":[64],"this":[65],"paper":[66],"proposes":[67],"an":[68],"improved":[69],"(IEEFO)":[74],"that":[76,133],"integrates":[77],"multiple":[78,180],"strategies.":[79],"First,":[80],"good":[82],"point":[83],"set":[84],"initialization":[85],"strategy":[86,97,122],"adopted":[88],"enhance":[90],"diversity.":[92],"Second,":[93],"differential":[95],"evolution":[96],"incorporated":[99],"improve":[101],"ability.":[104],"Third,":[105],"random":[107],"boundary":[108],"control":[109],"mechanism":[110],"introduced":[112],"increase":[114],"flexibility.":[116],"Finally,":[117],"solution":[119],"quality":[120,195],"enhancement":[121],"implemented":[124],"refine":[126],"exploitation":[128],"capabilities.":[129],"Experimental":[130],"results":[131],"show":[132],"IEEFO":[134,166],"outperforms":[135],"original":[137],"other":[140],"comparison":[141],"algorithms":[142],"in":[143],"terms":[144],"convergence":[146],"accuracy":[147],"stability.":[149],"Furthermore,":[150],"its":[151],"application":[152],"UAV":[155],"path":[156,170,190,194],"planning":[157,171],"problem":[158],"further":[159],"validates":[160],"algorithm's":[162],"practical":[163],"engineering":[164],"value:":[165],"effectively":[167],"handles":[168],"3D":[169],"under":[172],"constraints,":[174],"achieves":[175],"balance":[178],"among":[179],"objectives":[181],"threat":[184],"avoidance,":[185],"energy":[186],"consumption":[187],"minimization,":[188],"smoothness,":[191],"significantly":[192],"improves":[193],"algorithmic":[197],"robustness,":[198],"considerable":[201],"potential":[202],"for":[203],"real-world":[204],"applications.":[205]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-28T00:00:00"}