Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Self-stabilizing depth-first search
Information Processing Letters
Methods for task allocation via agent coalition formation
Artificial Intelligence
Distributed Algorithms
Distributed Intelligent Agents
IEEE Expert: Intelligent Systems and Their Applications
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Organizational building blocks for design of distributed intelligent system
International Journal of Human-Computer Studies
A decentralized variable ordering method for distributed constraint optimization
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
IEEE Transactions on Mobile Computing
Optimal Solution Stability in Dynamic, Distributed Constraint Optimization
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Dynamic distributed constraint reasoning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Journal of Artificial Intelligence Research
Effect of DisCSP variable-ordering heuristics in scale-free networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
Autonomous Agents and Multi-Agent Systems
Effect of DisCSP variable-ordering heuristics in scale-free networks
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
Hi-index | 0.01 |
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.