Collision-free exploration by mobile agents using pebbles

DOI10.1016/J.IC.2025.105380MaRDI QIDQ6884284zbMATH OpenFDO

Authors Sajal K. Das, A. K. Dhar, Barun Gorain, Madhuri Mahawar

Publication date 15 December 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105380

zbMATH Keywords

anonymous graphdeterministic algorithmgraph explorationmobile agent

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites work

• Collective tree exploration
• Collision-free network exploration
• Edge exploration of anonymous graph by mobile agent with external help
• Exploring an unknown graph
• Exploring Unknown Undirected Graphs
• Fast collaborative graph exploration
• Graph exploration by energy-sharing mobile agents
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 3722098 (Why is no real title available?)
• Navigating in Unfamiliar Geometric Terrain
• Online Navigation in a Room
• Optimal constrained graph exploration
• Pebble guided optimal treasure hunt in anonymous graphs
• The power of a pebble: Exploring and mapping directed graphs
• Tight bounds for undirected graph exploration with pebbles and multiple agents
• Time vs. information tradeoffs for leader election in anonymous trees
• Treasure hunt in graph using pebbles
• Tree exploration with little memory
• Undirected connectivity in log-space
• Universal traversal sequences with backtracking.

This page was built for publication: Collision-free exploration by mobile agents using pebbles

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