{"id":"https://openalex.org/W1975032830","doi":"https://doi.org/10.1109/icra.2012.6224710","title":"Stochastic distributed multi-agent planning and applications to traffic","display_name":"Stochastic distributed multi-agent planning and applications to traffic","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1975032830","doi":"https://doi.org/10.1109/icra.2012.6224710","mag":"1975032830"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2012.6224710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","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/A5072506078","display_name":"Sejoon Lim","orcid":"https://orcid.org/0000-0003-1917-699X"},"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":"Sejoon Lim","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066830185","display_name":"Daniela Rus","orcid":"https://orcid.org/0000-0001-5473-3566"},"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":"Daniela Rus","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9931,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.94533419,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2873","last_page":"2879"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8005907535552979},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7801060676574707},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7580547332763672},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6381790637969971},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6342869997024536},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5908781290054321},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5602011680603027},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.48271963000297546},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.43653783202171326},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21532270312309265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19872087240219116},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1710180640220642}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8005907535552979},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7801060676574707},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7580547332763672},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6381790637969971},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6342869997024536},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5908781290054321},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5602011680603027},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.48271963000297546},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.43653783202171326},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21532270312309265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19872087240219116},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1710180640220642},{"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2012.6224710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1603765807","https://openalex.org/W1987497363","https://openalex.org/W2006146932","https://openalex.org/W2010043493","https://openalex.org/W2028763295","https://openalex.org/W2037710455","https://openalex.org/W2038606782","https://openalex.org/W2041119249","https://openalex.org/W2042114124","https://openalex.org/W2067884717","https://openalex.org/W2070361724","https://openalex.org/W2092690092","https://openalex.org/W2113692632","https://openalex.org/W2120450837","https://openalex.org/W2125278290","https://openalex.org/W2135222012","https://openalex.org/W2159314501","https://openalex.org/W2159715570","https://openalex.org/W2235269566","https://openalex.org/W2764937720","https://openalex.org/W2987174194","https://openalex.org/W4240896209","https://openalex.org/W6667746989"],"related_works":["https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"This":[0,43],"paper":[1],"proposes":[2],"a":[3,10,20,31],"method":[4,22],"for":[5,26],"multi-agent":[6],"path":[7,33,93],"planning":[8],"on":[9,100,117],"road":[11],"network":[12],"in":[13],"the":[14,40,48,76,97],"presence":[15],"of":[16,78,81,88],"congestion.":[17],"We":[18,95,105],"suggest":[19],"distributed":[21],"to":[23],"find":[24],"paths":[25],"multiple":[27],"agents":[28,83,89],"by":[29,54,111],"introducing":[30],"probabilistic":[32,71],"choice":[34],"achieving":[35],"global":[36,49],"goals":[37,50],"such":[38],"as":[39],"social":[41],"optimum.":[42],"approach,":[44],"which":[45],"shows":[46],"that":[47],"can":[51,61],"be":[52,62],"achieved":[53],"local":[55,59],"processing":[56],"using":[57,66,114],"only":[58],"information,":[60],"parallelized":[63],"and":[64,102,107],"sped-up":[65],"massive":[67],"parallel":[68],"processing.":[69],"The":[70],"assignment":[72],"reliably":[73],"copes":[74],"with":[75],"case":[77],"random":[79,85],"choices":[80],"unidentified":[82],"or":[84],"route":[86],"changes":[87],"who":[90],"ignore":[91],"our":[92,109],"guidance.":[94],"provide":[96],"analytical":[98],"result":[99],"convergence":[101],"running":[103],"time.":[104],"demonstrate":[106],"evaluate":[108],"algorithm":[110],"an":[112],"implementation":[113],"asynchronous":[115],"computation":[116],"multi-core":[118],"computers.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}