Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Some simple task assignment problems for distributed networked agents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lee, D.C. ; Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA

This paper formulates, in the abstract, a problem of assigning subtasks to distributed agents (processors) so that they can perform a certain global task efficiently. We model the group of networked agents by a graph that describes its communication capabilities, which is referred to as the organizational graph. In addition, we assume that the desired task-performing activity defines another graph describing the required communication. We then formulate a few variants of the problem with potentially conflicting objectives (or constraints) of load balancing and communication costs. For some of these variants, we provide algorithms that solve the assignment problem, while some others are left open

Published in:

Knowledge-Based Intelligent Engineering Systems and Allied Technologies, 2000. Proceedings. Fourth International Conference on  (Volume:1 )

Date of Conference:

2000