Online Planning for Ad Hoc Autonomous Agent Teams
Lists
Only you see this
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.
BibTeX
@inproceedings{wu2011online,
author = {Feng Wu and Shlomo Zilberstein and Xiaoping Chen},
title = {{Online Planning for Ad Hoc Autonomous Agent Teams}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
doi = {10.5591/978-1-57735-516-8/ijcai11-081},
}