DocumentCode :
1996831
Title :
Decomposing Utility Functions in Bounded Max-sum for Distributed Constraint Optimization
Author :
Rollon, Emma ; Larrosa, Javier
Author_Institution :
Dept. de Llenguatges i Sist. Inf., Univ. Politec. de Catalunya, Barcelona, Spain
fYear :
2013
fDate :
3-4 Dec. 2013
Firstpage :
30
Lastpage :
33
Abstract :
Bounded Max-Sum is a message-passing algorithm for solving Distributed Constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction of an intermediate step that decomposes functions may significantly improve its accuracy. This is especially relevant in critical applications (e.g. automatic surveillance, disaster response scenarios) where the accuracy of solutions is of vital importance.
Keywords :
message passing; optimisation; DCOP; approximation ratio; bounded max-sum; distributed constraint optimization problem; message-passing algorithm; utility function decomposition; Approximation algorithms; Approximation methods; Constraint optimization; Equations; Linear programming; Probabilistic logic; Upper bound; Distributed constraint optimization problems; approximate algorithms; decomposition;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems (GCIS), 2013 Fourth Global Congress on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4799-2885-9
Type :
conf
DOI :
10.1109/GCIS.2013.11
Filename :
6805908
Link To Document :
بازگشت