Simple Support-Based Distributed Search

Distributed Constraint Satisfaction Problems provide a natural mechanism for multiagent coordination and agreement. To date, algorithms for Distributed Constraint Satisfaction Problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over agents for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors, or depend on the creation of new communication links between agents. In [5, 4] a new algorithm was presented designed explicitly for distributed environments so that a global ordering is not required, while avoiding the problems of existing local-search algorithms. This paper presents a significant improvement on that algorithm in performance and provability.

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

[2]  Makoto Yokoo,et al.  Asynchronous Weak-Commitment Search for Solving Large-Scale Distributed Constraint Satisfaction Problems , 1995, ICMAS.

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

[4]  Makoto Yokoo,et al.  Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems , 1995, CP.

[5]  Aditya K. Ghose,et al.  Support-based distributed search: a new approach for multiagent constraint processing , 2006, AAMAS '06.

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

[7]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[8]  Weixiong Zhang,et al.  Distributed breakout revisited , 2002, AAAI/IAAI.

[9]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..

[10]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[11]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[12]  Amnon Meisels,et al.  Dynamic Ordering for Asynchronous Backtracking on DisCSPs , 2005, CP.

[13]  Toby Walsh,et al.  Principles and Practice of Constraint Programming — CP 2001: 7th International Conference, CP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings , 2001, Lecture Notes in Computer Science.

[14]  Aditya K. Ghose,et al.  Practical application of support-based distributed search , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[15]  Youssef Hamadi.  Interleaved backtracking in distributed constraint networks , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.