{"id":"https://openalex.org/W2102267674","doi":"https://doi.org/10.1109/tac.2009.2028954","title":"Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications","display_name":"Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications","publication_year":2009,"publication_date":"2009-09-24","ids":{"openalex":"https://openalex.org/W2102267674","doi":"https://doi.org/10.1109/tac.2009.2028954","mag":"2102267674"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2009.2028954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2009.2028954","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/52393","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025148002","display_name":"Alessandro Arsie","orcid":"https://orcid.org/0000-0003-4789-2942"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Arsie","raw_affiliation_strings":["Mathematics Department, Pennslyvania State University, University Park, PA, USA","Math. Dept., Penn State Univ., University Park, PA, USA"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, Pennslyvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Math. Dept., Penn State Univ., University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007642972","display_name":"Ketan Savla","orcid":"https://orcid.org/0000-0002-1668-6380"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Savla","raw_affiliation_strings":["Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Frazzoli","raw_affiliation_strings":["Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025148002"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":11.6015,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.98685664,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"54","issue":"10","first_page":"2302","last_page":"2317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9926999807357788,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.666710615158081},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6137808561325073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6110572218894958},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5567044019699097},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5111430287361145},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4980790615081787},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.49312636256217957},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46998465061187744},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.426052451133728},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4238305985927582},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.39569413661956787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.289961576461792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2250351905822754},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1471085250377655},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1104745864868164}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.666710615158081},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6137808561325073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6110572218894958},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5567044019699097},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5111430287361145},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4980790615081787},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.49312636256217957},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46998465061187744},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.426052451133728},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4238305985927582},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39569413661956787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.289961576461792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2250351905822754},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1471085250377655},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1104745864868164},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tac.2009.2028954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2009.2028954","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/52393","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/52393","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/JournalArticle"},{"id":"pmh:oai:dspace.mit.edu:1721.1/65574","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/65574","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/52393","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/52393","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/JournalArticle"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G177218894","display_name":null,"funder_award_id":"F49620","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G265221976","display_name":"ITR:     Collaborative Research:    Efficient Resource  Management for Controlled-Mobility Wireless Networks","funder_award_id":"0325716","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2881464794","display_name":"Collaborative Research: Teamwork vs. Congestion: the Role of Scale in Large Mobile Networks","funder_award_id":"0705451","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5511453730","display_name":null,"funder_award_id":"F49620-02-1-0325","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G6838376832","display_name":null,"funder_award_id":"0715025","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8942040496","display_name":"Collaborative Research: Dynamic Task-Based Coordination of Large-Scale Mobile Robotic Networks","funder_award_id":"0705453","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W120396658","https://openalex.org/W646347605","https://openalex.org/W925666063","https://openalex.org/W1496560004","https://openalex.org/W1499554562","https://openalex.org/W1748141295","https://openalex.org/W1896980290","https://openalex.org/W1931280659","https://openalex.org/W1971739135","https://openalex.org/W1984648987","https://openalex.org/W1993823177","https://openalex.org/W2008114725","https://openalex.org/W2017714866","https://openalex.org/W2042544091","https://openalex.org/W2050632537","https://openalex.org/W2054129049","https://openalex.org/W2060223209","https://openalex.org/W2066767736","https://openalex.org/W2106994558","https://openalex.org/W2109341366","https://openalex.org/W2112686410","https://openalex.org/W2113702258","https://openalex.org/W2116614247","https://openalex.org/W2122061813","https://openalex.org/W2127218421","https://openalex.org/W2129942075","https://openalex.org/W2131923105","https://openalex.org/W2150593711","https://openalex.org/W2161779238","https://openalex.org/W2166635235","https://openalex.org/W2167485994","https://openalex.org/W2168003214","https://openalex.org/W2170357061","https://openalex.org/W2171863654","https://openalex.org/W2392726451","https://openalex.org/W2617045890","https://openalex.org/W3022321359","https://openalex.org/W3111753423","https://openalex.org/W4285719527","https://openalex.org/W6637790998","https://openalex.org/W6665464585"],"related_works":["https://openalex.org/W4213214852","https://openalex.org/W4210735314","https://openalex.org/W1589140671","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W1993731165","https://openalex.org/W2095860056","https://openalex.org/W2742871814","https://openalex.org/W2802778578"],"abstract_inverted_index":{"In":[0,95],"this":[1],"paper,":[2],"we":[3,98,141],"consider":[4],"a":[5,14,30,52,154],"class":[6],"of":[7,16,51,63,85,108,116,132,135,158,172],"dynamic":[8],"vehicle":[9],"routing":[10],"problems,":[11],"in":[12,19,41,153,161],"which":[13,162],"number":[15],"mobile":[17],"agents":[18],"the":[20,45,49,56,64,82,90,106,114,119,123,130,133,136,159,169,173,178],"plane":[21],"must":[22],"visit":[23],"target":[24,53,180],"points":[25],"generated":[26],"over":[27],"time":[28,47,57],"by":[29,61,89],"stochastic":[31,138],"process.":[32,139],"It":[33],"is":[34,59,166],"desired":[35],"to":[36,43,118,167],"design":[37],"motion":[38],"coordination":[39],"strategies":[40,69,125,146],"order":[42],"minimize":[44],"expected":[46,170],"between":[48,79],"appearance":[50],"point":[54],"and":[55,186],"it":[58],"visited":[60],"one":[62],"agents.":[65],"We":[66],"propose":[67],"control":[68],"that,":[70],"while":[71],"making":[72],"minimal":[73],"or":[74],"no":[75],"assumptions":[76],"on":[77,129],"communications":[78],"agents,":[80],"provide":[81],"same":[83],"level":[84],"steady-state":[86],"performance":[87],"achieved":[88],"best":[91],"known":[92],"decentralized":[93],"strategies.":[94],"other":[96],"words,":[97],"demonstrate":[99],"that":[100,143],"inter-agent":[101],"communication":[102],"does":[103],"not":[104,127],"improve":[105],"efficiency":[107],"such":[109],"systems,":[110],"but":[111],"merely":[112],"affects":[113],"rate":[115],"convergence":[117],"steady":[120],"state.":[121],"Furthermore,":[122],"proposed":[124,145],"do":[126],"rely":[128],"knowledge":[131],"details":[134],"underlying":[137],"Finally,":[140],"show":[142],"our":[144],"yield":[147],"an":[148],"efficient,":[149],"pure":[150],"Nash":[151],"equilibrium":[152],"game":[155],"theoretic":[156],"formulation":[157],"problem,":[160],"each":[163],"agent's":[164],"objective":[165],"maximize":[168],"value":[171],"ldquotime":[174],"spent":[175],"alonerdquo":[176],"at":[177],"next":[179],"location.":[181],"Simulation":[182],"results":[183],"are":[184],"presented":[185],"discussed.":[187]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}