• Sorted by Date • Classified by Publication Type • Classified by Topic • Grouped by Student (current) • Grouped by Former Students •
Meir Kalech and Gal A. Kaminka.
On the design of coordinated diagnosis algorithms for teams of situated agents. Artificial Intelligence,
171:491–513, 2007.
Teamwork demands agreement among team-members to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally diagnose its causes, to resolve the disagreement. Such diagnosis of social failures can be expensive in communication and computation, challenges which previous work did not address. We present a novel design space of diagnosis algorithms, distinguishing several phases in the diagnosis process, and providing alternative algorithms for each phase. We then combine these algorithms in different ways to empirically explore specific design choices in a complex domain, on thousands of failure cases. The results show that different phases of diagnosis affect communication and computation overhead. In particular, centralizing the diagnosis disambiguation process is a key factor in reducing communications, while runtime is affected mainly by the amount of reasoning about other agents. These results contrast with previous work in disagreement detection (without diagnosis), in which distributed algorithms reduce communications.
The article's official web page is at: http://dx.doi.org/10.1016/j.artint.2007.03.005.
@Article{aij07meir,
author = {Meir Kalech and Gal A. Kaminka},
title = {On the design of coordinated diagnosis algorithms for teams of situated agents},
journal = AIJ,
year = {2007},
OPTnote = {In Press},
abstract = {Teamwork demands agreement among team-members to collaborate and coordinate
effectively. When a disagreement between teammates occurs (due to failures), team-members
should ideally diagnose its causes, to resolve the disagreement.
Such diagnosis of social failures can be expensive in communication and computation,
challenges which previous work did not address. We present a
novel design space of diagnosis algorithms, distinguishing several phases in the diagnosis process,
and providing alternative algorithms for each phase. We then combine these algorithms
in different ways to empirically explore specific design choices in a complex domain,
on thousands of failure cases. The results show that different phases of diagnosis affect
communication and computation overhead. In particular, centralizing the diagnosis
disambiguation process is a key factor in reducing communications, while runtime is
affected mainly by the amount of reasoning about other agents. These results contrast
with previous work in disagreement detection (without diagnosis), in which distributed algorithms
reduce communications.
},
wwwnote = {},
volume = {171},
pages = {491--513}
}
Generated by bib2html.pl (written by Patrick Riley ) on Fri Aug 30, 2024 17:29:51