Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
The hazards of fancy backtracking
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
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
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Communication and Computation in Distributed CSP Algorithms
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Asynchronous Backtracking (ABT ) is a reference algorithm for Distributed CSP (DisCSP ). In ABT , agents assign values to their variables and exchange messages asynchronously and concurrently. When an ABT agent sends a backtracking message, it continues working without waiting for an answer. In this paper, we describe a case showing that this strategy may cause some inefficiency. To overcome this, we propose ABT hyb , a new algorithm that results from adding synchronization points to ABT . We prove that ABT hyb is correct, complete and terminates. We also provide an empirical evaluation of the new algorithm on several benchmarks. Experimental results show that ABT hyb outperforms ABT .