{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T06:29:25Z","timestamp":1762928965751},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>We present a scalable planning algorithm for multi-agent sequential decision problems that require dynamic collaboration.\n\nTeams of agents need to coordinate decisions in many domains,\n\nbut naive approaches fail due to the exponential growth of the joint action space with the number of agents.\n\nWe circumvent this complexity through an anytime approach that allows us to trade computation for\n\napproximation quality and also dynamically coordinate actions. \n\nOur algorithm comprises three elements: online planning with Monte Carlo\n\nTree Search (MCTS), factorizing local agent interactions with coordination graphs, and\n\nselecting optimal joint actions with the Max-Plus method.\n\nOn the benchmark SysAdmin domain with static coordination graphs, our approach achieves comparable performance with much lower computation cost than the MCTS baselines.\n\nWe also introduce a multi-drone delivery domain with dynamic, i.e., state-dependent coordination graphs, and demonstrate how our approach scales to large problems on this domain that are intractable for other MCTS methods.<\/jats:p>","DOI":"10.24963\/ijcai.2022\/735","type":"proceedings-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T22:55:56Z","timestamp":1657925756000},"page":"5279-5283","source":"Crossref","is-referenced-by-count":2,"title":["Scalable Anytime Planning for Multi-Agent MDPs (Extended Abstract)"],"prefix":"10.24963","author":[{"given":"Shushman","family":"Choudhury","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayesh K.","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mykel J.","family":"Kochenderfer","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"31","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2022","name":"Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}","start":{"date-parts":[[2022,7,23]]},"theme":"Artificial Intelligence","location":"Vienna, Austria","end":{"date-parts":[[2022,7,29]]}},"container-title":["Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T07:11:20Z","timestamp":1658128280000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2022\/735"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2022\/735","relation":{},"subject":[],"published":{"date-parts":[[2022,7]]}}}