Abstract
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed version of the centralized BackJumping algorithm, called the Dynamic Distributed BackJumping – DDBJ algorithm. The advantage is twofold: DDBJ inherits the strength of synchronous algorithms that enables it to easily combine with a powerful dynamic ordering of variables and values, and still it maintains some level of autonomy for the agents. Experimental results show that DDBJ outperforms the DiDB and AFC algorithms by a factor of one to two orders of magnitude on hard instances of randomly generated DisCSPs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yokoo, M., Hirayama, K.: Algorithms for Distributed Constraint Satisfaction: A Review. In: Proceedings of Autonomous Agents and Multi-Agent Systems (2000)
Dechter, R.: Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41(3), 273–312 (1990)
Yokoo, M., Durfee, E., Ishida, T.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings DCS (1992)
Yokoo, M.: Distributed Constraint Satisfaction. Springer, Heidelberg (2001)
Ginsberg, M.: Dynamic Backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)
Hamadi, Y.: Interleaved backtracking in distributed constraint networks. International Journal on Artificial Intelligence Tools 11, 167–188 (2002)
Bessière, C., Maestre, A., Meseguer, P.: Distributed Dynamic Backtracking. In: Proceedings of the IJCAI 2001 workshop on Distributed Constraint Reasoning (2001)
Silaghi, M., Sam-Haroud, D., Faltings, B.: Asynchronous Search with Aggregations. In: Proceedings AAAI 2000 (2000)
Meisels, A., Zivan, R.: Asynchronous Forward-checking on DisCSPs. In: Proceedings of the Workshop on Distributed Constraints (DCR 2003), Acapulco (August 2003)
Dechter, R., Frost, D.: Backtracking algorithms for constraint satisfaction problems – a tutorial survey. Technical report, University of California, Irvine (1998)
Craenen, B.: JavaCsp package (2003), http://www.xs4all.nl/~bcraenen/JavaCsp/
Prosser, P.: Binary constraint satisfaction problems: some are harder than others. In: Proceedings of the 11th European Conference on Artificial Intelligence, ECAI 1994 (1994)
Bessiere, C.: Random Uniform CSP Generators (1996), http://www.xs4all.nl/~bessiere/generator.html
Dowd, K., Severance, C.: High Performance Computing, 2nd edn. O’Reilly & Associates, Sebastopol (1998)
Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proceedings of the Workshop on Distributed Constraint Reasoning, AAMAS 2002 (2002)
Barbosa, V.C.: An Introduction to Distributed Algorithms. The MIT Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, V., Sam-Haroud, D., Faltings, B. (2005). Dynamic Distributed BackJumping. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2004. Lecture Notes in Computer Science(), vol 3419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11402763_6
Download citation
DOI: https://doi.org/10.1007/11402763_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25176-7
Online ISBN: 978-3-540-32252-8
eBook Packages: Computer ScienceComputer Science (R0)