Including Soft Global Constraints in DCOPs

Abstract : 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00748177
Contributor : Joël Quinqueton <>
Submitted on : Monday, November 5, 2012 - 9:24:36 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: Wednesday, February 6, 2013 - 3:53:44 AM

File

cp12-disglobales.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00748177, version 1

Collections

Citation

Patricia Gutierrez, Pedro Meseguer, Christian Bessière. Including Soft Global Constraints in DCOPs. CP: Principles and Practice of Constraint Programming, Oct 2012, Québec City, Canada. pp.175-190. ⟨lirmm-00748177⟩

Share

Metrics

Record views

216

Files downloads

409