Reducing the search space of resource constrained DCOPs

Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Boi Faltings, Hiroshi Matsuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Distributed constraint optimization problems (DCOPs) have been studied as a basic framework of multi-agent cooperation. The Resource Constrained DCOP (RCDCOP) is a special DCOP framework that contains n-ary hard constraints for shared resources. In RCDCOPs, for a value of a variable, a certain amount of the resource is consumed. Upper limits on the total use of resources are defined by n-ary resource constraints. To solve RCDCOPs, exact algorithms based on pseudo-trees employ virtual variables whose values represent use of the resources. Although, virtual variables allow for solving the problems without increasing the depth of the pseudo-tree, they exponentially increase the size of search spaces. Here, we reduce the search space of RCDCOPs solved by a dynamic programming method. Several boundaries of resource use are exploitable to reduce the size of the tables. To employ the boundaries, additional pre-processing and further filtering are applied. As a result, infeasible solutions are removed from the tables. Moreover, multiple elements of the tables are aggregated into fewer elements. By these modifications, redundancy of the search space is removed. One of our techniques reduces the size of the messages by an order of magnitude.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming, CP 2011 - 17th International Conference, Proceedings
Pages576-590
Number of pages15
DOIs
Publication statusPublished - Sep 26 2011
Event17th International Conference on Principles and Practice of Constraint Programming, CP 2011 - Perugia, Italy
Duration: Sep 12 2011Sep 16 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6876 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th International Conference on Principles and Practice of Constraint Programming, CP 2011
CountryItaly
CityPerugia
Period9/12/119/16/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Reducing the search space of resource constrained DCOPs'. Together they form a unique fingerprint.

  • Cite this

    Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., Faltings, B., & Matsuo, H. (2011). Reducing the search space of resource constrained DCOPs. In Principles and Practice of Constraint Programming, CP 2011 - 17th International Conference, Proceedings (pp. 576-590). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6876 LNCS). https://doi.org/10.1007/978-3-642-23786-7_44