Distributed problem solving in geometrically-structured constraint networks

Authors:
Roger Mailler;Huimin Zheng
Affiliations:
University of Tulsa, Tulsa, OK, USA;University of Tulsa, Tulsa, OK, USA
Venue:
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Year:
2013

Citing 4
Cited 0

Asynchronous Forward-checking for DisCSPs

Constraints
Reaction functions for task allocation to cooperative agents

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
An Agent-Based Distributed Coordination Mechanism for Wireless Visual Sensor Nodes Using Dynamic Programming

The Computer Journal
Improving Asynchronous Partial Overlay

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed Constraint Satisfaction (DisCSP) is a popular formalism that is used for developing a wide variety of general-purpose protocols. With very few exceptions, these protocol are tested using completely random instances with the understanding that this leads to better overall solutions. In many real-world situations, however, the variables in the problem represent objects that exist in n-dimensional space with constraints between them based on distance. In such instances, the constraint network forms a geometric graph and therefore is referred to as a Geometrically-Structured Constraint Satisfaction Problem (GS-CSP). This paper introduces the GS-CSP and evaluates the performance of two complete DisCSP protocols to demonstrate how the introduction of structure affects these general problem solving approaches. Our findings show that GS-CSPs possess unique characteristics particularly in the phase transition regions and these characteristics can have a dramatic impact on the performance of current DisCSP algorithms.