arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.06915cs.AI
收藏

用分布式大邻域搜索求解DCOPs问题

Solving DCOPs with Distributed Large Neighborhood Search

University of Michigan(密歇根大学);University of Udine(乌迪内大学);New Mexico State University(新墨西哥州立大学);Ben Gurion University(本古里安大学)

Ferdinando Fioretto, Agostino Dovier, Enrico Pontelli, William Yeoh, Roie Zivan

摘要:

近年来,分布式约束优化领域获得了发展势头,这要归功于它能够解决与多智能体协作相关的各种应用。然而,分布式约束优化问题(DCOPs)的最优求解是NP难的。因此,在大规模、复杂的应用中,不完全DCOP算法是必要的。目前的不完全DCOP算法遭受以下限制中的一个或多个:它们(a)找到局部极小值而不提供质量保证;(b)提供松散的质量评估;或(c)无法受益于问题的结构,如领域相关的知识和硬约束。因此,利用集中式约束求解社区的策略,我们提出了一个分布式大邻域搜索(D-LNS)框架来解决DCOPs。所提出的框架(其新颖的修复阶段)提供了解决方案的质量保证,在迭代过程中细化的上限和下限,并可以利用域相关的结构。我们的实验结果表明,D-LNS优于其他不完全DCOP算法的结构化和非结构化的问题实例。

英文摘要:

The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale, complex applications, incomplete DCOP algorithms are necessary. Current incomplete DCOP algorithms suffer of one or more of the following limitations: they (a) find local minima without providing quality guarantees; (b) provide loose quality assessment; or (c) are unable to benefit from the structure of the problem, such as domain-dependent knowledge and hard constraints. Therefore, capitalizing on strategies from the centralized constraint solving community, we propose a Distributed Large Neighborhood Search (D-LNS) framework to solve DCOPs. The proposed framework (with its novel repair phase) provides guarantees on solution quality, refining upper and lower bounds during the iterative process, and can exploit domain-dependent structures. Our experimental results show that D-LNS outperforms other incomplete DCOP algorithms on both structured and unstructured problem instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑