Simple Support-Based Distributed Search

  • Peter Harvey
  • Chee Fon Chang
  • Aditya Ghose
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4013)


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.


Total Order Constraint Satisfaction Problem Cyclic Behaviour Constraint Network Constraint Tightness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bessière, C., Maestre, A., Meseguer, P.: Distributed dynamic backtracking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 772. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Ginsberg, M.L.: Dynamic backtracking. J. Artif. Intell. Res (JAIR) 1, 25–46 (1993)MATHGoogle Scholar
  3. 3.
    Hamadi, Y.: Interleaved backtracking in distributed constraint networks. International Journal on Artificial Intelligence Tools 11(2), 167–188 (2002)CrossRefGoogle Scholar
  4. 4.
    Harvey, P., Chang, C.F., Ghose, A.: Practical application of support-based distributed search. In: ICTAI, IEEE Computer Society, Los Alamitos (2005)Google Scholar
  5. 5.
    Harvey, P., Chang, C.F., Ghose, A.: Support-based distributed search. In: Proc. 6th Intern. Workshop on Distributed Constraint Reasoning (DCR-2005), pp. 45–59 (2005)Google Scholar
  6. 6.
    Hirayama, K., Yokoo, M.: The distributed breakout algorithms. Artif. Intell. 161(1-2), 89–115 (2005)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Morris, P.: The breakout method for escaping from local minima. In: AAAI, pp. 40–45 (1993)Google Scholar
  8. 8.
    Yokoo, M.: Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 88–102. Springer, Heidelberg (1995)Google Scholar
  9. 9.
    Yokoo, M.: Asynchronous weak-commitment search for solving large-scale distributed constraint satisfaction problems. In: Lesser, V.R., Gasser, L. (eds.) ICMAS, p. 467. MIT Press, Cambridge (1995)Google Scholar
  10. 10.
    Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3(2), 185–207 (2000)CrossRefGoogle Scholar
  11. 11.
    Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161(1-2), 55–87 (2005)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Zhang, W., Wittenburg, L.: Distributed breakout revisited. In: AAAI/IAAI, p. 352 (2002)Google Scholar
  13. 13.
    Zivan, R., Meisels, A.: Dynamic ordering for asynchronous backtracking on discsps. In: Proc. 6th Intern. Workshop on Distributed Constraint Reasoning (DCR-2005), July 2005, pp. 15–29 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Peter Harvey
    • 1
  • Chee Fon Chang
    • 1
  • Aditya Ghose
    • 1
  1. 1.Decision Systems Laboratory, School of IT and Computer ScienceUniversity of WollongongAustralia

Personalised recommendations