摘要
在当今社会生活中,协商已渗透到人类活动的各个方面,自动协商一直是多Agent领域研究的热点之一.近年来,一些学者采用具有非单调特征的回答集程序表示Agent知识,通过回答集程序的相互更新实现协商.虽然目前已经提出一些基于回答集程序的方法来解决协商问题,但这些研究并没有充分考虑协商最优解和协商过程复杂性之间的平衡问题.寻找基于回答集程序的协商解实际上至少是一个NP-难的搜索问题,而回答集程序的良基语义模型在多项式时间内可以计算得到.因此,本文利用良基语义,结合信念修正的思想对协商过程进行优化,从而提出了一个基于良基语义的双边协商模型.该模型可有效缩短协商过程,实现协商最优解和协商过程复杂性之间的平衡.最后,本文通过实验验证了协商模型的有效性和适用性.
In today＇s society,negotiation has permeated all aspects of human activities.The automatic negotiation is a hot topic in the field of the Multi-Agent system.In recent years,some researchers use answer set programs to express the knowledge of agents,and complete the negotiation by updating the answer set programs（ASP）.Though some ASP-based methods have recently been proposed in the negotiation field,yet they fail to take into account the balance between the optimal solution and the complexity of the negotiation process.Finding the negotiation result based on answer set programs is,in essence,an NP-hard searching problem.The model of answer set programs based on the well-founded semantics can be computed in polynomial time.Therefore,this paper combines well-founded semantics with belief revision to optimize the negotiation process,and then proposes a negotiation model based on well-founded semantics for bilateral negotiation.Experiment results have verified that this model can effectively speed up the negotiation process,and achieve the balance between the optimal solution and the complexity of the negotiation process.
作者
高龙云
曾庆华
陈武
GAO Long-yun;ZENG Qing-hua;CHEN Wu(College of Computer ＆ Information Science,Southwest University,Chongqing 400715,China;School of Investigation and Counterterrorism,People＇s Public Security University of China,Beijing)
出处
《西南大学学报（自然科学版）》
CAS
CSCD
北大核心
2018年第10期162-172,共11页
Journal of Southwest University(Natural Science Edition)
基金
国家社科基金重大项目(14ZDB016)
中国人民公安大学2018年度基本科研业务费资助项目(2018JKF612)
关键词
回答集程序
良基语义
信念修正
双边协商
answer set program
well-founded semantics
belief revision
bilateral negotiation
