{"id":"https://openalex.org/W7103141265","doi":"https://doi.org/10.48550/arxiv.2510.26089","title":"Network-Constrained Policy Optimization for Adaptive Multi-agent Vehicle Routing","display_name":"Network-Constrained Policy Optimization for Adaptive Multi-agent Vehicle Routing","publication_year":2025,"publication_date":"2025-10-30","ids":{"openalex":"https://openalex.org/W7103141265","doi":"https://doi.org/10.48550/arxiv.2510.26089"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2510.26089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.26089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2510.26089","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Arasteh, Fazel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arasteh, Fazel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Haghparast, Arian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haghparast, Arian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Papagelis, Manos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Papagelis, Manos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.3138999938964844,"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.3138999938964844,"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.1264999955892563,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.08879999816417694,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/traffic-congestion","display_name":"Traffic congestion","score":0.5569000244140625},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5519999861717224},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5202000141143799},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.513700008392334},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4814999997615814},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4772000014781952},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.47279998660087585},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.45010000467300415},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.43369999527931213},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.38359999656677246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6399000287055969},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.5569000244140625},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5519999861717224},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5202000141143799},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.513700008392334},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4814999997615814},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.47279998660087585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45419999957084656},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.45010000467300415},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.43369999527931213},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.38359999656677246},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.37040001153945923},{"id":"https://openalex.org/C47796450","wikidata":"https://www.wikidata.org/wiki/Q508378","display_name":"Intelligent transportation system","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.36629998683929443},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3564000129699707},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3531000018119812},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.3529999852180481},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.34459999203681946},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.3269999921321869},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.32109999656677246},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.30709999799728394},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.2858999967575073},{"id":"https://openalex.org/C52970973","wikidata":"https://www.wikidata.org/wiki/Q2497134","display_name":"Adaptive system","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2784999907016754},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.27619999647140503},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2510.26089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.26089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2510.26089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.26089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8191946148872375,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Traffic":[0],"congestion":[1,44,175],"in":[2,31,38,104,238],"urban":[3,188],"road":[4],"networks":[5,211],"leads":[6],"to":[7,123,210,218],"longer":[8],"trip":[9],"times":[10],"and":[11,91,176,186,201,235],"higher":[12],"emissions,":[13],"especially":[14],"during":[15],"peak":[16],"periods.":[17],"While":[18],"the":[19,154,227],"Shortest":[20],"Path":[21],"First":[22],"(SPF)":[23],"algorithm":[24],"is":[25],"optimal":[26],"for":[27,64,179,232],"a":[28,32,58,75],"single":[29],"vehicle":[30,55,162],"static":[33],"network,":[34],"it":[35],"performs":[36],"poorly":[37],"dynamic,":[39],"multi-vehicle":[40],"settings,":[41],"often":[42],"worsening":[43],"by":[45],"routing":[46,56,84,206,237],"all":[47],"vehicles":[48],"along":[49],"identical":[50],"paths.":[51],"We":[52,69],"address":[53],"dynamic":[54],"through":[57],"multi-agent":[59],"reinforcement":[60],"learning":[61,202],"(MARL)":[62],"framework":[63],"coordinated,":[65,234],"network-aware":[66],"fleet":[67],"navigation.":[68],"first":[70],"propose":[71,109],"Adaptive":[72,112],"Navigation":[73,113],"(AN),":[74],"decentralized":[76,150],"MARL":[77,231],"model":[78],"where":[79],"each":[80,139],"intersection":[81],"agent":[82,132],"provides":[83],"guidance":[85],"based":[86],"on":[87,183],"(i)":[88],"local":[89,174],"traffic":[90],"(ii)":[92],"neighborhood":[93],"state":[94,170],"modeled":[95],"using":[96],"Graph":[97],"Attention":[98],"Networks":[99],"(GAT).":[100],"To":[101],"improve":[102],"scalability":[103],"large":[105],"networks,":[106],"we":[107],"further":[108],"Hierarchical":[110],"Hub-based":[111],"(HHAN),":[114],"an":[115],"extension":[116],"of":[117,214,229],"AN":[118,194],"that":[119,172,193],"assigns":[120],"agents":[121,167],"only":[122],"key":[124],"intersections":[125],"(hubs).":[126],"Vehicles":[127],"are":[128],"routed":[129],"hub-to-hub":[130],"under":[131,153,221],"control,":[133],"while":[134],"SPF":[135,200],"handles":[136],"micro-routing":[137],"within":[138],"hub":[140,143],"region.":[141],"For":[142],"coordination,":[144],"HHAN":[145,208],"adopts":[146],"centralized":[147],"training":[148],"with":[149,212],"execution":[151],"(CTDE)":[152],"Attentive":[155],"Q-Mixing":[156],"(A-QMIX)":[157],"framework,":[158],"which":[159],"aggregates":[160],"asynchronous":[161],"decisions":[163],"via":[164],"attention.":[165],"Hub":[166],"use":[168],"flow-aware":[169],"features":[171],"combine":[173],"predictive":[177],"dynamics":[178],"proactive":[180],"routing.":[181],"Experiments":[182],"synthetic":[184],"grids":[185],"real":[187],"maps":[189],"(Toronto,":[190],"Manhattan)":[191],"show":[192],"reduces":[195],"average":[196],"travel":[197],"time":[198],"versus":[199],"baselines,":[203],"maintaining":[204],"100%":[205],"success.":[207],"scales":[209],"hundreds":[213],"intersections,":[215],"achieving":[216],"up":[217],"15.9%":[219],"improvement":[220],"heavy":[222],"traffic.":[223],"These":[224],"findings":[225],"highlight":[226],"potential":[228],"network-constrained":[230],"scalable,":[233],"congestion-aware":[236],"intelligent":[239],"transportation":[240],"systems.":[241]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-11-01T00:00:00"}