Lune

SODA2020Top-tier venue

Navigating an Infinite Space with Unreliable Movements

Anders Martinsson, Jara Uitto

Abstract

We consider a search problem on a 2-dimensional infinite grid with a single mobile agent. The goal of the agent is to find her way home, which is located in a grid cell chosen by an adversary. Initially, the agent is provided with an infinite sequence of instructions, that dictate the movements performed by the agent. Each instruction corresponds to a movement to an adjacent grid cell and the set of instructions can be a function of the initial locations of the agent and home. The challenge of our problem stems from faults in the movements made by the agent. In every step, with some constant probability 0 p 1, the agent performs a random movement instead of following the current instruction.

This paper provides two results on this problem. First, we show that for some values of p, there does not exist any set of instructions that guide the agent home in finite expected time. Second, we complement this impossibility result with an algorithm that, for sufficiently small values of p, yields a finite expected hitting time for home. In particular, we show that for any p < 1, our approach gives a hitting rate that decays polynomially as a function of time. In that sense, our approach is far superior to a standard random walk in terms of hitting time. The main contribution and take-home message of this paper is to show that, for some value of 0.01139 • • • < p < 0.6554 . . ., there exists a phase transition on the solvability of the problem.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. Competitive Strategies for Symmetric Rendezvous on the LineMax Klimm, Guillaume Sagnol, Martin Skutella, Khai Van TranSODA 2022 · 1 citation
  2. Online Search with Maximum ClearanceSpyros Angelopoulos, Malachi VossAAAI 2021 · 2 citations
  3. Navigating to the Best Policy in Markov Decision ProcessesAymen Al Marjani, Aurélien Garivier, Alexandre ProutièreNeurIPS 2021 · 34 citations
  4. MeshA*: Efficient Path Planning with Motion PrimitivesMarat Agranovskiy, Konstantin YakovlevAAAI 2026
  5. Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic RegionsDaniel Platnick, Dawson Tomasz, Eamon Earl, Sourena Khanzadeh et al.AAAI 2026
Dusk over the sea between two cliffs drawn in fine vertical lines