{"id":"https://openalex.org/W4379803561","doi":"https://doi.org/10.1145/3586185.3586191","title":"An improved ant colony optimization for UAV minimum time search path planning","display_name":"An improved ant colony optimization for UAV minimum time search path planning","publication_year":2023,"publication_date":"2023-01-06","ids":{"openalex":"https://openalex.org/W4379803561","doi":"https://doi.org/10.1145/3586185.3586191"},"language":"en","primary_location":{"id":"doi:10.1145/3586185.3586191","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3586185.3586191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 4th International Conference on Artificial Intelligence in Electronics Engineering","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/A5108670276","display_name":"Zhenglin Geng","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenglin Geng","raw_affiliation_strings":["National University of Defense Technology, China"],"raw_orcid":"https://orcid.org/0000-0002-4950-5080","affiliations":[{"raw_affiliation_string":"National University of Defense Technology, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084364087","display_name":"Yisong Sun","orcid":"https://orcid.org/0009-0005-4604-2630"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yisong Sun","raw_affiliation_strings":["csust, China"],"raw_orcid":"https://orcid.org/0009-0005-4604-2630","affiliations":[{"raw_affiliation_string":"csust, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.05008534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9973999857902527,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8378636837005615},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7690417766571045},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6944694519042969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6827484965324402},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5953209400177002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5944671034812927},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.5659051537513733},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.421142578125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42084410786628723},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23517528176307678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22459891438484192},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.22391006350517273}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8378636837005615},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7690417766571045},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6944694519042969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6827484965324402},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5953209400177002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5944671034812927},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5659051537513733},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.421142578125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42084410786628723},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23517528176307678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22459891438484192},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.22391006350517273},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3586185.3586191","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3586185.3586191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 4th International Conference on Artificial Intelligence in Electronics Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W101015759","https://openalex.org/W2031445638","https://openalex.org/W2077831477","https://openalex.org/W2152195021","https://openalex.org/W2790029795","https://openalex.org/W2922094741","https://openalex.org/W2997618425","https://openalex.org/W3191818858","https://openalex.org/W4244612823"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W4229070275","https://openalex.org/W2462483068","https://openalex.org/W1939200287","https://openalex.org/W1588949866","https://openalex.org/W1965569281","https://openalex.org/W2546046681"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"an":[3,33],"improved":[4,61],"ant":[5],"colony":[6],"optimization":[7,34],"algorithm":[8,64,72,86],"for":[9,16,36],"UAV":[10],"minimum":[11],"time":[12,39,91],"search":[13],"path":[14,26,59],"planning":[15,27],"moving":[17],"targets":[18],"is":[19,30,60,93],"proposed.":[20],"Based":[21],"on":[22],"Bayesian":[23],"theory,":[24],"the":[25,37,45,48,52,63,68,71,77,84,97],"of":[28,40,47,54,70,76],"UAVs":[29],"transformed":[31],"into":[32],"problem":[35],"expected":[38],"target":[41],"detection.":[42],"According":[43],"to":[44,66,73],"principle":[46],"simulated":[49],"annealing":[50],"algorithm,":[51],"probability":[53],"ants":[55],"choosing":[56],"a":[57,88],"non-optimal":[58],"after":[62],"converges,":[65],"improve":[67],"ability":[69],"jump":[74],"out":[75],"local":[78],"optimum.":[79],"Simulation":[80],"results":[81],"show":[82],"that":[83],"proposed":[85],"has":[87],"shorter":[89],"searching":[90],"and":[92],"more":[94],"robust":[95],"than":[96],"existing":[98],"algorithms.":[99]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}