The hazards of fancy backtracking
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed Algorithms
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 Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous aggregation and consistency in distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous Forward-checking for DisCSPs
Constraints
Hi-index | 0.00 |
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the Min-domain property (Haralick and Elliott, Artif Intel 14:263---313, 1980; Bessiere and Regin, Mac and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proc. CP 96, pp. 61---75, Cambridge, MA, 1996; Smith and Grant, Trying harder to fail first. In European Conference on Artificial Intelligence, pp. 249---253, 1998; Dechter, Constraint Processing. Morgan Kaufman, 2003). Ordering heuristics have been introduced recently to asynchronous backtracking (ABT), for distributed constraints satisfaction (DisCSP) (Zivan and Meisels, Dynamic ordering for asynchronous backtracking on discsps. In CP-2005, pp. 32---46, Sigtes (Barcelona), Spain, 2005). However, the pioneering study of dynamically ordered ABT, ABT_DO, has shown that a straightforward implementation of the Min-domain heuristic does not produce the expected improvement over a static ordering. The present paper proposes an asynchronous dynamic ordering which does not follow the standard restrictions on the position of reordered agents in ABT_DO. Agents can be moved to a position that is higher than that of the target of the backtrack. Combining the Nogood-triggered heuristic and the Min-domain property in this new class of heuristics results in the best performing version of ABT_DO. The new version of retroactively ordered ABT is faster by a large factor than the best form of ABT.