Conference proceeding
Dynamic Configuration of Agent Organizations
21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, pp.305-311
01 Jan 2009
Abstract
It is useful to impose organizational structure over multiagent coalitions. Hierarchies, for instance, allow for compartmentalization of tasks: if organized correctly, tasks in disjoint subtrees of the hierarchy may be performed in parallel. Given a notion of the way in which a group of agents need to interact, the Dynamic Distributed Multiagent Hierarchy Generation (DynDisMHG) problem is to determine the best hierarchy that might expedite the process of coordination. This paper introduces a distributed algorithm, called Mobed, for both constructing and maintaining organizational agent hierarchies, enabling exploitation of parallelism in distributed problem solving. The algorithm is proved correct and it is shown that individual additions of agents to the hierarchy will run in an amortized linear number of rounds. The hierarchies resulting after perturbations to the agent coalition have constant-bounded edit distance, making Mobed very well suited to highly dynamic problems.
Metrics
21 Record Views
Details
- Title
- Dynamic Configuration of Agent Organizations
- Creators
- Evan A. Sultanik - Drexel UniversityRobert N. Lass - Drexel UniversityWilliam C. Regli - Drexel University
- Contributors
- C Boutilier (Editor)
- Publication Details
- 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, pp.305-311
- Conference
- 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), 21st
- Publisher
- Ijcai-Int Joint Conf Artif Intell
- Number of pages
- 7
- Resource Type
- Conference proceeding
- Language
- English
- Identifiers
- 991019357772604721
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Computer Science, Artificial Intelligence
- Computer Science, Theory & Methods