A STUDY ON ONE DISTRIBUTED CSPS SOLVING ALGORITHM BASED ON CONCURRENT SEARCH
Distributed constraint satisfaction problem (DisCSP) has being become to a new research branch of artificial intelligence. This paper improves the variable selecting strategy in concurrent search. At the same time, a method for dynamic variable ordering which is fit for distributed multi-agent environment is proposed to solve DisCSP, and value support proportion is defined to calculate variable ordering. Experiments on randomly generated DisCSP demonstrate that concurrent backtrack search with the proposed method for dynamic variable ordering performs more efficiently than random variable ordering based concurrent backtrack search, and communication overhead is decreases as well.
Distributed constraint satisfaction problem concurrent search variable selecting strategy
CHUN-HUI LIU JIAN GAO YONG-GANG ZHANG JI-GUI SUN
College of Computer Science and Technology, Jilin University, Changchun, China, 130012
国际会议
2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)
昆明
英文
2240-2244
2008-07-12（万方平台首次上网日期，不代表论文的发表时间）