{"id":"https://openalex.org/W4406170823","doi":"https://doi.org/10.1109/tmc.2025.3526979","title":"Cooperative Path Planning With Asynchronous Multiagent Reinforcement Learning","display_name":"Cooperative Path Planning With Asynchronous Multiagent Reinforcement Learning","publication_year":2025,"publication_date":"2025-01-08","ids":{"openalex":"https://openalex.org/W4406170823","doi":"https://doi.org/10.1109/tmc.2025.3526979"},"language":"en","primary_location":{"id":"doi:10.1109/tmc.2025.3526979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2025.3526979","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Mobile Computing","raw_type":"journal-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/A5075608721","display_name":"Jiaming Yin","orcid":"https://orcid.org/0009-0008-6896-8284"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaming Yin","raw_affiliation_strings":["Tongji University, Shanghai, China"],"raw_orcid":"https://orcid.org/0009-0008-6896-8284","affiliations":[{"raw_affiliation_string":"Tongji University, Shanghai, China","institution_ids":["https://openalex.org/I116953780"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016210851","display_name":"Weixiong Rao","orcid":"https://orcid.org/0000-0001-6644-0349"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weixiong Rao","raw_affiliation_strings":["Tongji University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0001-6644-0349","affiliations":[{"raw_affiliation_string":"Tongji University, Shanghai, China","institution_ids":["https://openalex.org/I116953780"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069437467","display_name":"Yu Xiao","orcid":"https://orcid.org/0000-0002-4517-3779"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Yu Xiao","raw_affiliation_strings":["Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-4517-3779","affiliations":[{"raw_affiliation_string":"Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058177475","display_name":"Keshuang Tang","orcid":"https://orcid.org/0000-0002-0476-0512"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Keshuang Tang","raw_affiliation_strings":["Tongji University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0002-0476-0512","affiliations":[{"raw_affiliation_string":"Tongji University, Shanghai, China","institution_ids":["https://openalex.org/I116953780"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6114,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.94972024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"24","issue":"6","first_page":"5016","last_page":"5030"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9973000288009644,"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/T10524","display_name":"Traffic control and management","score":0.9973000288009644,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7509296536445618},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6460492610931396},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6118717193603516},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4762554168701172},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.46414509415626526},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4597073197364807},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4334799647331238},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4200389087200165},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35523760318756104},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.35151106119155884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3364068567752838},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3200317621231079},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3143487274646759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10952797532081604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7509296536445618},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6460492610931396},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6118717193603516},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4762554168701172},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.46414509415626526},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4597073197364807},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4334799647331238},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4200389087200165},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35523760318756104},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35151106119155884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3364068567752838},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3200317621231079},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3143487274646759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10952797532081604},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2025.3526979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2025.3526979","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6378218809","display_name":null,"funder_award_id":"52372319","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2092690092","https://openalex.org/W2096829538","https://openalex.org/W2151715608","https://openalex.org/W2169528473","https://openalex.org/W2579949285","https://openalex.org/W2617547828","https://openalex.org/W2717467853","https://openalex.org/W2747213132","https://openalex.org/W2768254111","https://openalex.org/W2903709398","https://openalex.org/W2950635152","https://openalex.org/W2963658727","https://openalex.org/W2968259729","https://openalex.org/W2968526727","https://openalex.org/W3004339827","https://openalex.org/W3037164854","https://openalex.org/W3155557419","https://openalex.org/W3159284201","https://openalex.org/W3182680493","https://openalex.org/W3182999346","https://openalex.org/W3204124166","https://openalex.org/W4211202045","https://openalex.org/W4212863985","https://openalex.org/W4281260099","https://openalex.org/W4308087336","https://openalex.org/W4309651352","https://openalex.org/W4328007337","https://openalex.org/W4385245566","https://openalex.org/W4385568286","https://openalex.org/W6682459407","https://openalex.org/W6684921986","https://openalex.org/W6725207838","https://openalex.org/W6738796088","https://openalex.org/W6739516088","https://openalex.org/W6741002519","https://openalex.org/W6745537798","https://openalex.org/W6749304979","https://openalex.org/W6758687306","https://openalex.org/W6762491519","https://openalex.org/W6763484891","https://openalex.org/W6840380725","https://openalex.org/W6849140488"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2143461633","https://openalex.org/W2150194458","https://openalex.org/W4321471459","https://openalex.org/W2889071233","https://openalex.org/W2380814829","https://openalex.org/W2387511021"],"abstract_inverted_index":{"As":[0],"the":[1,26,49,115,129,139,154,158,169,172,177,200],"number":[2],"of":[3,53,98,145],"vehicles":[4,63,175],"grows":[5],"in":[6,60,90,160,190],"urban":[7],"cities,":[8],"planning":[9,76,103,208],"vehicle":[10],"routes":[11],"to":[12,47,82,136],"avoid":[13],"congestion":[14],"and":[15,80,100,143,182,196],"decrease":[16,157],"commuting":[17],"time":[18,52],"is":[19],"important.":[20],"In":[21],"this":[22,88,91],"paper,":[23,92],"we":[24,93],"study":[25],"shortest":[27],"path":[28],"problem":[29],"(SPP)":[30],"with":[31,164],"<italic":[32,36,40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[33,37,41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</i>":[34],"ultiple":[35],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">s</i>":[38],"ource-":[39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</i>":[42],"estination":[43],"pairs,":[44],"namely":[45],"MSD-SPP,":[46,61],"minimize":[48],"average":[50],"travel":[51],"all":[54],"routing":[55,68,191],"paths.":[56,192],"The":[57],"asynchronous":[58,121],"setting":[59],"i.e.,":[62],"may":[64],"not":[65],"simultaneously":[66],"complete":[67],"actions,":[69],"makes":[70],"it":[71],"challenging":[72],"for":[73],"cooperative":[74],"route":[75,84,102],"among":[77,174],"multiple":[78,111],"agents":[79],"leads":[81],"ineffective":[83],"planning.":[85],"To":[86],"tackle":[87],"issue,":[89],"propose":[94],"a":[95,132,149,165,183],"two-stage":[96],"framework":[97],"inter-region":[99],"intra-region":[101],"by":[104,124,148],"dividing":[105],"an":[106],"entire":[107],"road":[108,198],"network":[109],"into":[110],"sub-graph":[112],"regions.":[113],"Next,":[114],"proposed":[116],"asyn-MARL":[117,205],"model":[118,130,155,170],"allows":[119],"efficient":[120],"multi-agent":[122],"learning":[123],"three":[125],"key":[126],"techniques.":[127],"Firstly,":[128],"adopts":[131],"low-dimensional":[133],"global":[134],"state":[135],"implicitly":[137],"represent":[138],"high-dimensional":[140],"joint":[141],"observations":[142],"actions":[144],"multi-agents.":[146],"Secondly,":[147],"novel":[150,166],"trajectory":[151],"collection":[152],"mechanism,":[153],"can":[156,186],"redundancy":[159],"training":[161],"trajectories.":[162],"Additionally,":[163],"actor":[167],"network,":[168],"facilitates":[171],"cooperation":[173],"towards":[176],"same":[178],"or":[179],"close":[180],"destinations,":[181],"reachability":[184],"graph":[185],"prevent":[187],"infinite":[188],"loops":[189],"On":[193],"both":[194],"synthetic":[195],"real":[197],"networks,":[199],"evaluation":[201],"result":[202],"demonstrates":[203],"that":[204],"outperforms":[206],"state-of-the-art":[207],"approaches.":[209]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}