Distributed Constraint Satisfaction
Distributed Constraint Satisfaction
复制标题
分布式约束满足
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
M. Yokoo
中科院分区：
文献类型：
--
作者：
M. Yokoo
分布式约束满足给出了一个概述约束满足问题（CSP），适应相关的搜索算法和一致性算法的应用程序，多智能体系统，并巩固了最近的研究致力于在这样的系统中的合作。所介绍的技术适用于多智能体系统中的各种问题。在新的方法是一个混合型算法弱承诺搜索结合回溯和迭代改进。此外，扩展的基本CSP形式化称为“部分CSP”的介绍，以处理过约束CSP。
Distributed Constraint Satisfaction gives an overview of Constraint Satisfaction Problems (CSPs), adapts related search algorithms and consistency algorithms for applications to multi-agent systems, and consolidates recent research devoted to cooperation in such systems. The techniques introduced are applied to various problems in multi-agent systems. Among the new approaches is a hybrid-type algorithm for weak-commitment search combining backtracking and iterative improvement. Also, an extension of the basic CSP formalization called "Partial CSP" is introduced in order to handle over-constrained CSPs.