论文信息 - Distributed Coordination through Anarchic Optimization

Distributed Coordination through Anarchic Optimization

In this chapter, a peer-to-peer algorithm is described for approximately solving distributed, real-time, constraint optimization problems. The ANTS challenge problem is formulated as a distributed constraint optimization problem; an approximation version of the classical problem of graph k-coloring is formulated as a distributed constraint optimization problem to enable simple experimental assessment of the algorithm’s performance.

Stephen Fitzpatrick | Lambert Meertens | L. Meertens | S. Fitzpatrick

[1] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[2] J. Culberson. Iterated Greedy Graph Coloring and the Difficulty Landscape , 1992 .

[3] Stephen Fitzpatrick,et al. Peer-to-Peer Coordination of Autonomous Sensors in High-Latency Networks using Distributed Scheduling and Data Fusion∗ , 2001 .

[4] Marko Fabiunke,et al. Parallel Distributed Constraint Satisfaction , 1999, PDPTA.