{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:20:51Z","timestamp":1777890051544,"version":"3.51.4"},"reference-count":15,"publisher":"SAGE Publications","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MGS"],"published-print":{"date-parts":[[2023,2,3]]},"abstract":"<jats:p>In this work, we propose a new approach for coordinating generated agents\u2019 plans dynamically. The purpose is to take into consideration new conflicts introduced in new versions of agents\u2019 plans. The approach consists in finding the best combination which contains one plan for each agent among its set of possible plans whose execution does not entail any conflict. This combination of plans is reconstructed dynamically, each time agents decide to change their plans to take into account unpredictable changes in the environment. This not only ensures that new conflicts are likely to be introduced in the new plans that are taken into account but also it allows agents to deal, solely, with the execution of their actions and not with the resolution of conflicts. For this, we use genetic algorithms where the proposed fitness function is defined based on the number of conflicts that agents can experience in each combination of plans. As part of our work, we used a concrete case to illustrate and show the usefulness of our approach.<\/jats:p>","DOI":"10.3233\/mgs-220304","type":"journal-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T11:47:39Z","timestamp":1675165659000},"page":"219-239","source":"Crossref","is-referenced-by-count":3,"title":["A new approach for coordinating generated agents\u2019 plans dynamically"],"prefix":"10.1177","volume":"18","author":[{"given":"Nour El Houda","family":"Dehimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tahar","family":"Guerram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zakaria","family":"Tolba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/MGS-220304_ref3","unstructured":"A. Canu and A.I. Mouaddib, Dynamic local interaction model: framework and algorithms, in: 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201911), 2011."},{"key":"10.3233\/MGS-220304_ref6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3233\/MGS-180290","article-title":"A novel distributed dynamic planning approach based on constraints satisfaction","volume":"14","author":"Dehimi","year":"2018","journal-title":"Multiagent and Grid Systems \u2013 An International Journal"},{"key":"10.3233\/MGS-220304_ref7","unstructured":"M.P. Georgeff, Communication and interaction in multi-agent planning, in: Proceedings of the Third National Conference on Artificial Intelligence (AAAI-83), August 1983, pp. 125\u2013129."},{"key":"10.3233\/MGS-220304_ref9","unstructured":"C.J. Stuart, An implementation of a multi-agent plan synchronizer, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), Morgan Kaufmann Publishers, August 1985, pp. 1031\u20131033."},{"key":"10.3233\/MGS-220304_ref11","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","article-title":"Complexity results for SAS+ planning","volume":"11","author":"B\u00e4ckstr\u00f6m","year":"1996","journal-title":"Computational Intelligence"},{"issue":"4","key":"10.3233\/MGS-220304_ref12","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1111\/j.1467-8640.1992.tb00383.x","article-title":"Merging separately generated plans with restricted interactions","volume":"8","author":"Yang","year":"1992","journal-title":"Computational Intelligence"},{"issue":"2\u20133","key":"10.3233\/MGS-220304_ref13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","article-title":"Theory and algorithms for plan merging","volume":"57","author":"Foulser","year":"1992","journal-title":"Artificial Intelligence Journal"},{"key":"10.3233\/MGS-220304_ref15","doi-asserted-by":"crossref","unstructured":"R.G. Smith and R. Davis, Frameworks for cooperation in distributed problem solving, IEEE Transactions on Systems, Man, and Cybernetics 11(1) (1980).","DOI":"10.1109\/TSMC.1981.4308579"},{"key":"10.3233\/MGS-220304_ref17","unstructured":"S. Cammarata, D. McArthur and R. Steeb, Strategies of cooperation in distributed problem solving, in: Proceedings of the 8th International Joint Conference on Artificial Intelligence, 1983, pp. 767\u2013770."},{"issue":"2","key":"10.3233\/MGS-220304_ref20","first-page":"37","article-title":"Negotiation and game theory: The \u201cunderside\u201d of an acceptable agreement","volume":"12","author":"Pereau","year":"2009","journal-title":"Negotiations"},{"key":"10.3233\/MGS-220304_ref21","unstructured":"M. Paletta and P. Herrero, A mas-based negotiation mechanism to deal with saturated conditions in distributed environments, in: International Conference on Agents and Artificial Intelligence (ICAART), 2010, pp. 1\u20137."},{"issue":"1","key":"10.3233\/MGS-220304_ref22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.2478\/acss-2014-0001","article-title":"Multi-agent auction based simulation tool for an insurance policy market","volume":"15","author":"Lavendelis","year":"2014","journal-title":"Applied Computer Systems"},{"issue":"3","key":"10.3233\/MGS-220304_ref23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10472-009-9145-6","article-title":"Formal analysis of interest-based negotiation","volume":"55","author":"Rahwan","year":"2009","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.3233\/MGS-220304_ref24","doi-asserted-by":"crossref","unstructured":"F. Bergenti and A. Ricci, Three approaches to the coordination of multiagent systems, in: 2002 ACM Symposium on Applied Computing (SAC), New York, NY, USA, ACM, 2002, pp. 367\u2013372.","DOI":"10.1145\/508791.508861"},{"key":"10.3233\/MGS-220304_ref25","unstructured":"B. Subagdja and A.-H. Tan, On coordinating pervasive persuasive agents, in: International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2014, pp. 1467\u20131468."}],"container-title":["Multiagent and Grid Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/MGS-220304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:28:56Z","timestamp":1777613336000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/MGS-220304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,3]]},"references-count":15,"journal-issue":{"issue":"3-4"},"URL":"https:\/\/doi.org\/10.3233\/mgs-220304","relation":{},"ISSN":["1875-9076","1574-1702"],"issn-type":[{"value":"1875-9076","type":"electronic"},{"value":"1574-1702","type":"print"}],"subject":[],"published":{"date-parts":[[2023,2,3]]}}}