<?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-01285680</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-23T00:55:03+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection</title>
            <author role="aut">
              <persName>
                <forename type="first">Sayaka</forename>
                <surname>Kamei</surname>
              </persName>
              <idno type="halauthorid">554099-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anissa</forename>
                <surname>Lamani</surname>
              </persName>
              <email type="md5">e5787a697b60b550007a3cd3e58043c2</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">anissa-lamani</idno>
              <idno type="idhal" notation="numeric">764231</idno>
              <idno type="halauthorid" notation="string">419549-764231</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7774-8402</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fukuhito</forename>
                <surname>Ooshita</surname>
              </persName>
              <idno type="halauthorid">554100-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sébastien</forename>
                <surname>Tixeuil</surname>
              </persName>
              <email type="md5">46fb30964edb44afa6b5deecf5f673eb</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">tixeuil</idno>
              <idno type="idhal" notation="numeric">9380</idno>
              <idno type="halauthorid" notation="string">5657-9380</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-0948-7172</idno>
              <idno type="IDREF">https://www.idref.fr/121380661</idno>
              <affiliation ref="#struct-389034"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lip6</forename>
                <surname>Publications</surname>
              </persName>
              <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-03-09 16:02:40</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2016-03-09 16:02:40</date>
              <date type="whenProduced">2011-06</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1104.5660"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="196566">
                <persName>
                  <forename>Lip6</forename>
                  <surname>Publications</surname>
                </persName>
                <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01285680</idno>
            <idno type="halUri">https://hal.science/hal-01285680</idno>
            <idno type="halBibtex">kamei:hal-01285680</idno>
            <idno type="halRefHtml">&lt;i&gt;Sirocco 2011&lt;/i&gt;, Jun 2011, Gdansk, Poland. pp.150-161, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-22212-2_14"&gt;&amp;#x27E8;10.1007/978-3-642-22212-2_14&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Sirocco 2011, Jun 2011, Gdansk, Poland. pp.150-161, &amp;#x27E8;10.1007/978-3-642-22212-2_14&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</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">Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sayaka</forename>
                    <surname>Kamei</surname>
                  </persName>
                  <idno type="halauthorid">554099-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anissa</forename>
                    <surname>Lamani</surname>
                  </persName>
                  <email type="md5">e5787a697b60b550007a3cd3e58043c2</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">anissa-lamani</idno>
                  <idno type="idhal" notation="numeric">764231</idno>
                  <idno type="halauthorid" notation="string">419549-764231</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7774-8402</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fukuhito</forename>
                    <surname>Ooshita</surname>
                  </persName>
                  <idno type="halauthorid">554100-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sébastien</forename>
                    <surname>Tixeuil</surname>
                  </persName>
                  <email type="md5">46fb30964edb44afa6b5deecf5f673eb</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">tixeuil</idno>
                  <idno type="idhal" notation="numeric">9380</idno>
                  <idno type="halauthorid" notation="string">5657-9380</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-0948-7172</idno>
                  <idno type="IDREF">https://www.idref.fr/121380661</idno>
                  <affiliation ref="#struct-389034"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of Sirocco 2011</title>
                <meeting>
                  <title>Sirocco 2011</title>
                  <date type="start">2011-06</date>
                  <settlement>Gdansk</settlement>
                  <country key="PL">Poland</country>
                </meeting>
                <imprint>
                  <publisher>Springer Berlin / Heidelberg</publisher>
                  <biblScope unit="pp">150-161</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-22212-2_14</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate to reach a single vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ring-shaped networks suggest that there exists a tradeoff between the size of the set of potential initial configurations, and the power of the sensing capabilities of the robots (i.e. the larger the initial configuration set, the most powerful the sensor needs to be). We prove that there is no such trade off. We propose a gathering protocol for an odd number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non-atomic CORDA model with asynchronous fair scheduling. Our protocol allows the largest set of initial configurations (with respect to impossibility results) yet uses the weakest multiplicity detector to date. The time complexity of our protocol is $O(n^2)$, where $n$ denotes the size of the ring. Compared to previous work that also uses local weak multiplicity detection, we do not have the constraint that $k &lt; n/2$ (here, we simply have $2 &lt; k &lt; n − 3$).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-389034" status="OLD">
          <orgName>Networks and Performance Analysis</orgName>
          <orgName type="acronym">NPA</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>