Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Culberson, Joseph (1992). Iterated Greedy Graph Coloring and the Difficulty Landscape, Technical Report TR 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, June 1992.
Fabiunke, Marko (1999). Parallel Distributed Constraint Satisfaction, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA′99), pp. 1585–1591.
Fitzpatrick, Stephen, & Meertens, Lambert (2001). An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourerfor Sparse Graphs, 1st Symposium on Stochastic Algorithms: Foundations and Applications, Lecture Notes in Computer Science 2264, Kathleen Steinhefel (Ed.), Springer-Verlag ISBN 3-540-43025-3, pp. 49–64.
Lewandowski, Gary, & Condon, Anne (1996). Experiments with Parallel Graph Coloring Heuristics in Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, 1996, pp. 309–334.
Meertens, Lambert, and Fitzpatrick, Stephen (2001). Peer-to-Peer Coordination of Autonomous Sensors in High-Latency Networks using Distributed Scheduling and Data Fusion, Technical Report KES.U.01.09, December 2001, Kestrel Institute, Palo Alto, California.
Yokoo, Makoto, Durfree, Edmund H., Ishida, Tom & Kuwabara, Kazuhiro (1992). The Distributed Constraint Satisfaction Problem: Formalization and Algorithms, IEEE Trans, on Knowledge and Data Engineering, vol. 10, no. 5, September/October 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fitzpatrick, S., Meertens, L. (2003). Distributed Coordination through Anarchic Optimization. In: Lesser, V., Ortiz, C.L., Tambe, M. (eds) Distributed Sensor Networks. Multiagent Systems, Artificial Societies, and Simulated Organizations, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0363-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0363-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5039-2
Online ISBN: 978-1-4615-0363-7
eBook Packages: Springer Book Archive