On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Distributed control algorithms for AI
Multiagent systems
Determining the usefulness of information from its use during problem solving
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Asynchronous Search for Numeric DisCSPs
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Distributed Dynamic Backtracking
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Backtracking through biconnected components of a constraint graph
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Parallel and distributed algorithms for finite constraint satisfaction problems
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Nogood based asynchronous distributed optimization (ADOPT ng)
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
A Distributed Generative CSP Framework for Multi-site Product Configuration
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The message management asynchronous backtracking algorithm
Journal of Experimental & Theoretical Artificial Intelligence
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
On communication in solving distributed constraint satisfaction problems
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
| Hi-index | 0.00 |
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such a combination in asynchronous settings. The difficulty in this case is that, in the usual algorithms, the instantiation and consistency enforcement steps must alternate sequentially. When brought to a distributed setting, a similar approach forces the search algorithm to be synchronous in order to benefit from consistency maintenance. Asynchronism [24,14] is highly desirable since it increases flexibility and parallelism, and makes the solving process robust against timing variations. One of the most well-known asynchronous search algorithms is Asynchronous Backtracking (ABT). This paper shows how an algorithm for maintaining consistency during distributed asynchronous search can be designed upon ABT. The proposed algorithm is complete and has polynomial-space complexity. Since the consistency propagation is optional, this algorithms generalizes forward checking as well as chronological backtracking. An additional advance over existing centralized algorithms is that it can exploit available backtracking-nogoods for increasing the strength of the maintained consistency. The experimental evaluation shows that it can bring substantial gains in computational power compared with existing asynchronous algorithms.