MP-ABT: A Minimal Perturbation Approach for Complex Local Problems

Ghizlane El Khattabi, El Mehdi El Graoui, Imade Benelallam, El Houssine Bouyakhf

2017

Abstract

The ability of Distributed Constraints Reasoning (DCR) to solve distributed combinatorial problems brings the DCR to have a considerable interest in multi-agent community. Hence, many DisCSP algorithms have been proposed in order to solve such distributed problems. The major limit of these algorithms is the simplification assumptions. The scientists assume that each agent is a simple one; it handles just one variable. But in the complex local problem case; where each agent has more than one variable; two methods are used: The compilation and the decomposition. These methods transform the original problem so as to make it as a simple one. In this paper, we propose a new protocol: MP-ABT (Minimal Perturbation complex local problems in the Asynchronous Backtracking). It is a resolution algorithm of DisCSPs with complex local problems. It is based on the ABT algorithm and the Dynamic CSP. Each complex agent is seen as a Minimal Perturbation Problem (MPP) and any received message is considered as a new intra-constraint perturbation event. The complex local problem is updated and a new MPP local solution is reported. The MP-ABT is presented and compared to three ABT families. Our experimental results show the MP-ABT effectiveness.

References

  1. Bessière, 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):7-24.
  2. Burke, D. A. and Brown, K. N. (2006). Applying interchangeability to complex local problems in distributed constraint reasoning. In Workshop on Distributed Constraint Reasoning (AAMAS 06), pages 1-15.
  3. EL Graoui, E. M., Benelallam, I., Bouyakhf, E. H., et al. (2016). A commentary on hybrid search for minimal perturbation in dynamic csps. Constraints, 21(2):349- 354.
  4. Ezzahir, R., Belaissaoui, M., Bessiere, C., and Bouyakhf, E. H. (2007). Compilation formulation for asynchronous backtracking with complex local problems. In 2007 International Symposium on Computational Intelligence and Intelligent Informatics, pages 205-211. IEEE.
  5. Ezzahir, R., Bessiere, C., Bouyakhf, E., and Belaissaoui, M. (2008). Asynchronous backtracking with compilation formulation for handling complex local problems. ICGST International Journal on Artificial Intelligence and Machine Learning, AIML, 8:45-53.
  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, pages 1199-1206. ACM.
  7. Magaji, A. S., Arana, I., and Ahriz, H. (2014). Local search for discsps with complex local problems. In Web Intelligence (WI) and Intelligent Agent Technologies (IAT), 2014 IEEE/WIC/ACM International Joint Conferences on, volume 3, pages 56-63. IEEE.
  8. Meisels, A. and Zivan, R. (2007). Asynchronous forwardchecking for discsps. Constraints, 12(1):131-150.
  9. Wahbi, M., Ezzahir, R., Bessiere, C., and Bouyakhf, E. H. (2013). Nogood-based asynchronous forward checking algorithms. Constraints, 18(3):404-433.
  10. Yokoo, M. (1995). Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In International Conference on Principles and Practice of Constraint Programming, pages 88-102. Springer.
  11. Yokoo, M., Ishida, T., Durfee, E. H., and Kuwabara, K. (1992). Distributed constraint satisfaction for formalizing distributed problem solving. In Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on, pages 614-621. IEEE.
  12. Zivan, R., Grubshtein, A., and Meisels, A. (2011). Hybrid search for minimal perturbation in dynamic csps. Constraints, 16(3):228-249.
Download


Paper Citation


in Harvard Style

El Khattabi G., El Graoui E., Benelallam I. and Bouyakhf E. (2017). MP-ABT: A Minimal Perturbation Approach for Complex Local Problems . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-219-6, pages 268-275. DOI: 10.5220/0006203502680275


in Bibtex Style

@conference{icaart17,
author={Ghizlane El Khattabi and El Mehdi El Graoui and Imade Benelallam and El Houssine Bouyakhf},
title={MP-ABT: A Minimal Perturbation Approach for Complex Local Problems},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2017},
pages={268-275},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006203502680275},
isbn={978-989-758-219-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - MP-ABT: A Minimal Perturbation Approach for Complex Local Problems
SN - 978-989-758-219-6
AU - El Khattabi G.
AU - El Graoui E.
AU - Benelallam I.
AU - Bouyakhf E.
PY - 2017
SP - 268
EP - 275
DO - 10.5220/0006203502680275