Asynchronous Backtracking for Asymmetric DisCSPs
نویسندگان
چکیده
Distributed constraint satisfaction problems (DisCSPs) with asymmetric constraints reflect the fact that agents may wish to retain their constraints private. The set of valid pairs of values of every binary constraint is split between the two constrained agents. An asynchronous backtracking algorithm for asymmetric DisCSPs is presented. The new algorithm is based on asynchronous backtracking (ABT), but, propagates assignments both to lower priority agents and to higher priority agents. The ABT ASC algorithm is evaluated experimentally on randomly generated asymmetric DisCSPs. Its performance is compared to that of the privacy keeping version of ABT , proposed by Brito and Meseguer, which splits the search into two phases. The ABT ASC algorithm improves the run-time of the 2-phase ABT by a large factor with no additional load on the communication network.
منابع مشابه
Asynchronous Forward-Checking on DisCSPs
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assi...
متن کاملConcurrent search for distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Each SP is represented by a unique data structure, containing a current partial assignment (CPA), that is circulated am...
متن کاملRetroactive ordering heuristics for Asynchronous Backtracking on DisCSPs
A new type of ordering heuristics for dynamic ordering asynchronous backtracking(ABT DO) on DisCSPs is presented. Agents can be moved to a position that is higher than that of the target of the backtrack (Nogood). This new type of heuristics do not follow the restrictions on the heuristics of previous versions of ABT DO. The flexibility of the new type of heuristics is dependent on the size of ...
متن کاملAsynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...
متن کاملMessage delay and Asynchronous DisCSP search
Distributed constraint satisfaction problems (DisCSPs) are composed of agents, each holding its own variables, that are connected by constraints to variables of other agents. Due to the distributed nature of the problem, message delay can have unexpected effects on the behavior of distributed search algorithms on DisCSPs. This has been shown in experimental studies of asynchronous backtracking ...
متن کامل