Advertisement

Improving the Distributed Constraint Optimization Using Social Network Analysis

  • Allan Rodrigo Leite
  • André Pinz Borges
  • Laércio Martins Carpes
  • Fabrício Enembreck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6404)

Abstract

Distributed Constraint Optimization Problem (DCOP) has emerged as one of most important formalisms for distributed reasoning in multiagent systems. Nevertheless, there are few real world applications based on methods for solving DCOP, due to their inefficiency in some scenarios. This paper introduces the use of Social Network Analysis (SNA) techniques to improve the performance in pseudo-tree-based DCOP algorithms. We investigate when the SNA is useful and which techniques can be applied in some DCOP instances. To evaluate our proposal, we use the two most popular complete and optimal DCOP algorithms, named ADOPT and DPOP, and compare the obtained results with others well-known pre-processing techniques. The experimental results show that SNA techniques can speed up ADOPT and DPOP algorithms.

Keywords

multiagent systems distributed constraint optimization problem pre-processing techniques 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ali, S., Koenig, S., Tambe, M.: Preprocessing Techniques for Accelerating the DCOP Algorithm ADOPT. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1041–1048 (2005)Google Scholar
  2. 2.
    Bistarelli, S., Gennari, R., Rossi, F.: Constraint Propagation for Soft Constraints: Generalization and Termination Conditions. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 83–97. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)zbMATHGoogle Scholar
  4. 4.
    Dechter, R., Meiri, I.: Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 271–277 (1989)Google Scholar
  5. 5.
    Junges, R., Bazzan, A.L.: Evaluating the performance of DCOP algorithms in a real world, dynamic problem. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, Portugal Richland, pp. 599–606 (2008)Google Scholar
  6. 6.
    Leite, A.R., Giacomet, B., Enembreck, F.: Railroad Driving Model Based on Distributed Constraint Optimization. In: Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, pp. 474–482. IEEE Computer Society Press, Milan (2009)Google Scholar
  7. 7.
    Lesser, V., Ortiz, C.L., Tambe, M.: Distributed Sensor Networks: a Multiagent Perspective, vol. 9. Kluwer Academic Publishers, Massachusetts (2003)zbMATHGoogle Scholar
  8. 8.
    Maheswaran, R.T., et al.: Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent, EUA, pp. 310–317. IEEE, Washington (2004)Google Scholar
  9. 9.
    Modi, P.J., et al.: ADOPT: Asynchronous Distributed Constraint Optimization with Quality Guarantees. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, Melbourne, pp. 149–180. ACM, New York (2003)Google Scholar
  10. 10.
    Petcu, A., Faltings, B.: A Scalable Method for Multiagent Constraint Optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence, Edinburgh, pp. 266–271. Morgan Kaufmann Publishers, San Francisco (2005)Google Scholar
  11. 11.
    Scoot, J.: Social network analysis: A handbook. Sage Publications, Thousand Oaks (2000)Google Scholar
  12. 12.
    Tsang, E.: Foundations of Constraint Satisfaction. Department of Computer Science, University of Essex, UK (1993)Google Scholar
  13. 13.
    Yokoo, M., et al.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transactions on Knowledge and Data Engineering 10, 673–685 (1998)CrossRefGoogle Scholar
  14. 14.
    Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Allan Rodrigo Leite
    • 1
  • André Pinz Borges
    • 1
  • Laércio Martins Carpes
    • 1
    • 2
  • Fabrício Enembreck
    • 1
  1. 1.Pontifical Catholic University of ParanáBrazil
  2. 2.Adventist University Center of São PauloBrazil

Personalised recommendations