Virtual structure reduction on distributed k-coloring problems

Nathaniel Gemelli, Jeffrey Hudack, Jae C. Oh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Distributed Constraint Problem solving represents a fundamental research area in distributed artificial intelligence and multi-agent systems. The constraint density, or the ratio of the number of constraints to the number of variables, determines the difficulty of either finding a solution or minimizing the set of variable assignment conflicts in a constraint problem. Reducing the active density of a problem typically reduces difficulty in finding a solution. We present a fully distributed technique for reducing the active density of constraint graphs that represent Distributed Constraint Optimization Problems (DCOP), called Virtual Structure Reduction (VSR). The VSR technique leverages the occurrence of frozen pairs, or variables that must be assigned the same value based on shared constraints between variables within the local neighborhood. We show how frozen pairs can be used to identify surrogate relationships between variables which reduces the active set of nodes in the constraint graph and leads to a reduction in active density. We discuss our DCOP solver, integrated with the Distributed Stochastic Algorithm (DSA), called VSR-DSA. The VSR-DSA algorithm demonstrates significant performance gains compared to the DSA-B and MGM algorithms in messages, cycles, solution quality, and time on randomized instances of the 3-coloring problem.

Original languageEnglish (US)
Title of host publicationProceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013
PublisherIEEE Computer Society
Pages46-52
Number of pages7
ISBN (Print)9781479929023
DOIs
StatePublished - Jan 1 2013
Event2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013 - Atlanta, GA, United States
Duration: Nov 17 2013Nov 20 2013

Publication series

NameProceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013
Volume2

Other

Other2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013
CountryUnited States
CityAtlanta, GA
Period11/17/1311/20/13

Keywords

  • Distributed AI
  • Distributed Constraint Problem
  • Multi-agent Collaboration

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Virtual structure reduction on distributed k-coloring problems'. Together they form a unique fingerprint.

Cite this