SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation

  • Graham Billiau
  • Chee Fon Chang
  • Aditya Ghose
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7057)

Abstract

Dynamic distributed constraint optimisation problems are a very effective tool for solving multi-agent problems. However they require protocols for agents to collaborate in optimising shared objectives in a decentralised manner without necessarily revealing all of their private constraints. In this paper, we present the details of the Support-Based Distributed Optimisation (SBDO) algorithm for solving dynamic distributed constraint optimisation problems. This algorithm is complete wrt hard constraints but not wrt objectives. Furthermore, we show that SBDO is completely asynchronous, sound and fault tolerant. Finally, we evaluate the performance of SDBO with respect to DynCOAA for DynDCOP and ADOPT, DPOP for DCOP. The results highlight that in general, SBDO out performs these algorithms on criteria such as time, solution quality, number of messages, non-concurrent constraint checks and memory usage.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chechetka, A., Sycara, K.: No-commitment branch and bound search for distributed constraint optimization. In: AAMAS 2006, pp. 1427–1429. ACM (2006)Google Scholar
  2. 2.
    Harvey, P., Chang, C.F., Ghose, A.: Support-based distributed search: a new approach for multiagent constraint processing. In: AAMAS 2006, pp. 377–383. ACM (2006)Google Scholar
  3. 3.
    Kiekintveld, C., Yin, Z., Kumar, A., Tambe, M.: Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In: AAMAS, pp. 133–140 (2010)Google Scholar
  4. 4.
    Léauté, T., Ottens, B., Szymanek, R.: FRODO 2.0: An open-source framework for distributed constraint optimization. In: Proceedings of the IJCAI 2009 Distributed Constraint Reasoning Workshop (DCR 2009), Pasadena, California, USA, pp. 160–164 (July 13, 2009), http://liawww.epfl.ch/frodo/
  5. 5.
    Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proceedings of DCR Workshop, AAMAS 2002 (2002)Google Scholar
  6. 6.
    Mertens, K.: An Ant-Based Approach for Solving Dynamic Constraint Optimization Problems. PhD thesis, Katholieke Universiteit Leuven (December 2006)Google Scholar
  7. 7.
    Modi, P.J., Shen, W.-M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161, 149–180 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Petcu, A., Faltings, B.: S-dpop: Superstabilizing, fault-containing multiagent combinatorial optimization. In: Proceedings of the National Conference on Artificial Intelligence, AAAI-2005, pp. 449–454. AAAI, Pittsburgh (July 2005)Google Scholar
  9. 9.
    Portway, C.P.: USC dcop repository (2008), http://teamcore.usc.edu/dcop
  10. 10.
    Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. In: TAI 1993, pp. 48–55 (1993)Google Scholar
  11. 11.
    Stranders, R., Farinelli, A., Rogers, A., Jennings, N.R.: Decentralised coordination of continuously valued control parameters using the max-sum algorithm. In: AAMAS, vol. (1), pp. 601–608 (2009)Google Scholar
  12. 12.
    Vinyals, M., Pujol, M., Rodríguez-Aguilar, J.A., Cerquides, J.: Divide-and-coordinate: Dcops by agreement. In: AAMAS, pp. 149–156 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Graham Billiau
    • 1
  • Chee Fon Chang
    • 1
  • Aditya Ghose
    • 1
  1. 1.Decision Systems Lab School of Computer Science and Software EnggUniversity of WollongongAustralia

Personalised recommendations