Explanation and prediction: an architecture for default and abductive reasoning
Computational Intelligence
Argumentation as distributed constraint satisfaction: applications and results
Proceedings of the fifth international conference on Autonomous agents
A protocol for multi-agent diagnosis with spatially distributed knowledge
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Reaching Diagnostic Agreement in Multi-Agent Diagnosis
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Argumentation-based negotiation
The Knowledge Engineering Review
Support-based distributed search: a new approach for multiagent constraint processing
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
ArgMAS'04 Proceedings of the First international conference on Argumentation in Multi-Agent Systems
When agents communicate hypotheses in critical situations
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Abduction of distributed theories through local interactions
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Towards efficient multi-agent abduction protocols
LADS'10 Proceedings of the Third international conference on Languages, methodologies, and development tools for multi-agent systems
| Hi-index | 0.00 |
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally computes its favoured hypothesis and tries to propagate it to other agents, by exchanging hypotheses and supporting arguments (observations). However, we further assume that communication opportunities are severely constrained and change dynamically. In this paper, we mostly investigate the convergence of such systems towards global consistency. We first show that (for a wide class of protocols that we shall define), the communication constraints induced by the topology will not prevent the convergence of the system, at the condition that the system dynamics guarantees that no agent will ever be isolated forever, and that agents have unlimited time for computation and arguments exchange. As this assumption cannot be made in most situations though, we then set up an experimental framework aiming at comparing the relative efficiency and effectiveness of different interaction protocols for hypotheses exchange. We study a critical situation involving a number of agents aiming at escaping from a burning building. The results reported here provide some insights regarding the design of optimal protocol for hypotheses refinement in this context.