Speculative computation by abduction under incomplete communication environments
Speculative computation by abduction under incomplete communication environments
复制标题
不完全通信环境下的绑架推测计算
DOI：
10.1109/icmas.2000.858462
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Chiaki Sakama
中科院分区：
文献类型：
--
作者：
K. Satoh;K. Inoue;K. Iwanuma;Chiaki Sakama
当无法保证代理之间的通信时，我们会在多代理系统中提出解决问题的方法。为了解决不完整的通信问题，我们提出了一种使用绑架的方法。这个想法如下。当通信延迟或失败时，我们将使用默认假设作为暂定答案并继续计算。当获得一些响应时，我们会检查响应和当前计算的一致性。如果响应是一致的，那么我们将继续当前的计算，否则如果响应不一致，我们会寻求替代计算。这种计算方式称为投机性计算，因为使用暂定答案的计算将导致其成功的重要优势。在本文中，我们将注意力限制在主奴隶多代理系统上，并提出投机计算的实施，并表明绑架在投机计算中起着重要作用。
We present a method of problem solving in multi-agent systems when communication between agents is not guaranteed. To solve the problem of incomplete communication, we propose a method using abduction. The idea is as follows. When communication is delayed or failed, then we use a default hypothesis as a tentative answer and continue computation. When some response is obtained, we check consistency of the response and the current computation. If the response is consistent, then we continue the current computation, or else if the response is inconsistent, we seek an alternative computation. This way of computation is called speculative computation, since computation using a tentative answer would lead to a significant advantage if it succeeds. In this paper, we restrict our attention to a master-slave multi-agent system and propose an implementation of speculative computation and show that abduction plays an important role in speculative computation.