SBDO: A new robust approach to dynamic distributed constraint optimisation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7057 LNAI, Issue , 2012, Pages 11-26

  Billiau, Graham ^a   Chang, Chee Fon ^a   Ghose, Aditya ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM FOR SOLVING; DISTRIBUTED CONSTRAINT OPTIMISATION; DISTRIBUTED OPTIMISATION; FAULT-TOLERANT; HARD CONSTRAINTS; MULTI-AGENT PROBLEMS; ROBUST APPROACHES; SOLUTION QUALITY;

ALGORITHMS; DATA PRIVACY; MULTI AGENT SYSTEMS; NETWORK SECURITY;

OPTIMIZATION;

EID: 84877699843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25920-3_2     Document Type: Conference Paper

References (12)

1. Chechetka, A., Sycara, K.: No-commitment branch and bound search for distributed constraint optimization. In: AAMAS 2006, pp. 1427-1429. ACM (2006)
2. Harvey, P., Chang, CF., Ghose, A.: Support-based distributed search: a new approach for multiagent constraint processing. In: AAMAS 2006, pp. 377-383. ACM (2006)
3. Kiekintveld, C, Yin, Z., Kumar, A., Tambe, M.: Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In: AAMAS, pp. 133-140 (2010)
4. Léauté, T., Ottens, B., Szymanek, R.: FRODO 2.0: An open-source framework for distributed constraint optimization. In: Proceedings of the IJCAI 2009 Distributed Constraint Reasoning Workshop (DCR 2009), Pasadena, California, USA, pp. 160-164 (July 13, 2009), http://liawww.epfl.ch/ frodo/
5. Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proceedings of DCR Workshop, AAMAS 2002 (2002)
6. Mertens, K.: An Ant-Based Approach for Solving Dynamic Constraint Optimization Problems. PhD thesis, Katholieke Universiteit Leuven (December 2006)
7. Modi, P.J., Shen, W.-M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161, 149-180 (2005)
8. Petcu, A., Faltings, B.: S-dpop: Superstabilizing, fault-containing multiagent combinatorial optimization. In: Proceedings of the National Conference on Artificial Intelligence, AAAI-2005, pp. 449-454. AAAI, Pittsburgh (July 2005)
9. Portway, C.P.: USC dcop repository (2008), http://teamcore.usc.edu/dcop
10. Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. In: TAI 1993, pp. 48-55 (1993)
11. Stranders, R., Farinelli, A., Rogers, A., Jennings, N.R.: Decentralised coordination of continuously valued control parameters using the max-sum algorithm. In: AAMAS, vol. (1), pp. 601-608 (2009)
12. Vinyals, M., Pujol, M., Rodríguez-Aguilar, J.A., Cerquides, J.: Divide-and-coordinate: Dcops by agreement. In: AAMAS, pp. 149-156 (2010)