<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02317201</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-15T10:56:15+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Distributed Foraging Algorithm Based on Artificial Potential Field</title>
            <author role="aut">
              <persName>
                <forename type="first">Ouarda</forename>
                <surname>Zedadra</surname>
              </persName>
              <idno type="halauthorid">1671638-0</idno>
              <affiliation ref="#struct-345205"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Jouandeau</surname>
              </persName>
              <email type="md5">eb116583a5dd5009aae292c91267ec94</email>
              <email type="domain">univ-paris8.fr</email>
              <idno type="idhal" notation="string">nicolas-jouandeau</idno>
              <idno type="idhal" notation="numeric">175121</idno>
              <idno type="halauthorid" notation="string">34742-175121</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6902-4324</idno>
              <affiliation ref="#struct-104738"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hamid</forename>
                <surname>Seridi</surname>
              </persName>
              <idno type="halauthorid">922822-0</idno>
              <affiliation ref="#struct-345205"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Giancarlo</forename>
                <surname>Fortino</surname>
              </persName>
              <email type="md5">9e4b9b57f0a90661ccad9a59496b8c19</email>
              <email type="domain">unical.it</email>
              <idno type="idhal" notation="numeric">864530</idno>
              <idno type="halauthorid" notation="string">426159-864530</idno>
              <affiliation ref="#struct-106539"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nicolas</forename>
                <surname>Jouandeau</surname>
              </persName>
              <email type="md5">eb116583a5dd5009aae292c91267ec94</email>
              <email type="domain">univ-paris8.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-10-15 20:22:15</date>
              <date type="whenModified">2026-02-26 12:12:29</date>
              <date type="whenReleased">2019-10-16 09:37:23</date>
              <date type="whenProduced">2015-04</date>
              <date type="whenEndEmbargoed">2019-10-15</date>
              <ref type="file" target="https://hal.science/hal-02317201v1/document">
                <date notBefore="2019-10-15"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02317201v1/file/zedadraISPS.pdf" id="file-2317201-2233390">
                <date notBefore="2019-10-15"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="462893">
                <persName>
                  <forename>Nicolas</forename>
                  <surname>Jouandeau</surname>
                </persName>
                <email type="md5">eb116583a5dd5009aae292c91267ec94</email>
                <email type="domain">univ-paris8.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02317201</idno>
            <idno type="halUri">https://hal.science/hal-02317201</idno>
            <idno type="halBibtex">zedadra:hal-02317201</idno>
            <idno type="halRefHtml">&lt;i&gt;12th IEEE International Symposium on Programming and Systems&lt;/i&gt;, Apr 2015, Alger, Algeria. &lt;a target="_blank" href="https://dx.doi.org/10.1109/ISPS.2015.7244986"&gt;&amp;#x27E8;10.1109/ISPS.2015.7244986&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">12th IEEE International Symposium on Programming and Systems, Apr 2015, Alger, Algeria. &amp;#x27E8;10.1109/ISPS.2015.7244986&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2317201-2233390"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS8" corresp="UNIV-PARIS-LUMIERES">Université Paris VIII Vincennes-Saint Denis</idno>
            <idno type="stamp" n="LIASD" corresp="UNIV-PARIS8">Laboratoire d'Intelligence Artificielle et Sémantique des Données</idno>
            <idno type="stamp" n="UNIV-PARIS-LUMIERES"/>
            <idno type="stamp" n="UNIV-PARIS8-OA" corresp="UNIV-PARIS8">HAL UNIV-PARIS8 - open access</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Distributed Foraging Algorithm Based on Artificial Potential Field</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ouarda</forename>
                    <surname>Zedadra</surname>
                  </persName>
                  <idno type="halauthorid">1671638-0</idno>
                  <affiliation ref="#struct-345205"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Jouandeau</surname>
                  </persName>
                  <email type="md5">eb116583a5dd5009aae292c91267ec94</email>
                  <email type="domain">univ-paris8.fr</email>
                  <idno type="idhal" notation="string">nicolas-jouandeau</idno>
                  <idno type="idhal" notation="numeric">175121</idno>
                  <idno type="halauthorid" notation="string">34742-175121</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6902-4324</idno>
                  <affiliation ref="#struct-104738"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hamid</forename>
                    <surname>Seridi</surname>
                  </persName>
                  <idno type="halauthorid">922822-0</idno>
                  <affiliation ref="#struct-345205"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Giancarlo</forename>
                    <surname>Fortino</surname>
                  </persName>
                  <email type="md5">9e4b9b57f0a90661ccad9a59496b8c19</email>
                  <email type="domain">unical.it</email>
                  <idno type="idhal" notation="numeric">864530</idno>
                  <idno type="halauthorid" notation="string">426159-864530</idno>
                  <affiliation ref="#struct-106539"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">2015 12th International Symposium on Programming and Systems (ISPS)</title>
                <meeting>
                  <title>12th IEEE International Symposium on Programming and Systems</title>
                  <date type="start">2015-04</date>
                  <settlement>Alger</settlement>
                  <country key="DZ">Algeria</country>
                </meeting>
                <imprint/>
              </monogr>
              <idno type="doi">10.1109/ISPS.2015.7244986</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Simple collections of agents that perform collectively and use distributed control algorithms constitute the interests of swarm robotics. A key issue to improve system performances is to effectively coordinate the team of agents. We present in this paper a multi-agent foraging algorithm called Cooperative-Color Marking Foraging Agents (C-CMFA). It uses the coordination rules of the S-MASA (Stigmergic Multi-Ant Search Area) algorithm to (i) speed up the search process and (ii) allow agents to build an optimal Artificial Potential Field (APF) simultaneously while exploring. To benefit from multiple robots, we add one cooperation rule in the algorithm to attract large number of agents to the found food. This algorithm constitutes a distributed and synchronous version of the c-marking algorithm. Simulation results in comparison with the c-marking one show the superiority of C-CMFA in different environment configurations.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-345205" status="VALID">
          <idno type="IdRef">129773069</idno>
          <idno type="ROR">https://ror.org/00xe6p546</idno>
          <orgName>جامعة 8 مايو 45، قالمة [الجزائر] = Université du 8 mai 1945 Guelma [Algérie] = University 8 mai 1945 Guelma [Algeria]</orgName>
          <date type="start">2001-09-30</date>
          <desc>
            <address>
              <country key="DZ"/>
            </address>
            <ref type="url">https://www.univ-guelma.dz/ar</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-104738" status="OLD">
          <idno type="RNSR">200918461G</idno>
          <orgName>Laboratoire d'Informatique Avancée de Saint-Denis</orgName>
          <orgName type="acronym">LIASD</orgName>
          <date type="start">2009-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris 8 Vincennes-Saint-Denis - 2 rue de la Liberté - 93526 Saint-Denis cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ai.univ-paris8.fr</ref>
          </desc>
          <listRelation>
            <relation name="EA4383" active="#struct-11141" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-106539" status="VALID">
          <orgName>Dipartimento di Elettronica Informatica e Sistemistica [Rende]</orgName>
          <orgName type="acronym">DEIS</orgName>
          <desc>
            <address>
              <addrLine>Via P. Bucci, 41C Edificio Cubi 41C e 42 C Arcavacata di Rende (CS)</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.unical.it/portale/strutture/dipartimenti/deis/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-103704" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-11141" status="VALID">
          <idno type="IdRef">026403552</idno>
          <idno type="ISNI">0000000121083026</idno>
          <idno type="ROR">https://ror.org/04wez5e68</idno>
          <orgName>Université Paris 8</orgName>
          <orgName type="acronym">UP8</orgName>
          <date type="start">1971-01-01</date>
          <desc>
            <address>
              <addrLine>2 rue de la Liberté - 93526 Saint-Denis cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris8.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-103704" status="VALID">
          <idno type="IdRef">028882695</idno>
          <idno type="ISNI">0000000122897750</idno>
          <idno type="ROR">https://ror.org/02rc97e94</idno>
          <idno type="Wikidata">Q1752540</idno>
          <orgName>Università della Calabria [Arcavacata di Rende, Italia] = University of Calabria [Italy] = Université de Calabre [Italie]</orgName>
          <orgName type="acronym">UniCal</orgName>
          <desc>
            <address>
              <addrLine>Campus di Arcavacata via Pietro Bucci 87036 Arcavacata di Rende (CS)</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.unical.it/portale/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>