Graph exploration by energy-sharing mobile agents
From MaRDI portal
Publication:2117723
DOI10.1007/978-3-030-79527-6_11OpenAlexW3176029780MaRDI QIDQ2117723FDOQ2117723
Authors: Stefan Dobrev, Ryan Killick, Evangelos Kranakis, D. Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Jurek Czyzowicz, Sunil 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)
Cites Work
- Searching in the plane
- The theory of search games and rendezvous.
- Collective tree exploration
- Exploring an unknown graph
- How to learn an unknown environment. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploring Unknown Environments
- Why Robots Need Maps
- Exploring unknown environments with obstacles
- On the linear search problem
- Title not available (Why is that?)
- Parallel searching in the plane
- Exploring Unknown Undirected Graphs
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Fast collaborative graph exploration
- Communication problems for mobile agents exchanging energy
- Energy-efficient fast delivery by mobile agents
- Broadcast with energy-exchanging mobile agents distributed on a tree
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Data delivery by energy-constrained mobile agents on a line
Cited In (3)
This page was built for publication: Graph exploration by energy-sharing mobile agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117723)
