A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
An agent-based approach for building complex software systems
Communications of the ACM
Distributed Sensor Networks: A Multiagent Perspective
Distributed Sensor Networks: A Multiagent Perspective
Multiply-constrained distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Towards a formal framework for multi-objective multiagent planning
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
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
Distributed constraint optimization with structured resource constraints
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
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
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
UAV swarm coordination using cooperative control for establishing a wireless communications backbone
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 3 - Volume 3
The generalized distributive law
IEEE Transactions on Information Theory
Stochastic dominance in stochastic DCOPs for risk-sensitive applications
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Interactive algorithm for multi-objective constraint optimization
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Considering Equality on Distributed Constraint Optimization Problem for Resource Supply Network
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Multi-objective variable elimination for collaborative graphical games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality of B-MOMS in acyclic constraint graphs, and derive problem dependent bounds on its approximation ratio when these graphs contain cycles. Furthermore, we empirically evaluate its performance on a multi-objective extension of the canonical graph colouring problem. In so doing, we demonstrate that, for the settings we consider, the approximation ratio never exceeds 2, and is typically less than 1.5 for less-constrained graphs. Moreover, the runtime required by B-MOMS on the problem instances we considered never exceeds 30 minutes, even for maximally constrained graphs with 100 agents. Thus, B-MOMS brings the problem of multi-objective optimisation well within the boundaries of the limited capabilities of embedded agents.