Efficient grid exploration with a stationary token

DOI10.1142/S0129054114500129MaRDI QIDQ2929616zbMATH OpenOpenAlexFDO

Authors Andrzej Pelc, Anas Tiane

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

gridalgorithmmobile agentexplorationstationary token

Mathematics Subject Classification ID

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

Recommendations

• Deterministic network exploration by a single agent with Byzantine tokens
• Edge exploration of a graph by mobile agent
• The simple grid polygon exploration problem
• Edge exploration of anonymous graph by mobile agent with external help
• Computing and Combinatorics

Cites work

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

Cited in

(3)

• Edge exploration of anonymous graph by mobile agent with external help
• Deterministic network exploration by a single agent with Byzantine tokens
• Exploration of Faulty Hamiltonian Graphs

This page was built for publication: Efficient grid exploration with a stationary token

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929616)