Constraint Processing
Decentralised coordination of low-power embedded devices using the max-sum algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Dynamic distributed constraint reasoning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
The generalized distributive law
IEEE Transactions on Information Theory
Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach
Computer Communications
| Hi-index | 0.00 |
In this paper we address the problem of efficient decentralised coordination of cooperative multi-agent systems by taking into account the structure of the problem. We consider coordination problems that can be framed as Distributed Constraint Optimization Problems (DCOP).Graphical models such as junction trees are widely used in order to exploit the structure of an inference problem so as to minimise the complexity of the optimal solution of such problems. In this paper we propose an extension of the junction tree inference algorithm in order to provide it with properties befitting more closely multi-agent systems operational constraints. Specifically, our contribution is able to provide an adjustable trade-off between the make span of the coordination process and its decentralisation as well as the solution quality. We provide bounds, and report empirical results on two kinds of instances of coordination networks.