Graph exploration by energy-sharing mobile agents
From MaRDI portal
Publication:2117723
DOI10.1007/978-3-030-79527-6_11OpenAlexW3176029780MaRDI QIDQ2117723
Ryan Killick, Denis Pankratov, Stefan Dobrev, Danny Krizanc, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Jurek Czyzowicz, Sunil M. Shende
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2102.13062
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in the plane
- The theory of search games and rendezvous.
- Energy-efficient fast delivery by mobile agents
- Broadcast with energy-exchanging mobile agents distributed on a tree
- Parallel searching in the plane
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Fast collaborative graph exploration
- On the linear search problem
- Communication Problems for Mobile Agents Exchanging Energy
- Collective tree exploration
- How to learn an unknown environment. I
- Exploring an unknown graph
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Data Delivery by Energy-Constrained Mobile Agents on a Line
- Why Robots Need Maps
- Exploring unknown environments with obstacles
This page was built for publication: Graph exploration by energy-sharing mobile agents
