Adding laziness in BnB-ADOPT+ | Constraints Skip to main content
Springer Nature Link
Log in

Adding laziness in BnB-ADOPT+

  • Letter
  • Published:
Constraints Aims and scope Submit manuscript

Abstract

In distributed constraint optimization, agents executing BnB-ADOPT+ react eagerly to cost changes: they send non-redundant COST messages to their parents as soon as they receive new messages. We have observed that a lazier reaction (not sending COST messages until a condition is met) substantially decrements the number of messages sent and causes only a small variation in ENCCCs. This approach combines nicely with soft arc consistency maintenance during search. We provide experimental evidence of the benefits of this approach on several benchmarks.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Chechetka, A., & Sycara, K. (2006). No-commitment branch and bound search for distributed constraint optimization. In: Proceedings of the AAMAS 2006.

  2. Gutierrez, P., Lee, J., Lei, K., Mak, T., Meseguer, P. (2013). Maintaining soft arc consistency in BnB-ADOPT+ during search. In: Proceedings of the CP 2013 LNCS 8124.

  3. Gutierrez, P., & Meseguer, P. (2012). Removing redundant messages in N-ary BnB-ADOPT. Journal of Artificial Intelligence Research, 287–304.

  4. Modi, P.J., Shen, W.-M., Tambe, M., ADOPT, M. Yokoo. (2005). Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161, 149–180.

    Article  MATH  MathSciNet  Google Scholar 

  5. Peri, O., & Meisels, A. (2013). Synchronizing for performance - DCOP algorithms. In: Proceedings of the ICAART 2013.

  6. Yeoh, W., Felner, A., Koenig, S. (2010). BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm. Journal of Artificial Intelligence Research, 38, 85–133.

    MATH  Google Scholar 

  7. Yin, Z. (2008). USC DCOP repository. Meeting scheduling and sensor net datasets. http://teamcore.usc.edu/dcop.

Download references

Author information

Authors and Affiliations

  1. Dept Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong

    Jimmy H. M. Lee & Wen Su

  2. IIIA - CSIC, Campus UAB, 08193, Bellaterra, Spain

    Pedro Meseguer

Authors
  1. Jimmy H. M. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wen Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pedro Meseguer.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, J.H.M., Meseguer, P. & Su, W. Adding laziness in BnB-ADOPT+ . Constraints 20, 274–282 (2015). https://doi.org/10.1007/s10601-014-9177-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-014-9177-3

Keywords

Search

Navigation