Robust Agent Teams via Socially-Attentive Monitoring
Abstract
Agents in dynamic multi-agent environments must monitor their peers to execute individual and group plans. A key open question is how much monitoring of other agents' states is required to be effective: The Monitoring Selectivity Problem. We investigate this question in the context of detecting failures in teams of cooperating agents, via Socially-Attentive Monitoring, which focuses on monitoring for failures in the social relationships between the agents. We empirically and analytically explore a family of socially-attentive teamwork monitoring algorithms in two dynamic, complex, multi-agent domains, under varying conditions of task distribution and uncertainty. We show that a centralized scheme using a complex algorithm trades correctness for completeness and requires monitoring all teammates. In contrast, a simple distributed teamwork monitoring algorithm results in correct and complete detection of teamwork failures, despite relying on limited, uncertain knowledge, and monitoring only key agents in a team. In addition, we report on the design of a socially-attentive monitoring system and demonstrate its generality in monitoring several coordination relationships, diagnosing detected failures, and both on-line and off-line applications.
Cite
Text
Kaminka and Tambe. "Robust Agent Teams via Socially-Attentive Monitoring." Journal of Artificial Intelligence Research, 2000. doi:10.1613/JAIR.682Markdown
[Kaminka and Tambe. "Robust Agent Teams via Socially-Attentive Monitoring." Journal of Artificial Intelligence Research, 2000.](https://mlanthology.org/jair/2000/kaminka2000jair-robust/) doi:10.1613/JAIR.682BibTeX
@article{kaminka2000jair-robust,
title = {{Robust Agent Teams via Socially-Attentive Monitoring}},
author = {Kaminka, Gal A. and Tambe, Milind},
journal = {Journal of Artificial Intelligence Research},
year = {2000},
pages = {105-147},
doi = {10.1613/JAIR.682},
volume = {12},
url = {https://mlanthology.org/jair/2000/kaminka2000jair-robust/}
}