Abstract
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. Search processes are generated dynamically, started by the initializing agent, and by any number of agents during search. In the proposed, ConcDB, algorithm, all search processes perform dynamic backtracking (DB). As a consequence of DB, a search space scanned by one search process can be found unsolvable by a different search process. This enhances the efficiency of the ConcDB algorithm. Concurrent search is an asynchronous distributed algorithm and is shown to be faster than asynchronous backtracking (ABT). The network load of ConcDB is also much lower than that of ABT.
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.
References
Bessiere, C., Maestre, A., Messeguer, P.: Distributed Dynamic Backtracking. In: Proc. Workshop on Distributed Constraints, IJCAI 2001, Seattle (2001)
Fernandez, C., Bejar, R., Krishnamachari, B., Gomes, K.: Communication and Computation in Distributed CSP Algorithms. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 664–679. Springer, Heidelberg (2002)
Ginsberg, M.L.: Dynamic Backtracking. Artificial Intelligence Research 1, 25–46 (1993)
Lamport, L.: Time, clocks and the ordering of events in a distributed system. Comm. of ACM 21, 558–565 (1978)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Series (1997)
Meisels, A., et al.: Comparing performance of Distributed Constraints Processing Algorithms. In: Proc. DCR Workshop, AAMAS 2002, Bologna, July 2002, pp. 86–93 (2002)
Prosser, P.: An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence 81, 81–109 (1996)
Silaghi, M.C.: Asynchronously Solving Problems with Privacy Requirements. PhD Thesis,Swiss Federal Institute of Technology, EPFL (2002)
Smith, B.M.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81, 155–181 (1996)
Solotorevsky, G., Gudes, E., Meisels, A.: Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs). In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, Springer, Heidelberg (1996)
Yokoo, M.: Algorithms for Distributed Constraint Satisfaction: A Review. In: Autons Agents Multi-Agent Sys. 2000, vol. 3(2), pp. 198–212 (2000)
Zivan, R., Meisels, A.: Concurrent Backtrack search on DisCSPs. In: Proc. of FLAIRS 2004, Miami-Beach, May 2004, pp. 776–781 (2004)
Zivan, R., Meisels, A.: Message delay and DisCSP search algorithms. Submit to DCR 2004 (September 2004)
Zivan, R., Meisels, A.: Concurrent Dynamic Backtracking for DisCSPs, full version http://www.cs.bgu.ac.il/zivanr
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zivan, R., Meisels, A. (2004). Concurrent Dynamic Backtracking for Distributed CSPs. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive