{"title":"A Scalable Real-Time Multiagent Decision Making Algorithm with Cost","authors":"P. Cotae, Myong Kang, Alexander Velazquez","doi":"10.1109/ISCC53001.2021.9631510","DOIUrl":null,"url":null,"abstract":"We focus on a real-time multiagent decision making problem in a collaborative setting including a cost factor for the planning and execution of actions. We present the centralized coordination of a multiagent system in which the team must make a collaborative decision to maximize the global payoff. We used the framework of Coordination Graphs, which exploit dependencies among agents to decompose the global payoff function value as the sum of local terms. We revise the centralized Max-Plus algorithm by presenting a new Cost Max-Plus algorithm for planning and acting by including the cost in the local interactions of agents. We propose a two-step planning and acting algorithm called Factored Value-MCTS-Cost-Max-Plus algorithm that is online, anytime, and scalable in terms of the number of agents and their local interactions.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC53001.2021.9631510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We focus on a real-time multiagent decision making problem in a collaborative setting including a cost factor for the planning and execution of actions. We present the centralized coordination of a multiagent system in which the team must make a collaborative decision to maximize the global payoff. We used the framework of Coordination Graphs, which exploit dependencies among agents to decompose the global payoff function value as the sum of local terms. We revise the centralized Max-Plus algorithm by presenting a new Cost Max-Plus algorithm for planning and acting by including the cost in the local interactions of agents. We propose a two-step planning and acting algorithm called Factored Value-MCTS-Cost-Max-Plus algorithm that is online, anytime, and scalable in terms of the number of agents and their local interactions.