Advertisement

Distributed Search Method with Bounded Cost Vectors on Multiple Objective DCOPs

  • Toshihiro Matsui
  • Marius Silaghi
  • Katsutoshi Hirayama
  • Makoto Yokoo
  • Hiroshi Matsuo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7455)

Abstract

We generalize a pseudo-tree based solver to employ boundaries of multi-objective DCOPs. Multi-objective problems have been addressed in the research area of DCOPs recently. For the case of multiple objectives, the objective values are defined as the result of separate evaluation schemes. Applying multi-objectives to pseudo-tree based search is also important to generalize several traditional solvers. Here, we introduce boundaries for the vector of objective values in a solver based on pseudo-trees. Both the bottom-up computation of the partial dynamic-programming and the top-down computation of the tree-search employ the bounded vectors of the objective values. Several operations including aggregation, decomposition and comparison of objective values are extended for the bounded vectors.

Keywords

multi-objective Distributed Constraint Optimization multi-agent cooperation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the Max-Sum algorithm. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 639–646 (2008)Google Scholar
  2. 2.
    Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 438–445 (2004)Google Scholar
  3. 3.
    Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161(1-2), 149–180 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: 19th International Joint Conference on Artificial Intelligence, pp. 266–271 (2005)Google Scholar
  5. 5.
    Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence 161(1-2), 55–87 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Zivan, R.: Anytime local search for distributed constraint optimization. In: Twenty-Third AAAI Conference on Artificial Intelligence, pp. 393–398 (2008)Google Scholar
  7. 7.
    Bowring, E., Tambe, M., Yokoo, M.: Multiply constrained distributed constraint optimization. In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1413–1420 (2006)Google Scholar
  8. 8.
    Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., Matsuo, H.: Resource constrained distributed constraint optimization with virtual variables. In: 23rd AAAI Conference on Artificial Intelligence, pp. 120–125 (2008)Google Scholar
  9. 9.
    Kumar, A., Faltings, B., Petcu, A.: Distributed constraint optimization with structured resource constraints. In: AAMAS 2009: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 923–930 (2009)Google Scholar
  10. 10.
    Delle Fave, F.M., Stranders, R., Rogers, A., Jennings, N.R.: Bounded decentralised coordination over multiple objectives. In: 10th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 371–378 (2011)Google Scholar
  11. 11.
    Rollón, E., Larrosa, J.: Bucket elimination for multiobjective optimization problems. Journal of Heuristics 12, 307–328 (2006)zbMATHCrossRefGoogle Scholar
  12. 12.
    Marinescu, R.: Exploiting Problem Decomposition in Multi-objective Constraint Optimization. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 592–607. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Aji, S.M., McEliece, R.J.: The generalized distributive law. IEEE Transactions on Information Theory 46(2), 325–343 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Schiex, T.: A note on CSP graph parameters. Technical report 1999/03, INRA (1999)Google Scholar
  15. 15.
    Petcu, A., Faltings, B.: O-DPOP: An algorithm for Open/Distributed Constraint Optimization. In: National Conference on Artificial Intelligence, pp. 703–708 (2006)Google Scholar
  16. 16.
    Luo, X., Jennings, N.R., Shadbolt, N., Leung, H.F., Lee, J.H.M.: A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments. Artif. Intell. 148(1-2), 53–102 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Portway, C., Durfee, E.H.: The multi variable multi constrained distributed constraint optimization framework. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2010, vol. 1, pp. 1385–1386 (2010)Google Scholar
  18. 18.
    Yeoh, W., Varakantham, P., Koenig, S.: Caching schemes for DCOP search algorithms. In: 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 609–616 (2009)Google Scholar
  19. 19.
    Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., Matsuo, H.: Directed soft arc consistency in pseudo trees. In: AAMAS 2009: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 1065–1072 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Toshihiro Matsui
    • 1
  • Marius Silaghi
    • 2
  • Katsutoshi Hirayama
    • 3
  • Makoto Yokoo
    • 4
  • Hiroshi Matsuo
    • 1
  1. 1.Nagoya Institute of TechnologyNagoyaJapan
  2. 2.Florida Institute of TechnologyMelbourneUnited States of America
  3. 3.Kobe UniversityKobeJapan
  4. 4.Kyushu UniversityFukuokaJapan

Personalised recommendations