{"id":"https://openalex.org/W120100461","doi":null,"title":"Path Planning for Unmanned Vehicles Using Ant Colony Optimization on a Dynamic Voronoi Diagram.","display_name":"Path Planning for Unmanned Vehicles Using Ant Colony Optimization on a Dynamic Voronoi Diagram.","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W120100461","mag":"120100461"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.669","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://abner.ncat.edu/yaohang/publications/icai05yaohangli.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5079316675","display_name":"Yaohang Li","orcid":"https://orcid.org/0000-0003-0178-1876","observed_orcids":["https://orcid.org/0000-0003-0178-1876"]},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yaohang Li","raw_affiliation_strings":["[North Carolina Agricultural and Technical State University]"],"raw_orcid":"https://orcid.org/0000-0003-0178-1876","affiliations":[{"raw_affiliation_string":"[North Carolina Agricultural and Technical State University]","institution_ids":["https://openalex.org/I35777872"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036486129","display_name":"Tao Dong","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Dong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091815113","display_name":"Marwan U. Bikdash","orcid":"https://orcid.org/0000-0002-7333-8227","observed_orcids":["https://orcid.org/0000-0002-7333-8227"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marwan Bikdash","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7333-8227","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035337020","display_name":"Yongduan Song","orcid":"https://orcid.org/0000-0002-2167-1861","observed_orcids":["https://orcid.org/0000-0002-2167-1861"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yongduan Song","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2167-1861","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"716","last_page":"721"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.002099999925121665,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.9789999723434448},{"id":"https://openalex.org/keywords/unmanned-vehicles","display_name":"unmanned vehicles","score":0.9760000109672546},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.996999979019165},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"obstacle avoidance","score":0.8539999723434448},{"id":"https://openalex.org/keywords/nature-inspired-algorithms","display_name":"bio-inspired algorithms","score":0.6970000267028809},{"id":"https://openalex.org/keywords/dynamic-environments","display_name":"dynamic environments","score":0.7269999980926514}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.823925256729126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6591904759407043},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6319643259048462},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6103999614715576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093475818634033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5263672471046448},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.46092769503593445},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.41756951808929443},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.414548397064209},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3253086805343628},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2772180140018463},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2077387571334839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18503329157829285},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1378692388534546},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11021414399147034},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.07542645931243896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.669","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://abner.ncat.edu/yaohang/publications/icai05yaohangli.pdf","raw_type":"text"},{"id":"mag:120100461","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.odu.edu/~yaohang/publications/ICAI05YaohangLi.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419142","display_name":"International Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.428600013256073,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W141232359","https://openalex.org/W1481075119","https://openalex.org/W1566022718","https://openalex.org/W1587263632","https://openalex.org/W1969483458","https://openalex.org/W1993251125","https://openalex.org/W2037294630","https://openalex.org/W2089890700","https://openalex.org/W2107941094","https://openalex.org/W2126554879","https://openalex.org/W2149906774","https://openalex.org/W2167920923","https://openalex.org/W2297395784"],"related_works":["https://openalex.org/W2389542382","https://openalex.org/W2058348659","https://openalex.org/W2388797132","https://openalex.org/W2899959996","https://openalex.org/W2575331287","https://openalex.org/W3128077670","https://openalex.org/W2803550942","https://openalex.org/W1632135351","https://openalex.org/W2391628752","https://openalex.org/W4388692915"],"abstract_inverted_index":{"One":[0],"of":[1,16,26,105,149],"the":[2,14,19,24,27,30,57,81,91,95,103,106,110,114,147],"main":[3],"objectives":[4],"when":[5],"planning":[6,78],"paths":[7,97,136],"for":[8],"unmanned":[9],"vehicles":[10],"is":[11,33,59,67,118,131],"to":[12,121,133,138],"minimizing":[13],"time":[15],"arriving":[17],"at":[18],"given":[20],"destination":[21],"while":[22],"maximizing":[23],"safety":[25],"vehicles.":[28],"If":[29],"operational":[31],"environment":[32,58],"static":[34],"with":[35,61],"perfect":[36],"information,":[37,63],"a":[38,48,74,139],"safe":[39,96],"and":[40,128],"shortest":[41],"path":[42,77],"can":[43],"be":[44],"generated":[45],"by":[46,90],"applying":[47],"traditional":[49],"optimization":[50],"algorithm":[51,66,79],"such":[52],"as":[53,102],"A*.":[54],"However,":[55],"if":[56],"dynamic":[60],"uncertain":[62],"an":[64],"adaptive":[65],"favored.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"propose":[73],"biologically":[75],"inspired":[76],"using":[80],"Ant":[82],"Colony":[83],"Optimization":[84],"(ACO)":[85],"on":[86,113],"obstacle":[87],"geometry":[88],"described":[89],"Voronoi":[92,107,115,127],"diagram.":[93],"Namely,":[94],"between":[98],"obstacles":[99],"are":[100],"chosen":[101],"boundaries":[104],"cells":[108],"centered":[109],"obstacles.":[111],"Based":[112],"diagram,":[116],"ACO":[117,129],"then":[119],"applied":[120],"produce":[122],"quasioptimal":[123],"paths.":[124],"The":[125],"combined":[126],"approach":[130],"expected":[132],"provide":[134],"quasi-optimal":[135],"adaptively":[137],"dynamically":[140],"changing":[141],"environment.":[142],"Our":[143],"preliminary":[144],"results":[145],"confirm":[146],"effectiveness":[148],"our":[150],"approach.":[151],"1.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}