<?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-02413273</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-24T06:09:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Asynchronous approach in the plane: a deterministic polynomial algorithm</title>
            <author role="aut">
              <persName>
                <forename type="first">Sébastien</forename>
                <surname>Bouchard</surname>
              </persName>
              <email type="md5">0e22076dcb9eea561a395a1cf47b8f07</email>
              <email type="domain">labri.fr</email>
              <idno type="idhal" notation="string">sebastien-bouchard</idno>
              <idno type="idhal" notation="numeric">15251</idno>
              <idno type="halauthorid" notation="string">30189-15251</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6464-9517</idno>
              <affiliation ref="#struct-541722"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marjorie</forename>
                <surname>Bournat</surname>
              </persName>
              <idno type="halauthorid">964739-0</idno>
              <affiliation ref="#struct-541722"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yoann</forename>
                <surname>Dieudonné</surname>
              </persName>
              <email type="md5">6486247dcd6df122d334c605b2ac2ce9</email>
              <email type="domain">u-picardie.fr</email>
              <idno type="idhal" notation="string">yoann-dieudonne</idno>
              <idno type="idhal" notation="numeric">746307</idno>
              <idno type="halauthorid" notation="string">2532631-746307</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9593-7802</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/HQN-3718-2023</idno>
              <affiliation ref="#struct-59714"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Swan</forename>
                <surname>Dubois</surname>
              </persName>
              <email type="md5">080564306f1e67b0f78ba2d55a491fab</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">859941</idno>
              <idno type="halauthorid" notation="string">390617-859941</idno>
              <idno type="IDREF">https://www.idref.fr/160545293</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2320-6178</idno>
              <idno type="VIAF">https://viaf.org/viaf/286482955</idno>
              <idno type="ISNI">http://isni.org/isni/0000000432789050</idno>
              <affiliation ref="#struct-541722"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Franck</forename>
                <surname>Petit</surname>
              </persName>
              <email type="md5">1d14f27b4572aea9252c5063193b63e8</email>
              <email type="domain">univ-avignon.fr</email>
              <idno type="idhal" notation="numeric">778299</idno>
              <idno type="halauthorid" notation="string">2099-778299</idno>
              <idno type="IDREF">https://www.idref.fr/050783238</idno>
              <orgName ref="#struct-195507"/>
              <affiliation ref="#struct-541722"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Swan</forename>
                <surname>Dubois</surname>
              </persName>
              <email type="md5">080564306f1e67b0f78ba2d55a491fab</email>
              <email type="domain">lip6.fr</email>
            </editor>
            <funder ref="#projanr-42111"/>
            <funder>This work was performed within Project ESTATE (Ref.  ANR-16-CE25-0009-03) and Project TOREDY. The first project is supported by French state funds managed by the ANR (Agence Nationalede la Recherche), while the second project is supported by the European Regional Development Fund (ERDF) and the Hauts-de-France region.</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-12-16 10:41:43</date>
              <date type="whenModified">2025-07-22 08:34:02</date>
              <date type="whenReleased">2019-12-16 10:41:43</date>
              <date type="whenProduced">2019-08</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1612.02168"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="137423">
                <persName>
                  <forename>Swan</forename>
                  <surname>Dubois</surname>
                </persName>
                <email type="md5">080564306f1e67b0f78ba2d55a491fab</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02413273</idno>
            <idno type="halUri">https://inria.hal.science/hal-02413273</idno>
            <idno type="halBibtex">bouchard:hal-02413273</idno>
            <idno type="halRefHtml">&lt;i&gt;Distributed Computing&lt;/i&gt;, 2019, 32 (4), pp.317-337. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00446-018-0338-2"&gt;&amp;#x27E8;10.1007/s00446-018-0338-2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Distributed Computing, 2019, 32 (4), pp.317-337. &amp;#x27E8;10.1007/s00446-018-0338-2&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <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="UNIV-PICARDIE">Université de Picardie Jules Verne</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</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="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="U-PICARDIE">Université de Picardie Jules Verne</idno>
            <idno type="stamp" n="MIS" corresp="U-PICARDIE">Modélisation, Information et Systèmes - UR UPJV 4290</idno>
            <idno type="stamp" n="UPJV-MIS-SDMA">Equipe Systèmes Distribués, Mots et Applications du laboratoire Modélisation, Information &amp; Systèmes (Université de Picardie Jules Verne) </idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
            <idno type="stamp" n="UPJV-MIS-ALCO">Algorithmique et Complexité</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Asynchronous approach in the plane: a deterministic polynomial algorithm</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sébastien</forename>
                    <surname>Bouchard</surname>
                  </persName>
                  <email type="md5">0e22076dcb9eea561a395a1cf47b8f07</email>
                  <email type="domain">labri.fr</email>
                  <idno type="idhal" notation="string">sebastien-bouchard</idno>
                  <idno type="idhal" notation="numeric">15251</idno>
                  <idno type="halauthorid" notation="string">30189-15251</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6464-9517</idno>
                  <affiliation ref="#struct-541722"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marjorie</forename>
                    <surname>Bournat</surname>
                  </persName>
                  <idno type="halauthorid">964739-0</idno>
                  <affiliation ref="#struct-541722"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yoann</forename>
                    <surname>Dieudonné</surname>
                  </persName>
                  <email type="md5">6486247dcd6df122d334c605b2ac2ce9</email>
                  <email type="domain">u-picardie.fr</email>
                  <idno type="idhal" notation="string">yoann-dieudonne</idno>
                  <idno type="idhal" notation="numeric">746307</idno>
                  <idno type="halauthorid" notation="string">2532631-746307</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9593-7802</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/HQN-3718-2023</idno>
                  <affiliation ref="#struct-59714"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Swan</forename>
                    <surname>Dubois</surname>
                  </persName>
                  <email type="md5">080564306f1e67b0f78ba2d55a491fab</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">859941</idno>
                  <idno type="halauthorid" notation="string">390617-859941</idno>
                  <idno type="IDREF">https://www.idref.fr/160545293</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2320-6178</idno>
                  <idno type="VIAF">https://viaf.org/viaf/286482955</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000432789050</idno>
                  <affiliation ref="#struct-541722"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Franck</forename>
                    <surname>Petit</surname>
                  </persName>
                  <email type="md5">1d14f27b4572aea9252c5063193b63e8</email>
                  <email type="domain">univ-avignon.fr</email>
                  <idno type="idhal" notation="numeric">778299</idno>
                  <idno type="halauthorid" notation="string">2099-778299</idno>
                  <idno type="IDREF">https://www.idref.fr/050783238</idno>
                  <orgName ref="#struct-195507"/>
                  <affiliation ref="#struct-541722"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12635</idno>
                <idno type="issn">0178-2770</idno>
                <idno type="eissn">1432-0452</idno>
                <title level="j">Distributed Computing</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">32</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">317-337</biblScope>
                  <date type="datePub">2019-08</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1612.02168</idno>
              <idno type="doi">10.1007/s00446-018-0338-2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Asynchronous  rendezvous</term>
                <term xml:lang="en">Plane</term>
                <term xml:lang="en">Infinite  grid</term>
                <term xml:lang="en">Deterministic  algorithm</term>
                <term xml:lang="en">Polynomial cost</term>
                <term xml:lang="en">Mobile  agents</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other’s range of vision. The agents execute the same deterministic algorithm and are assumed to have a compass showing the cardinal directions as well as a unit measure. On the other hand, they do not share any global coordinates system (like GPS), cannot communicate and have distinct labels. Each agent knows its label but does not know the label of the other agent or the initial position of the other agent relative to its own. The route of an agent is a sequence of segments that are subsequently traversed in order to achieve approach. For each agent, the computation of its route depends only on its algorithm and its label. An adversary chooses the initial positions of both agents in the plane and controls the way each of them moves along every segment of the routes, in particular by arbitrarily varying the speeds of the agents. Roughly speaking, the goal of the adversary is to prevent the agents from solving the task, or at least to ensure that the agents have covered as much distance as possible before seeing each other. A deterministic approach algorithm is a deterministic algorithm that always allows two agents with any distinct labels to solve the task of approach regardless of the choices and the behavior of the adversary. The cost of a complete execution of an approach algorithm is the length of both parts of route travelled by the agents until approach is completed. Let Δ and l be the initial distance separating the agents and the length of (the binary representation of) the shortest label, respectively. Assuming thatΔandlare unknown to both agents, does there exist a deterministic approach algorithm always working at a cost that is polynomial inΔandl? Actually the problem of approach in the plane reduces to the network problem of rendezvous in an infinite oriented grid, which consists in ensuring that both agents end up meeting at the same time at a node or on an edge of the grid. By designing such a rendezvous algorithm with appropriate properties, as we do in this paper, we provide a positive answer to the above question. Our result turns out to be an important step forward from a computational point of view, as the other algorithms allowing to solve the same problem either have an exponential cost in the initial separating distance and in the labels of the agents, or require each agent to know its starting position in a global system of coordinates, or only work under a much less powerful adversary.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541722" status="OLD">
          <idno type="RNSR">201822643N</idno>
          <orgName>DistributEd aLgorithms and sYStems</orgName>
          <orgName type="acronym">DELYS</orgName>
          <date type="start">2018-01-01</date>
          <date type="end">2022-12-31</date>
          <desc>
            <address>
              <addrLine>2 rue Simone Iff -CS 42112 -75589 Paris Cedex 12</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/equipes/delys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-454310" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-59714" status="VALID">
          <idno type="IdRef">197029876</idno>
          <idno type="RNSR">200815526W</idno>
          <idno type="ROR">https://ror.org/05w9qrp28</idno>
          <orgName>Modélisation, Information et Systèmes - UR UPJV 4290</orgName>
          <orgName type="acronym">MIS</orgName>
          <date type="start">2008-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - 80039 AMIENS CEDEX 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mis.u-picardie.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR4290" active="#struct-300258" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</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>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</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-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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="institution" xml:id="struct-300258" status="VALID">
          <idno type="IdRef">026403714</idno>
          <idno type="ISNI">0000 0001 0789 1385</idno>
          <idno type="ROR">https://ror.org/01gyxrk03</idno>
          <orgName>Université de Picardie Jules Verne</orgName>
          <orgName type="acronym">UPJV</orgName>
          <desc>
            <address>
              <addrLine>Chemin du Thil - 80000 Amiens</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.u-picardie.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-42111" status="VALID">
          <idno type="anr">ANR-16-CE25-0009</idno>
          <orgName>ESTATE</orgName>
          <desc>Auto-stabilisation et amélioration de la sûreté dans les environnements distribués évoluant dans le temps</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>