Graph exploration by energy-sharing mobile agents
From MaRDI portal
Publication:2117723
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 1003229 (Why is no real title available?)
- scientific article; zbMATH DE number 2102754 (Why is no real title available?)
- Broadcast with energy-exchanging mobile agents distributed on a tree
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Collective tree exploration
- Communication problems for mobile agents exchanging energy
- Data delivery by energy-constrained mobile agents on a line
- Energy-efficient fast delivery by mobile agents
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Exploring Unknown Environments
- Exploring Unknown Undirected Graphs
- Exploring an unknown graph
- Exploring unknown environments with obstacles
- Fast collaborative graph exploration
- How to learn an unknown environment. I
- On the linear search problem
- Parallel searching in the plane
- Searching in the plane
- The theory of search games and rendezvous.
- Why Robots Need Maps
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)