{"id":"https://openalex.org/W2132759531","doi":"https://doi.org/10.1109/acc.2005.1470521","title":"On the time complexity of conflict-free vehicle routing","display_name":"On the time complexity of conflict-free vehicle routing","publication_year":2005,"publication_date":"2005-08-10","ids":{"openalex":"https://openalex.org/W2132759531","doi":"https://doi.org/10.1109/acc.2005.1470521","mag":"2132759531"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2005.1470521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2005.1470521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005, American Control Conference, 2005.","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/A5016865003","display_name":"Michael A. Savchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Savchenko","raw_affiliation_strings":["Department of AeroSpace Engineering, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","Dept. of Aerosp. Eng., Illinois Univ., Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of AeroSpace Engineering, University of Illinois, Urbana-Champaign, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Aerosp. Eng., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Frazzoli","raw_affiliation_strings":["Department of Mechanical and AeroSpace Engineering, University of California, Los Angeles, Los Angeles, CA, USA","University of California\u2013Los Angeles"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and AeroSpace Engineering, University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California\u2013Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016865003"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.1938,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81619078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3536","last_page":"3541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9887999892234802,"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/transfer","display_name":"Transfer (computing)","score":0.6973873376846313},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6556388139724731},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6200171709060669},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5877088308334351},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5396561622619629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5096008777618408},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.466123104095459},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4352933168411255},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4253455400466919},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.41947031021118164},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4194517135620117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39999520778656006},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.16325056552886963},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15790227055549622},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09276983141899109},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.09149816632270813},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08774024248123169}],"concepts":[{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.6973873376846313},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6556388139724731},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6200171709060669},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5877088308334351},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5396561622619629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5096008777618408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.466123104095459},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4352933168411255},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4253455400466919},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.41947031021118164},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4194517135620117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39999520778656006},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16325056552886963},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15790227055549622},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09276983141899109},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.09149816632270813},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08774024248123169},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/acc.2005.1470521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2005.1470521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005, American Control Conference, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.9824","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.9824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rigoletto.seas.ucla.edu/papers/savchenko.frazzoli.acc05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W50965381","https://openalex.org/W1525594931","https://openalex.org/W1621517136","https://openalex.org/W2010927613","https://openalex.org/W2022020194","https://openalex.org/W2063311962","https://openalex.org/W2092307381","https://openalex.org/W2108190032","https://openalex.org/W2113257089","https://openalex.org/W2137775453","https://openalex.org/W2138361531","https://openalex.org/W2141967156","https://openalex.org/W2166344854","https://openalex.org/W2166462345","https://openalex.org/W2169742265","https://openalex.org/W2404844938","https://openalex.org/W2484302483","https://openalex.org/W4244044799","https://openalex.org/W4250332529","https://openalex.org/W6602072048"],"related_works":["https://openalex.org/W2024560233","https://openalex.org/W2099215853","https://openalex.org/W2108727105","https://openalex.org/W2080164368","https://openalex.org/W1914151578","https://openalex.org/W2293157881","https://openalex.org/W2952355470","https://openalex.org/W2109319440","https://openalex.org/W2337727674","https://openalex.org/W1570402828","https://openalex.org/W2884284953","https://openalex.org/W3204504383","https://openalex.org/W3028595741","https://openalex.org/W2180437209","https://openalex.org/W2783094580","https://openalex.org/W1547792399","https://openalex.org/W2605264528","https://openalex.org/W2101344580","https://openalex.org/W3125337328","https://openalex.org/W2738157923"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,15,19,49,69,74,77,81,92,104,114,140,145,150,153],"following":[6],"problem:":[7],"given":[8],"n":[9],"vehicles":[10,54],"and":[11,44,65,83,109,119,130],"origin-destination":[12],"pairs":[13],"in":[14,76,79,116,149],"plane,":[16],"what":[17],"is":[18,40,55,103],"minimum":[20],"time":[21,70,98,141],"needed":[22,71,142],"to":[23,30,72,99,126],"transfer":[24,93,154],"each":[25],"vehicle":[26],"from":[27],"its":[28,31],"origin":[29,82,118],"destination,":[32],"avoiding":[33],"conflicts":[34],"with":[35],"other":[36],"vehicles?":[37],"The":[38],"environment":[39],"free":[41],"of":[42],"obstacles,":[43],"a":[45,58,127,135],"conflict":[46],"occurs":[47],"when":[48],"distance":[50,106],"between":[51,107],"any":[52],"two":[53],"smaller":[56],"than":[57],"velocity-dependent":[59],"safety":[60],"distance.":[61],"We":[62,111],"derive":[63],"lower":[64],"upper":[66,137],"bounds":[67],"on":[68,139],"complete":[73,144],"transfer,":[75,146],"case":[78,115,152],"which":[80,117],"destination":[84,120],"points":[85,121],"can":[86],"be":[87],"chosen":[88],"arbitrarily,":[89],"proving":[90,147],"that":[91,148],"takes":[94],"/spl":[95],"theta/(/spl":[96],"radic/nL~)":[97],"complete,":[100],"where":[101],"L~":[102],"average":[105],"origins":[108],"destinations.":[110],"also":[112],"analyze":[113],"are":[122],"generated":[123],"randomly":[124],"according":[125],"uniform":[128],"distribution,":[129],"present":[131],"an":[132],"algorithm":[133],"providing":[134],"constructive":[136],"bound":[138],"for":[143],"random":[151],"requires":[155],"O(/spl":[156],"radic/(n":[157],"logn))":[158],"time.":[159]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}