{"id":"https://openalex.org/W2945035871","doi":"https://doi.org/10.1145/3318299.3318376","title":"Double-ant Colony Based UAV Path Planning Algorithm","display_name":"Double-ant Colony Based UAV Path Planning Algorithm","publication_year":2019,"publication_date":"2019-02-22","ids":{"openalex":"https://openalex.org/W2945035871","doi":"https://doi.org/10.1145/3318299.3318376","mag":"2945035871"},"language":"en","primary_location":{"id":"doi:10.1145/3318299.3318376","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318299.3318376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 11th International Conference on Machine Learning and Computing","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/A5033040740","display_name":"Yirong Guan","orcid":null},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yirong Guan","raw_affiliation_strings":["Hohai University, Changzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hohai University, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051777612","display_name":"Mingsheng Gao","orcid":"https://orcid.org/0000-0002-8401-5335"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingsheng Gao","raw_affiliation_strings":["Hohai University, Changzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hohai University, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001190511","display_name":"Yufan Bai","orcid":null},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yufan Bai","raw_affiliation_strings":["Hohai University, Changzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hohai University, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9152,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.78899964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9948999881744385,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9945999979972839,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8670246601104736},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7004959583282471},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6882539987564087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6627510786056519},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.6366205215454102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5660409927368164},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5581000447273254},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5271013975143433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4999349117279053},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.48947417736053467},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.45418986678123474},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4210212528705597},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4165690243244171},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.27853918075561523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26536667346954346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20224028825759888},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1670612096786499}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8670246601104736},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7004959583282471},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6882539987564087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6627510786056519},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.6366205215454102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5660409927368164},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5581000447273254},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5271013975143433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4999349117279053},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.48947417736053467},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.45418986678123474},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4210212528705597},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4165690243244171},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.27853918075561523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26536667346954346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20224028825759888},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1670612096786499},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3318299.3318376","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318299.3318376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 11th International Conference on Machine Learning and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.7699999809265137,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1508015930","https://openalex.org/W1537653938","https://openalex.org/W2017235784","https://openalex.org/W2034927223","https://openalex.org/W2075956742","https://openalex.org/W2103623338","https://openalex.org/W2356547515","https://openalex.org/W2462226675","https://openalex.org/W2536252700","https://openalex.org/W2584411946","https://openalex.org/W2611686291","https://openalex.org/W2791698329"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W2155948905","https://openalex.org/W4380590094","https://openalex.org/W3043170174","https://openalex.org/W2050548713"],"abstract_inverted_index":{"Path":[0],"planning":[1],"plays":[2],"an":[3,21,73,82],"important":[4],"role":[5],"in":[6,80,106,111],"the":[7,16,25,29,64,87,90,112,124,127,132,135],"applications":[8],"of":[9,60,126,134],"Unmanned":[10],"Aerial":[11],"Vehicles":[12],"(UAVs).":[13],"It":[14],"allows":[15],"UAV":[17],"to":[18,28,63,71,119],"autonomously":[19],"compute":[20],"optimal":[22,74,83],"path":[23],"from":[24],"initial":[26],"point":[27],"end":[30],"by":[31],"checking":[32],"some":[33,39],"specific":[34,41],"control":[35],"points":[36],"or":[37],"fulfill":[38],"mission":[40],"constraints":[42],"(e.g.,":[43],"obstacle":[44],"avoidance,":[45],"fuel":[46],"consumption,":[47],"etc.).":[48],"While":[49],"ant":[50],"colony":[51,101],"optimization":[52],"(ACO)":[53],"algorithm":[54,103,118],"has":[55],"attracted":[56],"a":[57,99],"great":[58],"deal":[59],"attention":[61],"due":[62],"fact":[65],"that":[66],"ants":[67],"can":[68],"work":[69],"cooperatively":[70],"find":[72],"path.":[75],"However,":[76],"ACO":[77],"converges":[78],"slowly":[79],"finding":[81],"path,":[84],"particularly":[85],"for":[86],"case":[88],"when":[89],"problem":[91],"domain":[92],"is":[93,104],"large.":[94],"To":[95],"solve":[96],"this":[97,107],"problem,":[98],"double-ant":[100],"based":[102],"proposed":[105,136],"paper.":[108],"More":[109],"specifically,":[110],"early":[113],"stage":[114],"we":[115],"exploit":[116],"genetic":[117],"generate":[120],"pheromones,":[121],"thus":[122],"accelerating":[123],"convergence":[125],"algorithm.":[128,137],"Numerical":[129],"results":[130],"validate":[131],"effectiveness":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}