Conflicting Agents in Distributed Search
[摘要] We extend here the work on interleaved distributed graph based backjumping, IDIBT/GBJ by considering conflicting variables. The resulting method IDIBT/CBJ combines distributed and parallel exploration with more efficient backward phases. We take advantage of our asynchronous framework to implement a more refined and efficient update of detected conflicts. Finally, directed k-consistency is added to our new method which gives IDIBT/CBJ-DkC. We show that this last method extends cooperation in the system. 11 Pages
[发布日期] [发布机构] HP Development Company
[效力级别] [学科分类] 计算机科学(综合)
[关键词] distributed constraint satisfaction;distributed AI;collaborative software agents;search [时效性]