{"id":"https://openalex.org/W4399344737","doi":"https://doi.org/10.1109/lra.2024.3409028","title":"Distributed Online Planning for Min-Max Problems in Networked Markov Games","display_name":"Distributed Online Planning for Min-Max Problems in Networked Markov Games","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4399344737","doi":"https://doi.org/10.1109/lra.2024.3409028"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2024.3409028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2024.3409028","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation 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/A5056631676","display_name":"Alexandros E. Tzikas","orcid":"https://orcid.org/0000-0002-3003-4880"},"institutions":[{"id":"https://openalex.org/I13805885","display_name":"Vaughn College of Aeronautics and Technology","ror":"https://ror.org/056e22e24","country_code":"US","type":"education","lineage":["https://openalex.org/I13805885"]},{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandros E. Tzikas","raw_affiliation_strings":["Department of Aeronautics and Astronautics, Stanford University, Stanford, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-3003-4880","affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I13805885","https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023509025","display_name":"Jinkyoo Park","orcid":"https://orcid.org/0000-0003-2620-1479"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinkyoo Park","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-2620-1479","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068326377","display_name":"Mykel J. Kochenderfer","orcid":"https://orcid.org/0000-0002-7238-9663"},"institutions":[{"id":"https://openalex.org/I13805885","display_name":"Vaughn College of Aeronautics and Technology","ror":"https://ror.org/056e22e24","country_code":"US","type":"education","lineage":["https://openalex.org/I13805885"]},{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mykel J. Kochenderfer","raw_affiliation_strings":["Department of Aeronautics and Astronautics, Stanford University, Stanford, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-7238-9663","affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I13805885","https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005883173","display_name":"Ross Allen","orcid":"https://orcid.org/0000-0003-3730-641X"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ross E. Allen","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-3730-641X","affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5682,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65577592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"9","issue":"7","first_page":"6656","last_page":"6663"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9714000225067139,"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/T12288","display_name":"Optimization and Search Problems","score":0.9714000225067139,"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.9441999793052673,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.6062610149383545},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5205477476119995},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41348594427108765},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10576954483985901}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6062610149383545},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5205477476119995},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41348594427108765},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10576954483985901}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2024.3409028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2024.3409028","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6990504886","display_name":null,"funder_award_id":"FA8702-15-D-0001","funder_id":"https://openalex.org/F2628460836","funder_display_name":"Office of the Under Secretary of Defense for Research and Engineering"}],"funders":[{"id":"https://openalex.org/F2628460836","display_name":"Office of the Under Secretary of Defense for Research and Engineering","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W613360614","https://openalex.org/W1542941925","https://openalex.org/W1918371733","https://openalex.org/W2000540095","https://openalex.org/W2178935672","https://openalex.org/W2791580684","https://openalex.org/W2795496197","https://openalex.org/W2803119945","https://openalex.org/W2954742730","https://openalex.org/W2991046523","https://openalex.org/W3011232183","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W4301501993","https://openalex.org/W4391454149","https://openalex.org/W4391791311","https://openalex.org/W6632491985","https://openalex.org/W6633472260","https://openalex.org/W6678721897","https://openalex.org/W6728155968","https://openalex.org/W6758518918","https://openalex.org/W6787397593","https://openalex.org/W6788321218","https://openalex.org/W6789076383","https://openalex.org/W6922480057"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2382290278","https://openalex.org/W4395014643"],"abstract_inverted_index":{"Min-max":[0],"problems":[1],"are":[2,66],"important":[3],"in":[4,17,47,72],"multi-agent":[5,23],"sequential":[6],"decision-making":[7],"because":[8],"they":[9],"improve":[10],"the":[11,14,18,22,41,44,53,61,73,87,106,127,133,138,141,151,161,165],"performance":[12,172],"of":[13,43,79,117,125,129,164],"worst-performing":[15],"agent":[16,91,112],"network.":[19],"However,":[20],"solving":[21],"min-max":[24,45],"problem":[25],"is":[26,37,70],"challenging.":[27],"We":[28,168],"propose":[29],"a":[30,57,114,123,144],"modular,":[31],"distributed,":[32],"online":[33,103,109],"planning-based":[34],"algorithm":[35],"that":[36,52,148],"able":[38],"to":[39,150],"approximate":[40],"solution":[42],"objective":[46],"networked":[48],"Markov":[49],"games,":[50],"assuming":[51],"agents":[54,142],"communicate":[55],"within":[56],"network":[58],"topology":[59],"and":[60,63],"transition":[62],"reward":[64,99],"functions":[65],"neighborhood-dependent.":[67],"This":[68],"set-up":[69],"encountered":[71],"multi-robot":[74],"setting.":[75],"Our":[76],"method":[77],"consists":[78],"two":[80],"phases":[81],"at":[82,132],"every":[83],"planning":[84,135],"step.":[85,136],"In":[86,137],"first":[88,166],"phase,":[89,140],"each":[90,111,157],"obtains":[92],"sample":[93],"returns":[94],"based":[95,159],"on":[96,160],"its":[97,118,130],"local":[98,120],"function,":[100],"by":[101],"performing":[102],"planning.":[104],"Using":[105],"samples":[107],"from":[108],"planning,":[110],"constructs":[113],"concave":[115],"approximation":[116],"underlying":[119],"return":[121],"as":[122],"function":[124,162],"only":[126],"action":[128,155],"neighborhood":[131],"next":[134,154],"second":[139],"deploy":[143],"distributed":[145],"optimization":[146],"framework":[147],"converges":[149],"optimal":[152],"immediate":[153],"for":[156],"agent,":[158],"approximations":[163],"phase.":[167],"demonstrate":[169],"our":[170],"algorithm's":[171],"through":[173],"formation":[174],"control":[175],"simulations.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}