Japances Source pseudo-tree Japances Source

Translated title of the contribution: A resource constrained distributed constraint optimization method using resource constraint free pseudo-tree

Toshihiro Matsui, Marius C. Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Cooperative problem solving with shared resources is important in practical multi-agent systems. Resource constraints are necessary to handle practical problems such as distributed task scheduling with limited resource availability. As a fundamental formalism for multi-agent cooperation, the Distributed Constraint Optimization Problem (DCOP) has been investigated. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem. However, in the original DCOP framework, constraints for resources that are consumed by teams of agents are not well supported. A framework called Resource Constrained Distributed Constraint Optimization Problem (RCDCOP) has recently been proposed. In RCDCOPs, a limit on resource usage is represented as an n-ary constraint. Previous research addressing RCDCOPs employ a pseudo-tree based solver. The pseudo-tree is an important graph structure for constraint networks. A pseudo-tree implies a partial ordering of variables. However, n-ary constrained variables, which are placed on a single path of the pseudo-tree, decrease efficiency of the solver. We propose another method using (i) a pseudo-tree that is generated ignoring resource constraints and (ii) virtual variables representing the usage of resources. However the virtual variables increase search space. To improve pruning efciency of search, (iii) we apply a set of upper/lower bounds that are inferred from resource constraints. The efciency of the proposed method is evaluated by experiment.

Original languageJapanese
Pages (from-to)417-427
Number of pages11
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume24
Issue number5
DOIs
Publication statusPublished - Jan 1 2009

Fingerprint

Multi agent systems
Scheduling
Availability
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Japances Source pseudo-tree Japances Source. / Matsui, Toshihiro; Silaghi, Marius C.; Hirayama, Katsutoshi; Yokoo, Makoto; Matsuo, Hiroshi.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 24, No. 5, 01.01.2009, p. 417-427.

Research output: Contribution to journalArticle

Matsui, Toshihiro ; Silaghi, Marius C. ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Matsuo, Hiroshi. / Japances Source pseudo-tree Japances Source. In: Transactions of the Japanese Society for Artificial Intelligence. 2009 ; Vol. 24, No. 5. pp. 417-427.
@article{cc9334c3312a4af991211ed51dbef658,
title = "Japances Source pseudo-tree Japances Source",
abstract = "Cooperative problem solving with shared resources is important in practical multi-agent systems. Resource constraints are necessary to handle practical problems such as distributed task scheduling with limited resource availability. As a fundamental formalism for multi-agent cooperation, the Distributed Constraint Optimization Problem (DCOP) has been investigated. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem. However, in the original DCOP framework, constraints for resources that are consumed by teams of agents are not well supported. A framework called Resource Constrained Distributed Constraint Optimization Problem (RCDCOP) has recently been proposed. In RCDCOPs, a limit on resource usage is represented as an n-ary constraint. Previous research addressing RCDCOPs employ a pseudo-tree based solver. The pseudo-tree is an important graph structure for constraint networks. A pseudo-tree implies a partial ordering of variables. However, n-ary constrained variables, which are placed on a single path of the pseudo-tree, decrease efficiency of the solver. We propose another method using (i) a pseudo-tree that is generated ignoring resource constraints and (ii) virtual variables representing the usage of resources. However the virtual variables increase search space. To improve pruning efciency of search, (iii) we apply a set of upper/lower bounds that are inferred from resource constraints. The efciency of the proposed method is evaluated by experiment.",
author = "Toshihiro Matsui and Silaghi, {Marius C.} and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",
year = "2009",
month = "1",
day = "1",
doi = "10.1527/tjsai.24.417",
language = "Japanese",
volume = "24",
pages = "417--427",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "5",

}

TY - JOUR

T1 - Japances Source pseudo-tree Japances Source

AU - Matsui, Toshihiro

AU - Silaghi, Marius C.

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

PY - 2009/1/1

Y1 - 2009/1/1

N2 - Cooperative problem solving with shared resources is important in practical multi-agent systems. Resource constraints are necessary to handle practical problems such as distributed task scheduling with limited resource availability. As a fundamental formalism for multi-agent cooperation, the Distributed Constraint Optimization Problem (DCOP) has been investigated. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem. However, in the original DCOP framework, constraints for resources that are consumed by teams of agents are not well supported. A framework called Resource Constrained Distributed Constraint Optimization Problem (RCDCOP) has recently been proposed. In RCDCOPs, a limit on resource usage is represented as an n-ary constraint. Previous research addressing RCDCOPs employ a pseudo-tree based solver. The pseudo-tree is an important graph structure for constraint networks. A pseudo-tree implies a partial ordering of variables. However, n-ary constrained variables, which are placed on a single path of the pseudo-tree, decrease efficiency of the solver. We propose another method using (i) a pseudo-tree that is generated ignoring resource constraints and (ii) virtual variables representing the usage of resources. However the virtual variables increase search space. To improve pruning efciency of search, (iii) we apply a set of upper/lower bounds that are inferred from resource constraints. The efciency of the proposed method is evaluated by experiment.

AB - Cooperative problem solving with shared resources is important in practical multi-agent systems. Resource constraints are necessary to handle practical problems such as distributed task scheduling with limited resource availability. As a fundamental formalism for multi-agent cooperation, the Distributed Constraint Optimization Problem (DCOP) has been investigated. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem. However, in the original DCOP framework, constraints for resources that are consumed by teams of agents are not well supported. A framework called Resource Constrained Distributed Constraint Optimization Problem (RCDCOP) has recently been proposed. In RCDCOPs, a limit on resource usage is represented as an n-ary constraint. Previous research addressing RCDCOPs employ a pseudo-tree based solver. The pseudo-tree is an important graph structure for constraint networks. A pseudo-tree implies a partial ordering of variables. However, n-ary constrained variables, which are placed on a single path of the pseudo-tree, decrease efficiency of the solver. We propose another method using (i) a pseudo-tree that is generated ignoring resource constraints and (ii) virtual variables representing the usage of resources. However the virtual variables increase search space. To improve pruning efciency of search, (iii) we apply a set of upper/lower bounds that are inferred from resource constraints. The efciency of the proposed method is evaluated by experiment.

UR - http://www.scopus.com/inward/record.url?scp=71049142710&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049142710&partnerID=8YFLogxK

U2 - 10.1527/tjsai.24.417

DO - 10.1527/tjsai.24.417

M3 - 記事

VL - 24

SP - 417

EP - 427

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 5

ER -