ACM Home Page
Please provide us with feedback. Feedback
A scalable, distributed algorithm for efficient task allocation
Full text PdfPdf (440 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3 table of contents
Bologna, Italy
SESSION: Session 11B: distributed problem solving table of contents
Pages: 1191 - 1198  
Year of Publication: 2002
ISBN:1-58113-480-0
Authors
Pedro V. Sander  Harvard University, Cambridge, MA
Denis Peleshchuk  Harvard University, Cambridge, MA
Barbara J. Grosz  Harvard University, Cambridge, MA
Sponsors
ACM: Association for Computing Machinery
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 35,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/545056.545098
What is a DOI?

ABSTRACT

We present a distributed algorithm for task allocation in multi-agent systems for settings in which agents and tasks are geographically dispersed in two-dimensional space. We describe a method that enables agents to determine individually how to move so that they are, as a group, efficiently assigned to tasks. The method comprises two algorithms and is especially useful in environments with very large numbers of agent and task nodes. One algorithm adapts computational geometry techniques to determine adjacency information for the agent nodes given the geographical positions of agents and tasks. This adjacency information is used to determine the visible nodes that are most relevant to an agent's decision making process and to eliminate those that it should not consider. The second algorithm uses local heuristics based solely on an agent's adjacent nodes to determine its course of action. This method yields improved task allocations compared to previous algorithms proposed for similar environments. We also present a modification to the second algorithm that improves performance in environments in which multiple agents are required to complete a single task.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Barber, C. B., Huhdanpaa, H. The Qhull software library. URL: http://www.geom.umn.edu/software/qhull/
 
2
Corkill, D. D., and Lesser, V. R. The use of meta-level Control for coordination in a distributed problem dolving network Proc. Int. Joint Conf. On AI, Karlsruhe, Germany, pp 748--756, 1986.
 
3
Delaunay, B. Sur la sphère vide. Bull. Acad. Sci. USSR(VII), Classe Sci. Mat. Nat., 793--800, 1934.
 
4
Ephrati, E., Pollack, M. E., Ur, S. Deriving multi-agent coordination through filtering strategies. Proceedings of 14th International Joint Conference on Artificial Intelligence, 1995.
5
 
6
 
7
 
8
 
9
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M. Coverage Problems in Wireless Ad-hoc Sensor Networks. Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, 2001.
10
 
11
 
12
Sandholm, T., Lesser, V. Issues in automated negotiation and electronic commerce: Extending the contract net framework. Proceedings of the First International Conference on Multiagent Systems, 1995.
 
13
 
14
 
15


Collaborative Colleagues:
Pedro V. Sander: colleagues
Denis Peleshchuk: colleagues
Barbara J. Grosz: colleagues