loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ghizlane El Khattabi 1 ; El Mehdi El Graoui 1 ; Imade Benelallam 2 and El Houssine Bouyakhf 1

Affiliations: 1 LIMIARF, Morocco ; 2 LIMIARF and INSEA, Morocco

Keyword(s): Multi Agent System, Distributed Constraint Satisfaction Problem, Complex Local Problem, Minimal Perturbation Problem.

Related Ontology Subjects/Areas/Topics: Agent Communication Languages ; Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Constraint Satisfaction ; Distributed and Mobile Software Systems ; Distributed Problem Solving ; Enterprise Information Systems ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Multi-Agent Systems ; Software Engineering ; Symbolic Systems

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 consi dered 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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.143.9.115

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 2: ICAART; ISBN 978-989-758-219-6; ISSN 2184-433X, SciTePress, pages 268-275. DOI: 10.5220/0006203502680275

@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 2: ICAART},
year={2017},
pages={268-275},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006203502680275},
isbn={978-989-758-219-6},
issn={2184-433X},
}

TY - CONF

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

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic