• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Intelligent Agent Technology, IEEE/WIC/ACM International Conference on >Solving generalized open constraint optimization problem using two-level multi-agent framework
【24h】

Solving generalized open constraint optimization problem using two-level multi-agent framework

机译：使用两级多主体框架解决广义开放约束优化问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The open constraint optimization problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [B. Faltings et al., (2003)] is based on an unrealistic assumption that agents are willing to report their options in non-decreasing order of cost. In this paper, we study a generalized OCOP where agents are self-interested and not obliged to reveal their private information such as the order of their options with respect to cost. The objective of the generalized OCOP is to find a solution with low total cost and high overall satisfaction level of agents. A two-level structured multi-agent framework has been proposed in the upper level, a neutral central solver allows agents report their preferred options in tiers and find a feasible initial solution from top tiers of options by constraint propagation and guided tiers expansion; in the lower level, agents form coalitions and negotiate among themselves on the initial solution by an argument of persuasive points. Experimental results have shown that this two-level structure yields very promising results that seek a good balance between the total cost of solution and the agents' overall satisfaction level in the long run.
机译：开放式约束优化问题（OCOP）指的是COP，约束和变量域可能随时间而变化，必须在分布式网络上寻求座席的意见以形成解决方案。该问题的公开性已导致COP的常规方法（例如分支定界法）无法找到最佳解决方案。 OCOP是一个新问题，[B。]中介绍了寻找最佳解决方案（最低总成本）的方法。 Faltings et al。，（2003）]基于一个不切实际的假设，即代理商愿意以不降低成本的顺序报告他们的选择。在本文中，我们研究了一种广义的OCOP，在该OCOP中，代理人是自私的，没有义务透露自己的私人信息，例如关于成本的选择顺序。通用OCOP的目标是找到一种解决方案，该解决方案的总成本较低且代理商的总体满意度较高。在上层提出了一个两级结构化的多主体框架，一个中立的中央求解器允许主体在层级中报告其首选选项，并通过约束传播和引导层扩展从顶层选项中找到可行的初始解决方案;在较低的层次上，特工组成联盟，并通过说服力点的论点在初始解决方案之间进行协商。实验结果表明，这种两级结构产生了非常有希望的结果，从长远来看，该解决方案的总成本与代理商的整体满意度之间寻求良好的平衡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号