Including Soft Global Constraints in DCOPs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2012

Including Soft Global Constraints in DCOPs


In the centralized context, global constraints have been essential for the advancement of constraint reasoning. In this paper we propose to include soft global constraints in distributed constraint optimization problems (DCOPs). Looking for efficiency, we study possible decompositions of global constraints, including the use of extra variables. We extend the distributed search algorithm BnB-ADOPT+ to support these representations of global constraints. In addi- tion, we explore the relation of global constraints with soft local consistency in DCOPs, in particular for the generalized soft arc consistency (GAC) level. We in- clude specific propagators for some well-known soft global constraints. Finally, we provide empirical results on several benchmarks.
Fichier principal
Vignette du fichier
cp12-disglobales.pdf (1.69 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00748177 , version 1 (05-11-2012)



Patricia Gutierrez, Pedro Meseguer, Christian Bessiere. Including Soft Global Constraints in DCOPs. CP 2012 - 18th International Conference on Principles and Practice of Constraint Programming, Oct 2012, Québec City, Canada. pp.175-190, ⟨10.1007/978-3-642-33558-7_15⟩. ⟨lirmm-00748177⟩
133 View
327 Download



Gmail Facebook X LinkedIn More