基于多智能体系统的招标投标系统

探讨了智能体、多智能体系统(MAS)的体系结构,给出了一个多智能体系统的简单例子--智能招标投标管理系统.该系统建立在智能体模板JADE之上,通过该系统,一个企业可以向外发出招标信息,其他企业可对这个招标相应地发出投标请求,最后系统对各个投标进行比较筛选得出最优结果,并把结果发送回招标企业.     

Social Choice Meets Graph Drawing： How to Get Subexponential Time Algorithms for Ranking and Drawing Problems

We analyze a common feature of p-Kemeny AGGregation(p-KAGG) and p-One-Sided Crossing Minimization(p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O.2O.pk logk//,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural above-guarantee versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of votes in the input to p-KAGG is odd the above guarantee version can still be solved in time O.2O.pk logk//, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails(equivalently, unless FPT D M[1]).     

客户化制造系统中MAS的构造方法与技术研究

以分布式人工智能(DAI)为理论基础,构造了基于多智能体系统(MAS)的客户化制造系统以及系统的组织关系,结合MAS技术解决客户化制造系统的资源集成问题。介绍了客户化制造系统中MAS的构造方法和相关技术,并对其系统结构进行分析,较好地解决客户化制造系统的资源集成问题。     

基于孤立波的多Agent系统超分布超并行自组织动态任务规划方法

提出一种孤立波的模型和方法,在一群理性的独立自治的Ａｇｅｎｔ间建立超分布超并行的自组织动态任务分配机制,克服现有的多Ａｇｅｎｔ联盟方式存在的诸多不足,通过关于分布式运输调度系统的仿真实验验证了本分配机制的有效性、动态性、开放性和自适应性。