Graph exploration by a deterministic memoryless automaton with pebbles
From MaRDI portal
Publication:6585255
DOI10.1016/j.dam.2024.05.024zbMATH Open1545.68097MaRDI QIDQ6585255
Andrzej Pelc, Debasish Pattanayak
Publication date: 9 August 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How many ants does it take to find the food?
- Automaten in planaren Graphen
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- A distributed ant algorithm for efficiently patrolling a network
- Time and space optimality of rotor-router graph exploration
- Graph exploration by a finite automaton
- Optimal constrained graph exploration
- Automata and Labyrinths
- Exploring an Infinite Space with Finite Memory Scouts
- Exploring an unknown graph
- Tree exploration with little memory
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- A tight lower bound for semi-synchronous collaborative grid exploration
- Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
- STACS 2004
This page was built for publication: Graph exploration by a deterministic memoryless automaton with pebbles
