资源分类
》 资源 》论文》Online Planning for Ad Hoc Autonomous Agent Teams Feng Wu Shlomo Zilberstein Xiaoping Chen?

Online Planning for Ad Hoc Autonomous Agent Teams Feng Wu Shlomo Zilberstein Xiaoping Chen?

2019-11-12 | |  53 |   36 |   0
Abstract We propose a novel online planning algorithm for ad hoc team settings—challenging situations in which an agent must collaborate with unknown teammates without prior coordination. Our approach is based on constructing and solving a series of stage games, and then using biased adaptive play to choose actions. The utility function in each stage game is estimated via Monte-Carlo tree search using the UCT algorithm. We establish analytically the convergence of the algorithm and show that it performs well in a variety of ad hoc team domains.

上一篇：Using Gaussian Processes to Optimise Concession in Complex Negotiations against Unknown Opponents

下一篇：A Maximum Likelihood Approach towards Aggregating Partial Orders

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...