基于主Agent信念修正的推测计算及其资源协商

基于假设推理(abduction-based)的推测计算(speculative computation)是在资源信息不能及时到达时,利用缺省假设进行计算的过程.在计算过程中,如果应答和信念不一致,则主Agent将修正它的信念.为了实现目标,在有限时间内使推测计算的结果更精确,主Agent要通过协商获得尽可能多的实际信息,协商是降低决策风险的主要途径.在介绍假设推理和推测计算的基本原理的基础上,提出了基于时间约束的推测计算扩展框架、基于时间约束的进一步协商框架和基于信念修正的协商算法,并将进一步协商框架和协商算法嵌入到推测计算的过程中,在协商过程中赋予主Agent更强的信念修正能力.最后,在货物运输领域的实验中,证实了基于信念修正的推测计算的有效性.

Speculative Computation Based on Master Agent Belief Revision and Its Resource Negotiation

Abduction-Based speculative computation is a process which uses default hypothesis as tentative answer and continues computation when resources information cannot be obtained in time. In a computing process, if response is not consistent with belief, master Agent will revise its belief. To achieve goals, get the more accurate result of computation and reduce risks of decision under time constraints, the master Agent in speculative computation should make efforts to obtain more information via negotiation, so the negotiation is a key measure in reducing risks of decision. In this paper, basic theories of abduction and speculative computation are introduced. Based on these theories, a framework extended from the speculative computation with belief revision based on time constraints is presented, and the further negotiation framework based on time constraints and negotiation algorithm with belief revision are presented. The algorithm is embedded in speculative computation to make the master Agent revise its belief during negotiation. Finally, three experiments on goods transportation are given. The experimental results indicate that the algorithm can improve the accuracy of result of the speculative computation and reduce the risk of the result.