Skip to main content

Local Coordination in Online Distributed Constraint Optimization Problems

  • Conference paper
Multi-Agent Systems (EUMAS 2011)

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

Included in the following conference series:

  • 941 Accesses

Abstract

In cooperative multi-agent systems, group performance often depends more on the interactions between team members, rather than on the performance of any individual agent. Hence, coordination among agents is essential to optimize the group strategy. One solution which is common in the literature is to let the agents learn in a joint action space. Joint Action Learning (JAL) enables agents to explicitly take into account the actions of other agents, but has the significant drawback that the action space in which the agents must learn scales exponentially in the number of agents. Local coordination is a way for a team to coordinate while keeping communication and computational complexity low. It allows the exploitation of a specific dependency structure underlying the problem, such as tight couplings between specific agents. In this paper we investigate a novel approach to local coordination, in which agents learn this dependency structure, resulting in coordination which is beneficial to the group performance. We evaluate our approach in the context of online distributed constraint optimization problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. 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, AAMAS 2005, pp. 1041–1048. ACM, New York (2005)

    Chapter  Google Scholar 

  2. Chapman, A.C., Micillo, R.A., Kota, R., Jennings, N.R.: Decentralised dynamic task allocation: a practical game-theoretic approach. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2009, Richland, SC, vol. 2, pp. 915–922 (2009)

    Google Scholar 

  3. Chapman, A.C., Rogers, A., Jennings, N.R., Leslie, D.S.: A unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems. Knowledge Eng. Review 26(4), 411–444 (2011)

    Article  Google Scholar 

  4. Chechetka, A., Sycara, K.: No-commitment branch and bound search for distributed constraint optimization. In: Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1427–1429. ACM, New York (2006)

    Chapter  Google Scholar 

  5. Claus, C., Boutilier, C.: The dynamics of reinforcement learning in cooperative multiagent systems. In: Proceedings of National Conference on Artificial Intelligence, AAAI 1998, pp. 746–752 (1998)

    Google Scholar 

  6. Guestrin, C., Lagoudakis, M., Parr, R.: Coordinated reinforcement learning. In: Proceedings of the ICML 2002 The Nineteenth International Conference on Machine Learning, pp. 227–234 (2002)

    Google Scholar 

  7. Kho, J., Rogers, A., Jennings, N.R.: Decentralized control of adaptive sampling in wireless sensor networks. ACM Trans. Sen. Netw. 5(3), 19:1–19:35 (2009)

    Google Scholar 

  8. Kok, J.R., Vlassis, N.: Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs. In: Bredenfeld, A., Jacoff, A., Noda, I., Takahashi, Y. (eds.) RoboCup 2005. LNCS (LNAI), vol. 4020, pp. 1–12. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. van Leeuwen, P., Hesselink, H., Rohling, J.: Scheduling aircraft using constraint satisfaction. Electronic Notes in Theoretical Computer Science 76, 252–268 (2002)

    Article  Google Scholar 

  10. Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: An asynchronous complete method for distributed constraint optimization. In: Autonomous Agents and Multiagent Systems, pp. 161–168 (2003)

    Google Scholar 

  11. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. The MIT Press (March 1998)

    Google Scholar 

  12. Taylor, M.E., Jain, M., Tandon, P., Yokoo, M., Tambe, M.: Distributed on-line multi-agent ooptimization under uncertainty: Balancing exploration and exploitation. Advances in Complex Systems (ACS) 14(03), 471–528 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brys, T., De Hauwere, YM., Nowé, A., Vrancx, P. (2012). Local Coordination in Online Distributed Constraint Optimization Problems. In: Cossentino, M., Kaisers, M., Tuyls, K., Weiss, G. (eds) Multi-Agent Systems. EUMAS 2011. Lecture Notes in Computer Science(), vol 7541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34799-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34799-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34798-6

  • Online ISBN: 978-3-642-34799-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics