Presentation 2003/3/7
Distributed Task Assignment for Information Gathering
Katsutoshi HIRAYAMA, Yasuhiko KITAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper describes a method to solve the distributed task assignment problem on a simple model of multi-agent information gathering. This model consists of two types of agents: Information Integration agents (I-agents) and Information Gathering agents (G-agents). I-agents assign tasks of watching some information sources to G-agents and G-agents notify I-agents of renewal of information sources that they have been watching. In this model, I-agents need to assign watching tasks so that the assignment meets not only users' requirements but also resource constraints imposed upon G-agents. Also, it is desirable that I-agents can obtain such an assignment without revealing users' requirements each other because such requirements may include some private information. In this paper, we encode this assignment problem as distributed SAT and solve it using a general-purpose distributed SAT algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Task assignment / Distributed CSP / SAT
Paper # AI2002-72
Date of Issue

Conference Information
Committee AI
Conference Date 2003/3/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Distributed Task Assignment for Information Gathering
Sub Title (in English)
Keyword(1) Task assignment
Keyword(2) Distributed CSP
Keyword(3) SAT
1st Author's Name Katsutoshi HIRAYAMA
1st Author's Affiliation Kobe University of Mercantile Marine()
2nd Author's Name Yasuhiko KITAMURA
2nd Author's Affiliation Graduate School of Engineering, Osaka City University
Date 2003/3/7
Paper # AI2002-72
Volume (vol) vol.102
Number (no) 710
Page pp.pp.-
#Pages 6
Date of Issue