Communicating with Unknown Teammates (Extended Abstract)
暂无分享,去创建一个
Past research has investigated a number of methods for coordinating teams of agents, but, with the growing number of sources of agents, it is likely that agents will encounter teammates that do not share their coordination methods. Therefore, it is desirable for agents to form an effective ad hoc team. This research tackles the problem of communication in ad hoc teams, introducing a minimal version of the multiagent, multi-armed bandit problem with limited communication between the agents. This abstract summarizes theoretical results that prove that this problem setting can be solved in polynomial time when the agent knows the set of possible teammates, and the empirical results that show that the problems can be solved in practice.
[1] Joel Veness,et al. Monte-Carlo Planning in Large POMDPs , 2010, NIPS.
[2] Sarit Kraus,et al. Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination , 2010, AAAI.
[3] Nan Rong,et al. What makes some POMDP problems easy to approximate? , 2007, NIPS.
[4] Sarit Kraus,et al. To teach or not to teach?: decision making under uncertainty in ad hoc teams , 2010, AAMAS.