Dynamic Agent Prioritisation with Penalties in Distributed Local Search

Amina Sambo-Magaji, Inés Arana, Hatem Ahriz

Abstract

Distributed Constraint Satisfaction Problems (DisCSPs) solving techniques solve problems which are distributed over a number of agents.The distribution of the problem is required due to privacy, security or cost issues and, therefore centralised problem solving is inappropriate. Distributed local search is a framework that solves large combinatorial and optimization problems. For large problems it is often faster than distributed systematic search methods. However, local search techniques are unable to detect unsolvability and have the propensity of getting stuck at local optima. Several strategies such as weights on constraints, penalties on values and probability have been used to escape local optima. In this paper, we present an approach for escaping local optima called Dynamic Agent Prioritisation and Penalties (DynAPP) which combines penalties on variable values and dynamic variable prioritisation for the resolution of distributed constraint satisfaction problems. Empirical evaluation with instances of random, meeting scheduling and graph colouring problems have shown that this approach solved more problems in less time at the phase transition when compared with some state of the art algorithms. Further evaluation of the DynAPP approach on iteration-bounded optimisation problems showed that DynAPP is competitive.

References

  1. Basharu, M., Arana, I., and Ahriz, H. (2006). Stochdispel: exploiting randomisation in dispel. In Proceedings of 7th International Workshop on Distributed Constraint Reasoning, DCR2006, pages 117-131.
  2. Basharu, M., Arana, I., and Ahriz, H. (2007a). Escaping local optima: constraint weights vs. value penalties. In 27th SGAI International Conference on Artificial Intelligence, AI-07, pages 51-64. Springer.
  3. Basharu, M., Arana, I., and Ahriz, H. (2007b). Solving coarse-grained discsps with multi-dispel and disbowd. Intelligent Agent Technology, IEEE / WIC / ACM International Conference on, 0:335-341.
  4. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
  5. Eisenberg, C. (2003). Distributed Constraint Satisfaction For Coordinating And Integrating A Large-Scale, Heterogeneous Enterprise. Phd. thesis no. 2817, Swiss Federal Institute of Technology (EPFL), Lausanne (Switzerland).
  6. Hirayama, K. and Yokoo, M. (2002). Local search for distributed sat with complex local problems. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3, AAMAS 7802, pages 1199-1206, New York, NY, USA. ACM.
  7. Lee, D. A. J. (2010). Hybrid algorithms for distributed constraint satisfaction. PhD thesis, School of Computing, The Robert Gordon University, Aberdeen.
  8. Rossi, F., Beek, P. v., and Walsh, T. (2006). Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York, NY, USA.
  9. Yokoo, M., Durfee, E. H., Ishida, T., and Kuwabara, K. (1998). The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans. on Knowl. and Data Eng., 10:673-685.
  10. Yokoo, M. and Hirayama, K. (1996). Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Proceedings of ICMAS-96.
  11. Zhang, W., Wang, G., and Wittenburg, L. . (2002). Distributed stochastic search for constraint satisfaction and optimization: Parallelism, phase transitions and performance. In Proceedings of AAAI Workshop on Probabilistic Approaches in Search.
Download


Paper Citation


in Harvard Style

Sambo-Magaji A., Arana I. and Ahriz H. (2013). Dynamic Agent Prioritisation with Penalties in Distributed Local Search . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8565-38-9, pages 276-281. DOI: 10.5220/0004259202760281


in Bibtex Style

@conference{icaart13,
author={Amina Sambo-Magaji and Inés Arana and Hatem Ahriz},
title={Dynamic Agent Prioritisation with Penalties in Distributed Local Search},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2013},
pages={276-281},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004259202760281},
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 - Dynamic Agent Prioritisation with Penalties in Distributed Local Search
SN - 978-989-8565-38-9
AU - Sambo-Magaji A.
AU - Arana I.
AU - Ahriz H.
PY - 2013
SP - 276
EP - 281
DO - 10.5220/0004259202760281