Skip to main content

Dynamic Ordering for Asynchronous Backtracking on DisCSPs

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 3709)

Abstract

An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT_DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation of Nogoods. The dynamic ordered asynchronous backtracking algorithm uses polynomial space, similarly to standard ABT.

The ABT_DO algorithm with three different ordering heuristics is compared to standard ABT on randomly generated DisCSPs. A Nogood-triggered heuristic, inspired by dynamic backtracking, is found to outperform static order ABT by a large factor in run-time and improve the network load.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_6
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bessiere, C., Maestre, A., Brito, I., Meseguer, P.: Asynchronous backtracking without adding links: a new member in the abt family. Artificial Intelligence 161(1-2), 7–24 (2005)

    MATH  CrossRef  MathSciNet  Google Scholar 

  2. Bessiere, C., Maestre, A., Messeguer, P.: Distributed dynamic backtracking. In: Proc. Workshop on Distributed Constraint of IJCAI 2001 (2001)

    Google Scholar 

  3. Brito, I., Meseguer, P.: Synchronous,asnchronous and hybrid algorithms for discsp. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 791–791. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  4. Dechter, R.: Constraints Processing. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  5. Ginsberg, M.L.: Dynamic backtracking. J. of Artificial Intelligence Research 1, 25–46 (1993)

    MATH  Google Scholar 

  6. Hamadi, Y.: Distributed interleaved parallel and cooperative search in constraint satisfaction networks. In: Proc. IAT 2001, Singappore (2001)

    Google Scholar 

  7. Lamport, L.: Time, clocks, and the ordering of events in distributed system. Communication of the ACM 2, 95–114 (1978)

    MathSciNet  Google Scholar 

  8. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  9. Meisels, A., Razgon, I., Kaplansky, E., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proc. AAMAS 2002 Workshop on Distributed Constraint Reasoning DCR, Bologna, July 2002, pp. 86–93 (2002)

    Google Scholar 

  10. Nguyen, T., Sam-Hroud, D., Faltings, B.: Dynamic distributed backjumping. In: Proc. 5th workshop on distributed constraints reasoning DCR 2004, Toronto (September 2004)

    Google Scholar 

  11. Silaghi, M.C., Faltings, B.: Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence 161(1-2), 25–54 (2005)

    MATH  CrossRef  MathSciNet  Google Scholar 

  12. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Hybridizing abt and awc into a polynomial space, complete protocol with reordering. Technical Report 01/#364, EPFL (May 2001)

    Google Scholar 

  13. Smith, B.M.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81, 155–181 (1996)

    CrossRef  MathSciNet  Google Scholar 

  14. Solotorevsky, G., Gudes, E., Meisels, A.: Modeling and solving distributed constraint satisfaction problems (dcsps). In: Constraint Processing 1996, New Hamphshire, October 1996, pp. 561–562 (1996)

    Google Scholar 

  15. Yokoo, M.: Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In: Proc. 1st Intrnat. Conf. on Const. Progr., Cassis, France, pp. 88–102 (1995)

    Google Scholar 

  16. Yokoo, M.: Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents & Multi-Agent Sys. 3, 198–212 (2000)

    Google Scholar 

  17. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans. on Data and Kn. Eng. 10, 673–685 (1998)

    CrossRef  Google Scholar 

  18. Zivan, R., Meisels, A.: Synchronous vs asynchronous search on discsps. In: Proc. 1st European Workshop on Multi Agent System, EUMAS, Oxford (December 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zivan, R., Meisels, A. (2005). Dynamic Ordering for Asynchronous Backtracking on DisCSPs. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_6

Download citation

  • DOI: https://doi.org/10.1007/11564751_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)