Asynchronous Forward-checking for DisCSPs

A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assignment to all unassigned agents concurrently. The algorithm is described in detail and its correctness proven. The sequential assignment method of AFC leads naturally to dynamic ordering of agents during search. Several ordering heuristics are presented. The three best heuristics are evaluated and shown to improve the performance of AFC with static order by a large factor. An experimental comparison of AFC to asynchronous backtracking (ABT) on randomly generated DisCSPs is also presented. AFC with ordering heuristics outperforms ABT by a large factor on the harder instances of random DisCSPs. These results hold for two measures of performance: number of non-concurrent constraints checks and number of messages sent.

[1]  Ismel Brito Rodriguez,et al.  Distributed constraint satisfaction , 2007 .

[2]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[3]  Makoto Yokoo,et al.  Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information , 2002, CP.

[4]  Kobbi Nissim,et al.  Secure DisCSP Protocols – From Centralized Towards Distributed Solutions , 2005 .

[5]  Makoto Yokoo,et al.  Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..

[6]  Ehud Gudes,et al.  Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs) , 1996, CP.

[7]  Bhaskar Krishnamachari,et al.  Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[8]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[9]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[10]  Ismel Brito.  Synchronous, Asynchronous and Hybrid Algorithms for DisCSP , 2004, CP.

[11]  Amnon Meisels,et al.  Concurrent Dynamic Backtracking for Distributed CSPs , 2004, CP.

[12]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[13]  Edward A. Feigenbaum,et al.  Artificial intelligence research , 1963, IEEE Trans. Inf. Theory.

[14]  Pedro Meseguer,et al.  Synchronous , Asynchronous and Hybrid Algorithms for DisCSPs ? , 2004 .

[15]  Pedro Meseguer,et al.  Distributed Forward Checking , 2003, CP.

[16]  Christian Bessiere,et al.  Distributed Dynamic Backtracking , 2001, CP.

[17]  Amnon Meisels,et al.  Comparing performance of distributed constraints process ing algorithms , 2002 .

[18]  Amnon Meisels,et al.  Concurrent Backtrack Search on DisCSPs , 2004, FLAIRS Conference.

[19]  Boi Faltings,et al.  Dynamic Distributed BackJumping , 2004, CSCLP.

[20]  Patrick Prosser,et al.  Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.

[21]  Amnon Meisels,et al.  Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

[22]  Amnon Meisels,et al.  Asynchronous Backtracking for Asymmetric DisCSPs , 2005 .

[23]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems , 2000 .

[24]  Peter van Beek,et al.  A Theoretical Evaluation of Selected Backtracking Algorithms , 1995, IJCAI.

[25]  Makoto Yokoo.  Distributed Constraint Satisfaction Problem , 2001 .

[26]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[27]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[28]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[29]  Boi Faltings,et al.  ASYNCHRONOUS CONSISTENCY MAINTENANCE , 2001 .

[30]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[31]  Amnon Meisels,et al.  Distributed forward-checking with conflict-based backjumping and dynamic ordering , 2002 .

[32]  Amnon Meisels,et al.  Distributed Forward Checking with Dynamic Ordering , 2001 .

[33]  Boi Faltings,et al.  Asynchronous aggregation and consistency in distributed constraint satisfaction , 2005, Artif. Intell..

[34]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[35]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[36]  Amnon Meisels,et al.  Synchronous vs Asynchronous search on DisCSPs , 2003 .

[37]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..