Exploring Wedges of an Oriented Grid by an Automaton with Pebbles

01/31/2023
by   Subhash Bhagat, et al.
0

A mobile agent, modeled as a deterministic finite automaton, navigates in the infinite anonymous oriented grid ℤ×ℤ. It has to explore a given infinite subgraph of the grid by visiting all of its nodes. We focus on the simplest subgraphs, called wedges, spanned by all nodes of the grid located between two half-lines in the plane, with a common origin. Many wedges turn out to be impossible to explore by an automaton that cannot mark nodes of the grid. Hence, we study the following question: Given a wedge W, what is the smallest number p of (movable) pebbles for which there exists an automaton that can explore W using p pebbles? Our main contribution is a complete solution of this problem. For each wedge W we determine this minimum number p, show an automaton that explores it using p pebbles and show that fewer pebbles are not enough. We show that this smallest number of pebbles can vary from 0 to 3, depending on the angle between half-lines limiting the wedge and depending on whether the automaton can cross these half-lines or not.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2020

Catching a Polygonal Fish with a Minimum Net

Given a polygon P in the plane that can be translated, rotated and enlar...
research
04/24/2019

Building a Nest by an Automaton

A robot modeled as a deterministic finite automaton has to build a struc...
research
07/12/2019

Navigating an Infinite Space with Unreliable Movements

We consider a search problem on a 2-dimensional infinite grid with a sin...
research
12/26/2017

Folding Polyominoes into (Poly)Cubes

We study the problem of folding a polyomino P into a polycube Q, allowin...
research
04/04/2019

Sharing a pizza: bisecting masses with two cuts

Assume you have a pizza consisting of four ingredients (e.g., bread, tom...
research
12/13/2021

Gathering over Meeting Nodes in Infinite Grid

The gathering over meeting nodes problem asks the robots to gather at on...
research
08/21/2017

Helly Numbers of Polyominoes

We define the Helly number of a polyomino P as the smallest number h suc...

Please sign up or login with your details

Forgot password? Click here to reset