Skip to main content
SpringerLink
Log in

Improvement of Arc Consistency in Asynchronous Forward Bounding Algorithm

  • Conference paper
  • First Online:
AI 2021: Advances in Artificial Intelligence (AI 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13151))

Included in the following conference series:

  • 1728 Accesses

Abstract

The AFB_BJ\(^{+}\)-AC\(^*\) algorithm is one of the latest algorithms used to solve Distributed Constraint Optimization Problems known as DCOPs. It is based on soft arc consistency techniques (AC\(^*\)) to speed up the process of solving a problem by permanently removing any value that doesn’t belong to the optimal solution. In fact, these techniques have greatly contributed to improving the performance of the AFB_BJ\(^{+}\) algorithm in solving DCOPs, but there are some exceptions in which they have no effect due to the limited number of deletions made. For that, we use in this paper a higher consistency level, which is a directional arc consistency (DAC\(^*\)). This level makes it possible to erase more values and thus to quickly reach the optimal solution to a problem. Experiments on some benchmarks show that the new algorithm, AFB\(\_\)BJ\(^{+}\)-DAC\(^*\), is better in terms of communication load and computation effort.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

References

  1. Adrdor, R., Ezzahir, R., Koutti, L.: Connecting AFB_BJ+ with soft arc consistency. Int. J. Comput. Optim. 5(1), 9–20 (2018). https://doi.org/10.12988/ijco.2018.857

  2. Adrdor, R., Ezzahir, R., Koutti, L.: Consistance d’arc souple appliquée aux problèmes dcop. Journées d’Intelligence Artificielle Fondamentale (JIAF) 63 (2020)

    Google Scholar 

  3. Adrdor, R., Koutti, L.: Enhancing \({\rm AFB}_{\rm BJ}^{+}{\rm AC}^{*}\) algorithm. In: 2019 International Conference of Computer Science and Renewable Energies (ICCSRE), pp. 1–7. IEEE, July 2019. https://doi.org/10.1109/ICCSRE.2019.8807711

  4. Ali, S., Koenig, S., Tambe, M.: Preprocessing techniques for accelerating the DCOP algorithm ADOPT. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1041–1048. ACM (2005)

    Google Scholar 

  5. Béjar, R., et al.: Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1–2), 117–147 (2005)

    Article  MathSciNet  Google Scholar 

  6. Fioretto, F., Pontelli, E., Yeoh, W.: Distributed constraint optimization problems and applications: a survey. J. Artif. Intell. Res. 61, 623–698 (2018)

    Article  MathSciNet  Google Scholar 

  7. Gershman, A., Meisels, A., Zivan, R.: Asynchronous forward bounding for distributed cops. J. Artif. Intell. Res. 34, 61–88 (2009)

    Article  MathSciNet  Google Scholar 

  8. Grinshpoun, T., Tassa, T., Levit, V., Zivan, R.: Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs. Artif. Intell. 266, 27–50 (2019)

    Article  MathSciNet  Google Scholar 

  9. Gutierrez, P., Meseguer, P.: Saving messages in adopt-based algorithms. In: Proceedings of 12th DCR Workshop in AAMAS 2010, pp. 53–64. Citeseer (2010)

    Google Scholar 

  10. Gutierrez, P., Meseguer, P.: Improving BnB-ADOPT+-AC. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, pp. 273–280. International Foundation for Autonomous Agents and Multiagent Systems (2012)

    Google Scholar 

  11. Hirayama, K., Yokoo, M.: Distributed partial constraint satisfaction problem. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 222–236. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0017442

    Chapter  Google Scholar 

  12. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: IJCAI, vol. 3, pp. 239–244 (2003)

    Google Scholar 

  13. 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 the Third International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 1, pp. 310–317. IEEE Computer Society (2004)

    Google Scholar 

  14. Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1–2), 149–180 (2005)

    Article  MathSciNet  Google Scholar 

  15. Nguyen, D.T., Yeoh, W., Lau, H.C., Zivan, R.: Distributed gibbs: a linear-space sampling-based DCOP algorithm. J. Artif. Intell. Res. 64, 705–748 (2019)

    Article  MathSciNet  Google Scholar 

  16. Wahbi, M., Ezzahir, R., Bessiere, C.: Asynchronous forward bounding revisited. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 708–723. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40627-0_52

    Chapter  Google Scholar 

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

  18. Yeoh, W., Felner, A., Koenig, S.: BnB-adopt: an asynchronous branch-and-bound DCOP algorithm. J. Artif. Intell. Res. 38, 85–133 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Sciences, Ibn Zohr University, Agadir, Morocco

    Rachid Adrdor & Lahcen Koutti

Authors
  1. Rachid Adrdor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lahcen Koutti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rachid Adrdor .

Editor information

Editors and Affiliations

  1. University of Technology Sydney, Sydney, NSW, Australia

    Guodong Long

  2. RMIT University, Melbourne, SA, Australia

    Xinghuo Yu

  3. University of Queensland, Brisbane, QLD, Australia

    Sen Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Adrdor, R., Koutti, L. (2022). Improvement of Arc Consistency in Asynchronous Forward Bounding Algorithm. In: Long, G., Yu, X., Wang, S. (eds) AI 2021: Advances in Artificial Intelligence. AI 2022. Lecture Notes in Computer Science(), vol 13151. Springer, Cham. https://doi.org/10.1007/978-3-030-97546-3_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-97546-3_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-97545-6

  • Online ISBN: 978-3-030-97546-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation