Abstract
Here we introduce a novel algorithm for continual optimisation of dynamic distributed constraint optimisation problems. By using techniques derived from argumentation for communication the algorithm does not need to use an ordering over the variables. The lack of a hierarchy allows the algorithm to efficiently solve dynamic problems, as well as be completely asynchronous, fault tolerant and anytime. However it prevents an ordered search, making the algorithm incomplete.
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
Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161, 149–180 (2005)
Silaghi, M.C., Yokoo, M.: Nogood based asynchronous distributed optimization (adopt-ng). In: AAMAS 2006: Procedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 1389–1396. ACM, New York (2006)
Yeoh, W., Felner, A., Koenig, S.: Bnb-adopt: an asynchronous branch-and-bound dcop algorithm. In: AAMAS 2008: Procedings of the 7th international joint conference on Autonomous agents and multiagent systems, Richland, SC, International Foundation for Autonomous Agents and Multiagent Systems, pp. 591–598 (2008)
Petcu, A., Faltings, B.: Dpop: A scalable method for multiagent constraint optimization. In: IJCAI 2005, Edinburgh, Scotland, August 2005, pp. 266–271 (2005)
Chechetka, A., Sycara, K.: No-commitment branch and bound search for distributed constraint optimization. In: AAMAS 2006: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 1427–1429. ACM, New York (2006)
Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: AAMAS 2005: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 1049–1056. ACM, New York (2005)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problem. International Journal of Artifical Intelligence Tools 3(2), 187–207 (1994)
Mertens, K.: An Ant-Based Approach for Solving Dynamic Constraint Optimization Problems. PhD thesis, Katholieke Universiteit Leuven (December 2006)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. In: Proceedings of Tools with Artificial Intelligence, 1993. TAI 1993, November 1993, pp. 48–55 (1993)
Harvey, P., Chang, C.F., Ghose, A.: Support-based distributed search: a new approach for multiagent constraint processing. In: AAMAS 2006: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 377–383. ACM, New York (2006)
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billiau, G., Ghose, A. (2009). SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation. In: Yang, JJ., Yokoo, M., Ito, T., Jin, Z., Scerri, P. (eds) Principles of Practice in Multi-Agent Systems. PRIMA 2009. Lecture Notes in Computer Science(), vol 5925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11161-7_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-11161-7_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11160-0
Online ISBN: 978-3-642-11161-7
eBook Packages: Computer ScienceComputer Science (R0)