Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs

Abstract

Concurrent search is an efficient technique for solving distributed constraint satisfaction problems (DisCSPs). dynamic variable ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.