{"id":"https://openalex.org/W4380537438","doi":"https://doi.org/10.1109/lcsys.2023.3285655","title":"State Aggregation for Distributed Value Iteration in Dynamic Programming","display_name":"State Aggregation for Distributed Value Iteration in Dynamic Programming","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4380537438","doi":"https://doi.org/10.1109/lcsys.2023.3285655"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2023.3285655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2023.3285655","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","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/A5089227448","display_name":"Nikolaus Vertovec","orcid":"https://orcid.org/0000-0003-4244-8623"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nikolaus Vertovec","raw_affiliation_strings":["Department of Engineering Science, University of Oxford, Oxford, U.K"],"raw_orcid":"https://orcid.org/0000-0003-4244-8623","affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000801527","display_name":"Kostas Margellos","orcid":"https://orcid.org/0000-0001-8865-8568"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kostas Margellos","raw_affiliation_strings":["Department of Engineering Science, University of Oxford, Oxford, U.K"],"raw_orcid":"https://orcid.org/0000-0001-8865-8568","affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7219,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77896033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"7","issue":null,"first_page":"2269","last_page":"2274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9958999752998352,"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.9958999752998352,"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/T11182","display_name":"Auction Theory and Applications","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9523000121116638,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.7209457755088806},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6261906623840332},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5725052356719971},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5693504810333252},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5441095232963562},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.520541787147522},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5203406810760498},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.502338171005249},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46338972449302673},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4295955300331116},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3876434862613678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24646958708763123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1828090250492096},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17211434245109558}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7209457755088806},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6261906623840332},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5725052356719971},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5693504810333252},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5441095232963562},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.520541787147522},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5203406810760498},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.502338171005249},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46338972449302673},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4295955300331116},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3876434862613678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24646958708763123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1828090250492096},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17211434245109558},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/lcsys.2023.3285655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2023.3285655","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8399999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1993629555","https://openalex.org/W2044212084","https://openalex.org/W2047953381","https://openalex.org/W2095876516","https://openalex.org/W2169982856","https://openalex.org/W2400458653","https://openalex.org/W2947958009","https://openalex.org/W3102905931","https://openalex.org/W4224312298","https://openalex.org/W4292072218","https://openalex.org/W4320232511","https://openalex.org/W6762191990","https://openalex.org/W6810249335","https://openalex.org/W6849418317"],"related_works":["https://openalex.org/W4255265352","https://openalex.org/W4239477580","https://openalex.org/W2952594763","https://openalex.org/W4285537323","https://openalex.org/W1932159282","https://openalex.org/W2090698372","https://openalex.org/W4383890581","https://openalex.org/W2921905705","https://openalex.org/W4233178034","https://openalex.org/W2003293420"],"abstract_inverted_index":{"We":[0,28,89],"propose":[1],"a":[2,7,100,113],"distributed":[3,96,128],"algorithm":[4,35],"to":[5,47,81,99,112],"solve":[6],"dynamic":[8],"programming":[9],"problem":[10],"with":[11,45,122,130],"multiple":[12],"agents,":[13,65],"where":[14],"each":[15],"agent":[16],"has":[17],"only":[18,74],"partial":[19],"knowledge":[20],"of":[21,40,85,93],"the":[22,33,41,52,76,83,91,94,109],"state":[23,66],"transition":[24],"probabilities":[25],"and":[26,36,70,117],"costs.":[27],"provide":[29],"consensus":[30],"proofs":[31],"for":[32,126],"presented":[34],"derive":[37],"error":[38],"bounds":[39],"obtained":[42,55],"value":[43,58],"function":[44],"respect":[46],"what":[48],"is":[49],"considered":[50],"as":[51],"\"true":[53],"solution\"":[54],"from":[56],"conventional":[57],"iteration.":[59],"To":[60],"minimize":[61],"communication":[62,132],"overhead":[63],"between":[64,72,133],"costs":[67,78],"are":[68,79],"aggregated":[69],"shared":[71],"agents":[73,87,107,124],"when":[75],"updated":[77],"expected":[80],"influence":[82],"solution":[84],"other":[86,123],"significantly.":[88],"demonstrate":[90],"efficacy":[92],"proposed":[95],"aggregation":[97],"method":[98],"large-scale":[101],"urban":[102],"traffic":[103],"routing":[104,129],"problem.":[105],"Individual":[106],"compute":[108],"fastest":[110],"route":[111],"common":[114],"access":[115],"point":[116],"share":[118],"local":[119],"congestion":[120],"information":[121],"allowing":[125],"fully":[127],"minimal":[131],"agents.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}