Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A General Framework for Reordering Agents Asynchronously in Distributed CSP

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2015)

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

Abstract

Reordering agents during search is an essential component of the efficiency of solving a distributed constraint satisfaction problem. Termination values have been recently proposed as a way to simulate the min-domain dynamic variable ordering heuristic. The use of termination values allows the greatest flexibility in reordering agents dynamically while keeping polynomial space. In this paper, we propose a general framework based on termination values for reordering agents asynchronously. The termination values are generalized to represent various heuristics other than min-domain. Our general framework is sound, complete, terminates and has a polynomial space complexity. We implemented several variable ordering heuristics that are well-known in centralized CSPs but could not until now be applied to the distributed setting. Our empirical study shows the significance of our framework compared to state-of-the-art asynchronous dynamic ordering algorithms for solving distributed CSP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bessiere, C., Bouyakhf, E.H., Mechqrane, Y., Wahbi, M.: Agile asynchronous backtracking for distributed constraint satisfaction problems. In: Proceedings of ICTAI 2011, Boca Raton, Florida, USA, pp. 777–784, November 2011

    Google Scholar 

  2. Bessiere, C., Maestre, A., Brito, I., Meseguer, P.: Asynchronous backtracking without adding links: a new member in the ABT family. Artif. Intel. 161, 7–24 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bessiere, C., Régin, J.C.: MAC and combined heuristics: two reasons toforsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61–75. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Bessiere, C., Régin, J.C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI 2001, San Francisco, CA, USA, pp. 309–315 (2001)

    Google Scholar 

  5. Bliek, C.: Generalizing partial order and dynamic backtracking. In: Proceedings of AAAI 1998/IAAI 1998, Menlo Park, CA, USA, pp. 319–325 (1998)

    Google Scholar 

  6. Bonnet-Torrés, O., Tessier, C.: Multiply-constrained dcop for distributed planning and scheduling. In: AAAI SSS: Distributed Plan and Schedule Management, pp. 17–24 (2006)

    Google Scholar 

  7. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI 2004, pp. 146–150 (2004)

    Google Scholar 

  8. Ginsberg, M.L.: Dynamic Backtracking. JAIR 1, 25–46 (1993)

    MATH  Google Scholar 

  9. Ginsberg, M.L., McAllester, D.A.: GSAT and dynamic backtracking. In: KR, pp. 226–237 (1994)

    Google Scholar 

  10. Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intel. 14(3), 263–313 (1980)

    Article  Google Scholar 

  11. Jung, H., Tambe, M., Kulkarni, S.: Argumentation as distributed constraint satisfaction: applications and results. In: Proceedings of AGENTS 2001, pp. 324–331 (2001)

    Google Scholar 

  12. Junges, R., Bazzan, A.L.C.: Evaluating the performance of dcop algorithms in a real world, dynamic problem. In: Proceedings of AAMAS 2008, Richland, SC, pp. 599–606 (2008)

    Google Scholar 

  13. Léauté, T., Faltings, B.: Coordinating logistics operations with privacy guarantees. In: Proceedings of the IJCAI 2011, pp. 2482–2487 (2011)

    Google Scholar 

  14. Lecoutre, C., Boussemart, F., Hemery, F.: Backjump-based techniques versus conflict-directed heuristics. In: Proceedings of IEEE ICTAI 2004, pp. 549–557 (2004)

    Google Scholar 

  15. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Series (1997)

    Google Scholar 

  16. Maheswaran, R.T., Tambe, M., Bowring, E., Pearce, J.P., Varakantham, P.: Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling. In: Proceedings of AAMAS 2004 (2004)

    Google Scholar 

  17. Mechqrane, Y., Wahbi, M., Bessiere, C., Bouyakhf, E.H., Meisels, A., Zivan, R.: Corrigendum to “Min-Domain Retroactive Ordering for Asynchronous Backtracking". Constraints 17, 348–355 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ottens, B., Faltings, B.: Coordination agent plans trough distributed constraint optimization. In: Proceedings of MASPLAN 2008, Sydney, Australia (2008)

    Google Scholar 

  19. Petcu, A., Faltings, B.V.: A value ordering heuristic for local search in distributed resource allocation. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 86–97. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Roussel, O., Lecoutre, C.: Xml representation of constraint networks: Format XCSP 2.1. CoRR (2009)

    Google Scholar 

  21. Silaghi, M.C.: Framework for modeling reordering heuristics for asynchronous backtracking. In: IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2006, pp. 529–536, December 2006

    Google Scholar 

  22. Silaghi, M.C.: Generalized dynamic ordering for asynchronous backtracking on DisCSPs. In: Proceedings of DCR 2006 (2006)

    Google Scholar 

  23. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: ABT with Asynchronous Reordering. In: 2nd Asia-Pacific IAT (2001)

    Google Scholar 

  24. Silaghi, M.C., Sam-Haroud, D., Calisti, M., Faltings, B.: Generalized english auctions by relaxation in dynamic distributed CSPs with private constraints. In: Proceedings of DCR 2001, pp. 45–54 (2001)

    Google Scholar 

  25. Wahbi, M.: Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc. (2013)

    Google Scholar 

  26. Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: DisChoco 2: a platform for distributed constraint reasoning. In: Proceedings of workshop on DCR 2011, pp. 112–121 (2011). http://dischoco.sourceforge.net/

  27. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings of ICDCS, pp. 614–621 (1992)

    Google Scholar 

  28. Zivan, R., Meisels, A.: Parallel Backtrack search on DisCSPs. In: Proceedings of DCR 2002 (2002)

    Google Scholar 

  29. Zivan, R., Meisels, A.: Dynamic Ordering for Asynchronous Backtracking on DisCSPs. Constraints 11(2–3), 179–197 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  30. Zivan, R., Meisels, A.: Message delay and DisCSP search algorithms. AMAI 46(4), 415–439 (2006)

    MATH  MathSciNet  Google Scholar 

  31. Zivan, R., Zazone, M., Meisels, A.: Min-Domain Retroactive Ordering for Asynchronous Backtracking. Constraints 14(2), 177–198 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Insight Centre for Data Analytics, University College Cork, Cork, Ireland

    Mohamed Wahbi & Kenneth N. Brown

  2. Mohammed V University-Agdal Rabat, Rabat, Morocco

    Younes Mechqrane

  3. University of Montpellier, Montpellier, France

    Christian Bessiere

Authors
  1. Mohamed Wahbi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Younes Mechqrane
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Bessiere
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kenneth N. Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Wahbi .

Editor information

Editors and Affiliations

  1. École Polytechnique de Montréal, Montréal, Québec, Canada

    Gilles Pesant

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wahbi, M., Mechqrane, Y., Bessiere, C., Brown, K.N. (2015). A General Framework for Reordering Agents Asynchronously in Distributed CSP. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23219-5_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23218-8

  • Online ISBN: 978-3-319-23219-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation