<?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-01523302</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-04-25T08:57:27+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Maximal exploration of trees with energy-constrained agents</title>
            <title xml:lang="fr">Comment explorer un arbre inconnu avec des agents à énergie limitée ?</title>
            <author role="aut">
              <persName>
                <forename type="first">Evangelos</forename>
                <surname>Bampas</surname>
              </persName>
              <email type="md5">b92f72b67885ac694ecfcc955596cfcd</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">evangelos-bampas</idno>
              <idno type="idhal" notation="numeric">744162</idno>
              <idno type="halauthorid" notation="string">9055-744162</idno>
              <idno type="ARXIV">https://arxiv.org/a/bampas_e_1</idno>
              <idno type="GOOGLE SCHOLAR">http://scholar.google.com/citations?user=kdGbgIQAAAAJ</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1496-9299</idno>
              <idno type="IDREF">https://www.idref.fr/250388278</idno>
              <idno type="VIAF">https://viaf.org/viaf/124160789904202682981</idno>
              <affiliation ref="#struct-199394"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jérémie</forename>
                <surname>Chalopin</surname>
              </persName>
              <email type="md5">ab39908d0abbcb72c6fd05c99c8a511d</email>
              <email type="domain">lis-lab.fr</email>
              <idno type="idhal" notation="string">jeremie-chalopin</idno>
              <idno type="idhal" notation="numeric">5020</idno>
              <idno type="halauthorid" notation="string">9647-5020</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2988-8969</idno>
              <idno type="IDREF">https://www.idref.fr/11891216X</idno>
              <affiliation ref="#struct-199394"/>
              <affiliation ref="#struct-530678"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shantanu</forename>
                <surname>Das</surname>
              </persName>
              <email type="md5">cd915537222b39cd3e5a54b008075df2</email>
              <email type="domain">lis-lab.fr</email>
              <idno type="idhal" notation="string">shantanu-ottawau</idno>
              <idno type="idhal" notation="numeric">173436</idno>
              <idno type="halauthorid" notation="string">12586-173436</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4008-2445</idno>
              <affiliation ref="#struct-199394"/>
              <affiliation ref="#struct-530678"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jan</forename>
                <surname>Hackfeld</surname>
              </persName>
              <idno type="halauthorid">1170558-0</idno>
              <affiliation ref="#struct-495006"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christina</forename>
                <surname>Karousatou</surname>
              </persName>
              <email type="md5">f940c306d09481cde85d74aa21ca56e5</email>
              <email type="domain">lif.univ-mrs.fr</email>
              <idno type="idhal" notation="numeric">1008296</idno>
              <idno type="halauthorid" notation="string">1170559-1008296</idno>
              <affiliation ref="#struct-199394"/>
              <affiliation ref="#struct-530678"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Shantanu</forename>
                <surname>DAS</surname>
              </persName>
              <email type="md5">cd915537222b39cd3e5a54b008075df2</email>
              <email type="domain">lis-lab.fr</email>
            </editor>
            <funder ref="#projanr-41430"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-05-16 11:24:46</date>
              <date type="whenWritten">2017-05-02</date>
              <date type="whenModified">2025-05-15 12:09:29</date>
              <date type="whenReleased">2017-05-18 11:49:27</date>
              <date type="whenProduced">2017-05-29</date>
              <date type="whenEndEmbargoed">2017-05-16</date>
              <ref type="file" target="https://hal.science/hal-01523302v1/document">
                <date notBefore="2017-05-16"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01523302v1/file/treesmax.pdf" id="file-1523302-1585395">
                <date notBefore="2017-05-16"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="321030">
                <persName>
                  <forename>Shantanu</forename>
                  <surname>DAS</surname>
                </persName>
                <email type="md5">cd915537222b39cd3e5a54b008075df2</email>
                <email type="domain">lis-lab.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01523302</idno>
            <idno type="halUri">https://hal.science/hal-01523302</idno>
            <idno type="halBibtex">bampas:hal-01523302</idno>
            <idno type="halRefHtml">&lt;i&gt;ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications&lt;/i&gt;, May 2017, Quiberon, France</idno>
            <idno type="halRef">ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1523302-1585395"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="LIF">Laboratoire d'informatique fondamentale de Marseille</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="EC-MARSEILLE">Ecole Centrale de Marseille</idno>
            <idno type="stamp" n="ALGOTEL2017" corresp="ALGOTEL">ALGOTEL 2017 — 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALGOTEL">Rencontre Francophone sur les Aspects Algorithmiques des Télécommunications</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">Maximal exploration of trees with energy-constrained agents</title>
                <title xml:lang="fr">Comment explorer un arbre inconnu avec des agents à énergie limitée ?</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Evangelos</forename>
                    <surname>Bampas</surname>
                  </persName>
                  <email type="md5">b92f72b67885ac694ecfcc955596cfcd</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">evangelos-bampas</idno>
                  <idno type="idhal" notation="numeric">744162</idno>
                  <idno type="halauthorid" notation="string">9055-744162</idno>
                  <idno type="ARXIV">https://arxiv.org/a/bampas_e_1</idno>
                  <idno type="GOOGLE SCHOLAR">http://scholar.google.com/citations?user=kdGbgIQAAAAJ</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1496-9299</idno>
                  <idno type="IDREF">https://www.idref.fr/250388278</idno>
                  <idno type="VIAF">https://viaf.org/viaf/124160789904202682981</idno>
                  <affiliation ref="#struct-199394"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jérémie</forename>
                    <surname>Chalopin</surname>
                  </persName>
                  <email type="md5">ab39908d0abbcb72c6fd05c99c8a511d</email>
                  <email type="domain">lis-lab.fr</email>
                  <idno type="idhal" notation="string">jeremie-chalopin</idno>
                  <idno type="idhal" notation="numeric">5020</idno>
                  <idno type="halauthorid" notation="string">9647-5020</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2988-8969</idno>
                  <idno type="IDREF">https://www.idref.fr/11891216X</idno>
                  <affiliation ref="#struct-199394"/>
                  <affiliation ref="#struct-530678"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shantanu</forename>
                    <surname>Das</surname>
                  </persName>
                  <email type="md5">cd915537222b39cd3e5a54b008075df2</email>
                  <email type="domain">lis-lab.fr</email>
                  <idno type="idhal" notation="string">shantanu-ottawau</idno>
                  <idno type="idhal" notation="numeric">173436</idno>
                  <idno type="halauthorid" notation="string">12586-173436</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4008-2445</idno>
                  <affiliation ref="#struct-199394"/>
                  <affiliation ref="#struct-530678"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jan</forename>
                    <surname>Hackfeld</surname>
                  </persName>
                  <idno type="halauthorid">1170558-0</idno>
                  <affiliation ref="#struct-495006"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christina</forename>
                    <surname>Karousatou</surname>
                  </persName>
                  <email type="md5">f940c306d09481cde85d74aa21ca56e5</email>
                  <email type="domain">lif.univ-mrs.fr</email>
                  <idno type="idhal" notation="numeric">1008296</idno>
                  <idno type="halauthorid" notation="string">1170559-1008296</idno>
                  <affiliation ref="#struct-199394"/>
                  <affiliation ref="#struct-530678"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications</title>
                  <date type="start">2017-05-29</date>
                  <date type="end">2017-06-02</date>
                  <settlement>Quiberon</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">arbre inconnu</term>
                <term xml:lang="fr">exploration</term>
                <term xml:lang="fr">agents mobiles</term>
                <term xml:lang="fr">énergie limitée</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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 wish to explore an unknown tree with a team of k &gt;= 1 initially collocated mobile agents. Each agent has limited energy and cannot,as a result, traverse more than B edges. The goal is to maximize the number of nodes collectively visited by all agents during the execution.Initially, the agents have no knowledge about the structure of the tree,but they gradually discover the topology as they traverse new edges. We assume that the agents can communicate with each other at arbitrary distances, therefore the knowledge obtained by one agent after traversing an edge is instantaneously transmitted to the other agents.We propose an intuitive algorithm based on depth-first search and westudy its performance compared to the optimal solution that we could obtain if we knew in advance the map of the tree. We prove that this algorithm has a constant competitive ratio. We also provide a lower bound on the competitive ratio of any algorithm.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>On souhaite explorer un arbre inconnu avec une équipe de k \geq 1 agents mobiles initialement regroupés sur un sommet. Chaque agent dispose d'une énergie limitée et ne peut pas traverser plus de B arêtes. On souhaite maximiser le nombre de sommets visités par l'équipe d'agents lors de l'exécution. Initialement, les agents n'ont aucune connaissance sur la structure de l'arbre, mais ils en découvrent la topologie au fur et à mesure qu’ils traversent de nouvelles arêtes. Nous supposons que les agents peuvent communiquer entre eux à distance illimitée, donc la connaissance qu'un agent obtient lors de la traversée d'une arête est instantanément transmise aux autres agents. Nous proposons un algorithme très intuitif, basé sur le parcours en profondeur, et nous étudions son efficacité par rapport à la solution optimale qu'on peut obtenir lorsqu'on connaît initialement la carte. Nous prouvons que cet algorithme a un rapport de compétitivité constant. Nous fournissons également une borne inférieure sur le rapport de compétitivité réalisable par un algorithme quelconque.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-199394" status="OLD">
          <idno type="RNSR">201220259Y</idno>
          <orgName>Laboratoire d'informatique Fondamentale de Marseille</orgName>
          <orgName type="acronym">LIF</orgName>
          <date type="start">2012</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Scientifique et Technologique de Luminy 163, avenue de Luminy F-13288 Marseille Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lif.univ-mrs.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR7279" active="#struct-198056" type="direct"/>
            <relation name="UMR7279" active="#struct-300415" type="direct"/>
            <relation name="UMR7279" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-530678" status="VALID">
          <orgName>Algorithmique Distribuée</orgName>
          <orgName type="acronym">DALGO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr/dalgo</ref>
          </desc>
          <listRelation>
            <relation active="#struct-527033" type="direct"/>
            <relation name="UMR7020" active="#struct-198056" type="indirect"/>
            <relation name="UMR7020" active="#struct-303091" type="indirect"/>
            <relation name="UMR7020" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-495006" status="INCOMING">
          <orgName>Institute of Mathematics, TU Berlin</orgName>
          <desc>
            <address>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.math.tu-berlin.de/menue/home/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-86624" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300415" status="VALID">
          <idno type="ISNI">0000 0004 1762 2703</idno>
          <idno type="ROR">https://ror.org/040baw385</idno>
          <orgName>École Centrale de Marseille</orgName>
          <orgName type="acronym">ECM</orgName>
          <date type="start">2006-09-27</date>
          <desc>
            <address>
              <addrLine>Pôle de l'étoile - Technopole de Château-Gombert - 38 rue Frédéric Joliot-Curie - 13013 Marseille</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.centrale-marseille.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-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-86624" status="VALID">
          <idno type="ROR">https://ror.org/03v4gjf40</idno>
          <orgName>Technical University of Berlin / Technische Universität Berlin</orgName>
          <orgName type="acronym">TUB</orgName>
          <date type="start">1946-01-01</date>
          <desc>
            <address>
              <addrLine>Straße des 17. Juni 135 10623 Berlin</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.tu.berlin/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-41430" status="VALID">
          <idno type="anr">ANR-14-CE36-0002</idno>
          <idno type="program">Appel à projets générique</idno>
          <orgName>ANCOR</orgName>
          <desc>Algorithm Design for Microrobots with Energy Constraints</desc>
          <date type="start">2014</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>