2 papers
cs.DS2023
Zero-Memory Graph Exploration with Unknown Inports
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger +1
We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The go…
cs.CC2016
Online Exploration of Rectangular Grids
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki +1
In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visit…