Asynchronous Partial Overlay:一种求解分布式约束满足问题的新算法
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
摘要:
分布式约束满足(DCSP)一直是多智能体系统研究中的一个重要问题。这是因为许多现实世界的问题可以表示为约束满足,这些问题往往以分布式的形式出现。在这篇文章中,我们提出了一个新的完整的,分布式的算法称为异步部分覆盖(APO)解决DCSP是基于一个合作的调解过程。该算法背后的主要思想是,代理,当作为一个调解人,集中小,相关部分的DCSP,这些集中的子问题重叠,以及代理增加其子问题的大小沿关键路线内的DCSP的问题解决展开。我们提出的经验证据表明,APO优于其他已知的,完整的DCSP技术。
英文摘要:
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint satisfaction and these problems often present themselves in a distributed form. In this article, we present a new complete, distributed algorithm called Asynchronous Partial Overlay (APO) for solving DCSPs that is based on a cooperative mediation process. The primary ideas behind this algorithm are that agents, when acting as a mediator, centralize small, relevant portions of the DCSP, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO outperforms other known, complete DCSP techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。