<?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-01298808</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-20T03:14:35+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Byzantine-Resilient Convergence in Oblivious Robot Networks</title>
            <author role="aut">
              <persName>
                <forename type="first">Zohir</forename>
                <surname>Bouzid</surname>
              </persName>
              <idno type="halauthorid">395075-0</idno>
              <affiliation ref="#struct-389034"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Maria</forename>
                <surname>Gradinariu Potop-Butucaru</surname>
              </persName>
              <email type="md5">574e9e606d52567225fb1793a5155253</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">841868</idno>
              <idno type="halauthorid" notation="string">222405-841868</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6488-8326</idno>
              <idno type="IDREF">https://www.idref.fr/157868869</idno>
              <idno type="VIAF">https://viaf.org/viaf/313539623</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/FRU-0557-2022</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/FRU-0557-2022</idno>
              <affiliation ref="#struct-2436"/>
            </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-04-06 16:22:12</date>
              <date type="whenModified">2025-02-26 15:24:03</date>
              <date type="whenReleased">2016-04-06 16:22:12</date>
              <date type="whenProduced">2009-01</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/HCB-BS3F4BFK-7/fulltext.pdf?sid=hal"/>
            </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-01298808</idno>
            <idno type="halUri">https://hal.science/hal-01298808</idno>
            <idno type="halBibtex">bouzid:hal-01298808</idno>
            <idno type="halRefHtml">&lt;i&gt;ICDCN&lt;/i&gt;, Jan 2009, Hyderabad, India. pp.275-280, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-540-92295-7_33"&gt;&amp;#x27E8;10.1007/978-3-540-92295-7_33&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ICDCN, Jan 2009, Hyderabad, India. pp.275-280, &amp;#x27E8;10.1007/978-3-540-92295-7_33&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="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</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="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">Byzantine-Resilient Convergence in Oblivious Robot Networks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Zohir</forename>
                    <surname>Bouzid</surname>
                  </persName>
                  <idno type="halauthorid">395075-0</idno>
                  <affiliation ref="#struct-389034"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Maria</forename>
                    <surname>Gradinariu Potop-Butucaru</surname>
                  </persName>
                  <email type="md5">574e9e606d52567225fb1793a5155253</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">841868</idno>
                  <idno type="halauthorid" notation="string">222405-841868</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6488-8326</idno>
                  <idno type="IDREF">https://www.idref.fr/157868869</idno>
                  <idno type="VIAF">https://viaf.org/viaf/313539623</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/FRU-0557-2022</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/FRU-0557-2022</idno>
                  <affiliation ref="#struct-2436"/>
                </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">ICDCN</title>
                <meeting>
                  <title>ICDCN</title>
                  <date type="start">2009-01</date>
                  <settlement>Hyderabad</settlement>
                  <country key="IN">India</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">5408</biblScope>
                  <biblScope unit="pp">275-280</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-540-92295-7_33</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>Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown beforehand, location. Robots are oblivious— they do not recall the past computations — and are allowed to move in a one-dimensional space. Additionally, robots cannot communicate directly, instead they obtain system related information only via visual sensors. We prove ([4]) necessary and sufficient conditions for the convergence of mobile robots despite a subset of them being Byzantine (i.e. they can exhibit arbitrary behavior). Additionally, we propose a deterministic convergence algorithm for robot networks and analyze its correctness and complexity in various synchrony settings. The proposed algorithm tolerates f Byzantine robots for (2f + 1)-sized robot networks in fully synchronous networks, (3f + 1)-sized in semi-synchronous networks and (4f + 1)-sized in asynchronous networks. The bounds obtained for the ATOM model are optimal for the class of cautious algorithms, which guarantee that correct robots always move inside the range of positions of the correct robots.</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="researchteam" xml:id="struct-2436" status="OLD">
          <idno type="RNSR">200518313N</idno>
          <orgName>Large-Scale Distributed Systems and Applications</orgName>
          <orgName type="acronym">Regal</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/teams/regal</ref>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" 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>
        <org type="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>