Online Planning for Ad Hoc Autonomous Agent Teams

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.

Cite

Text

Wu et al. "Online Planning for Ad Hoc Autonomous Agent Teams." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-081

Markdown

[Wu et al. "Online Planning for Ad Hoc Autonomous Agent Teams." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/wu2011ijcai-online/) doi:10.5591/978-1-57735-516-8/IJCAI11-081

BibTeX

@inproceedings{wu2011ijcai-online,
  title     = {{Online Planning for Ad Hoc Autonomous Agent Teams}},
  author    = {Wu, Feng and Zilberstein, Shlomo and Chen, Xiaoping},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {439-445},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-081},
  url       = {https://mlanthology.org/ijcai/2011/wu2011ijcai-online/}
}