License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2023.8
URN: urn:nbn:de:0030-drops-191343
URL: https://drops.dagstuhl.de/opus/volltexte/2023/19134/
Go to the corresponding LIPIcs Volume Portal


Bampas, Evangelos ; Beauquier, Joffroy ; Burman, Janna ; Guy--Obé, William

Treasure Hunt with Volatile Pheromones

pdf-format:
LIPIcs-DISC-2023-8.pdf (1.0 MB)


Abstract

In the treasure hunt problem, a team of mobile agents need to locate a single treasure that is hidden in their environment. We consider the problem in the discrete setting of an oriented infinite rectangular grid, where agents are modeled as synchronous identical deterministic time-limited finite-state automata, originating at a rate of one agent per round from the origin. Agents perish τ rounds after their creation, where τ ≥ 1 is a parameter of the model. An algorithm solves the treasure hunt problem if every grid position at distance τ or less from the origin is visited by at least one agent. Agents may communicate only by leaving indistinguishable traces (pheromone) on the nodes of the grid, which can be sensed by agents in adjacent nodes and thus modify their behavior. The novelty of our approach is that, in contrast to existing literature that uses permanent pheromone markers, we assume that pheromone traces evaporate over μ rounds from the moment they were placed on a node, where μ ≥ 1 is another parameter of the model. We look for uniform algorithms that solve the problem without knowledge of the parameter values, and we investigate the implications of this very weak communication mechanism to the treasure hunt problem. We show that, if pheromone persists for at least two rounds (μ ≥ 2), then there exists a treasure hunt algorithm for all values of agent lifetime. We also develop a more sophisticated algorithm that works for all values of μ, hence also for the fastest possible pheromone evaporation of μ = 1, but only if agent lifetime is at least 16.

BibTeX - Entry

@InProceedings{bampas_et_al:LIPIcs.DISC.2023.8,
  author =	{Bampas, Evangelos and Beauquier, Joffroy and Burman, Janna and Guy--Ob\'{e}, William},
  title =	{{Treasure Hunt with Volatile Pheromones}},
  booktitle =	{37th International Symposium on Distributed Computing (DISC 2023)},
  pages =	{8:1--8:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-301-0},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{281},
  editor =	{Oshman, Rotem},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19134},
  URN =		{urn:nbn:de:0030-drops-191343},
  doi =		{10.4230/LIPIcs.DISC.2023.8},
  annote =	{Keywords: Mobile Agents, Exploration, Search, Treasure Hunt, Pheromone, Evaporation}
}

Keywords: Mobile Agents, Exploration, Search, Treasure Hunt, Pheromone, Evaporation
Collection: 37th International Symposium on Distributed Computing (DISC 2023)
Issue Date: 2023
Date of publication: 05.10.2023


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI