Abstract
We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. For exact computation, the size of the largest message is exponential in the width of the constraint graph. We present a distributed approximation scheme where the size of the largest message can be adapted to the desired approximation ratio, α. The process is similar to a distributed version of the minibucket elimination scheme, performed on a DFS traversal of the problem.
The second part of this paper presents an anytime version of the algorithm, that is suitable for very large, distributed problems, where the propagations may take too long to complete.
Simulation results show that these algorithms are a viable approach to real world, loose optimization problems, possibly of unbounded size.
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.
Similar content being viewed by others
References
Dechter, R.: Bucket elimination: A unifying framework for processing hard and soft constraints. Constraints: An International Journal 7(2), 51–55 (1997)
Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2004) (2004)
Modi, P.J., Shen, W.M., Tambe, M.: An asynchronous complete method for distributed constraint optimization. In: Proc. AAMAS (2003)
Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland (August 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petcu, A., Faltings, B. (2005). Approximations in Distributed Optimization. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_68
Download citation
DOI: https://doi.org/10.1007/11564751_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)