求解连续分布约束优化问题的人工蜂群算法
An Artificial Bee Colony Based Algorithm for Continuous Distributed Constraint Optimization Problems
摘要:
分布式约束优化问题(DCOPs)是一种常用的框架,其中一组独立的代理从各自的离散域中选择值以最大化其效用。虽然这个公式通常是合适的,有一些现实世界的应用程序中,决策变量是连续值和约束条件表示在功能的形式。为了解决这一问题,连续分布约束优化问题(C-DCOPs),DCOPs范式的扩展,最近增长的多智能体系统领域的兴趣。迄今为止,在不同的方法中,基于种群的算法被证明是最有效的解决C-DCOP。考虑到基于种群的方法的潜力,我们提出了一个新的C-DCOPs求解器的灵感来自一个著名的基于种群的算法人工蜂群(ABC)。此外,我们提供了一个新的探索方法,有助于进一步提高算法的解决方案的质量。最后,我们从理论上证明了我们的方法是一个随时算法和经验表明,它产生了显着更好的结果比最先进的C-DCOPs算法。
英文摘要:
Distributed Constraint Optimization Problems (DCOPs) are a frequently used framework in which a set of independent agents choose values from their respective discrete domains to maximize their utility. Although this formulation is typically appropriate, there are a number of real-world applications in which the decision variables are continuous-valued and the constraints are represented in functional form. To address this, Continuous Distributed Constraint Optimization Problems (C-DCOPs), an extension of the DCOPs paradigm, have recently grown the interest of the multi-agent systems field. To date, among different approaches, population-based algorithms are shown to be most effective for solving C-DCOPs. Considering the potential of population-based approaches, we propose a new C-DCOPs solver inspired by a well-known population-based algorithm Artificial Bee Colony (ABC). Additionally, we provide a new exploration method that aids in the further improvement of the algorithm's solution quality. Finally, We theoretically prove that our approach is an anytime algorithm and empirically show it produces significantly better results than the state-of-the-art C-DCOPs algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。