摘要
最近分布式约束满足问题逐渐成为人工智能领域一个新的研究热点,它的提出将约束满足问题的应用范围扩展到复杂的分布式环境。并发搜索是求解分布式约束满足问题的一个高效算法。文中改进了并发搜索中的变量选择策略,将动态代理次序应用到其中,同时提出了一个适合于分布式条件下的基于动态代理次序的并发搜索算法。多组随机生成问题实验结果显示加入动态代理次序的并发回溯搜索在求解效率和通信量方面都表现出优异的性能。
Distributed CSPs have become a new hotspot in AI recently. It extends the application of CSPs to the complex distributed environment. Improves the agent ordering strategy in concurrent search for solving distributed CSPs, and combines dynamic agent ordering with concurrent search. At the same time, an algorithm based on dynamic agent ordering that is fit for distributed environment is proposed. Experiments of several random CSPs have been done, and the results show that the improved method performs better on efficiency and communieation overhead.
出处
《计算机技术与发展》
2009年第6期152-155,159,共5页
Computer Technology and Development
基金
国家自然科学基金项目(60773097)
吉林省青年科研基金项目(20080107)
关键词
分布式约束满足
动态代理次序
并发搜索
distributed constraint satisfaction
dynamic agent ordering
concurrent search
