Synchronizing for Performance - DCOP Algorithms

Or Peri, Amnon Meisels

2013

Abstract

The last decade has given rise to a large variety of search algorithms for distributed constraints optimization problems (DCOPs). All of these distributed algorithms operate among agents in an asynchronous environment. The present paper presents a categorization of DCOP algorithms into several classes of synchronization. Algorithms of different classes of synchronization are shown to behave differently with respect to idle time of agents and to irrelevant computation. To enable the investigation of the relation between the classes of synchronization of algorithms and their run-time performance, one can control the asynchronous behavior of the multi-agent system by changing the amount of message delays. A preliminary probabilistic model for computing the expected performance of DCOP algorithms of different synchronization classes is presented. These expectations are realized in experiments on delayed message asynchronous systems. It turns out that the performance of algorithms of a weaker synchronization class deteriorates much more when the system becomes asynchronous than the performance of more synchronized DCOP algorithms. The notable exception is that concurrent algorithms, that run multiple search processes, are much more robust to message delays than all other DCOP algorithms.

References

  1. Bessiere, C., Maestre, A., Brito, I., and Meseguer, P. (2005). Asynchronous Backtracking without adding links: a new member in the ABT Family. Artificial Intelligence, 161:1-2:7-24.
  2. Chechetka, A. and Sycara, K. (2006). An any-space algorithm for distributed constraint optimization. In Proc. AAAI Spring Symp. Distr. Plan Sched. Manag.
  3. Gershman, A., Meisels, A., and Zivan, R. (2009). Asynchronous Forward Bounding for Distributed COPs. J. Artif. Intell. Res. (JAIR), 34:61-88.
  4. Gutierrez, P. and Meseguer, P. (2010). Saving redundant messages in bnb-adopt. In Proc. 24th AAAI Conf. Artif. Intell. (AAAI-10), pages 1259-1260.
  5. Gutierrez, P., Meseguer, P., and Yeoh, W. (2011). Generalizing adopt and bnb-adopt. In Proc. 23rd Intern. Joint Conf. Artif. Intell. (IJCAI-11), pages 554-559.
  6. Hirayama, K. and Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In Proc. CP-97, pages 222-236.
  7. Meisels, A. (2008). Distributed search by constrained agents. Springer Verlag.
  8. Meisels, A., Razgon, I., Kaplansky, E., and Zivan, R. (2002). Comparing performance of distributed constraints processing algorithms. In Proc. AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR, pages 86-93, Bologna.
  9. Modi, P. J., Shen, W., Tambe, M., and Yokoo, M. (2005). Adopt: asynchronous distributed constraints optimization with quality guarantees. Artificial Intelligence, 161:1-2:149-180.
  10. Netzer, A., Meisels, A., and Grubshtein, A. (2010). Concurrent Forward Bounding for DCOPs. In Proc. 12th intern. workshop Dist. Const. Reas. (DCR-10) (AAMAS10), Toronto.
  11. W. Yeoh, X. S. and Koenig, S. (2009). Trading off solution quality for faster computation in dcop search algorithms. In Proc. 21st Intern. Joint Conf. Artif. Intell. (IJCAI-09), pages 354-360.
  12. Yeoh, W., Felner, A., and Koenig, S. (2010). Bnb-adopt: An asynchronous branch-and-bound dcop algorithm. J. Artif. Intell. Res. (JAIR), 38:85-133.
  13. Yokoo, M. (2000). Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents & Multi-Agent Sys., 3:198-212.
  14. Zivan, R. and Meisels, A. (2006a). Concurrent search for distributed csps. Artif. Intell., 170(4-5):440-461.
  15. Zivan, R. and Meisels, A. (2006b). Message delay and asynchronous discsp search. Archives of Control Sciences, 16(2):221-242.
  16. Zivan, R. and Meisels, A. (2006c). Message delay and discsp search algorithms. Ann. Math. Artif. Intell. (AMAI), 46:415-439.
Download


Paper Citation


in Harvard Style

Peri O. and Meisels A. (2013). Synchronizing for Performance - DCOP Algorithms . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8565-38-9, pages 5-14. DOI: 10.5220/0004179100050014


in Bibtex Style

@conference{icaart13,
author={Or Peri and Amnon Meisels},
title={Synchronizing for Performance - DCOP Algorithms},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2013},
pages={5-14},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004179100050014},
isbn={978-989-8565-38-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Synchronizing for Performance - DCOP Algorithms
SN - 978-989-8565-38-9
AU - Peri O.
AU - Meisels A.
PY - 2013
SP - 5
EP - 14
DO - 10.5220/0004179100050014