EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN

DOI10.1142/S0129054114500129zbMath1360.68651OpenAlexW2105159972MaRDI QIDQ2929616

Anas Tiane, Andrzej Pelc

Publication date: 14 November 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114500129

zbMATH Keywords

algorithmgridmobile agentexplorationstationary token

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Related Items (1)

Exploration of Faulty Hamiltonian Graphs

Cites Work

• Deterministic network exploration by a single agent with Byzantine tokens
• Optimal graph exploration without good maps
• Remembering without memory: tree exploration by asynchronous oblivious robots
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• Optimal distributed algorithms in unlabeled tori and chordal rings
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Graph decomposition for memoryless periodic exploration
• Map construction of unknown graphs by multiple agents
• Collective tree exploration
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
• Exploring an unknown graph
• Tree exploration with little memory
• Exploring Unknown Undirected Graphs
• Exploring Unknown Environments
• Searching for a Black Hole in Synchronous Tree Networks

This page was built for publication: EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN