scientific article; zbMATH DE number 1559557
From MaRDI portal
Publication:4527009
Recommendations
Cited in
(24)- Convergecast and broadcast by power-aware mobile agents
- Exploring unknown environments with obstacles
- Efficient communication in unknown networks
- Dynamic graph-based search in unknown environments
- Searching with mobile agents in networks with liars.
- Operations research in the space industry
- Dispersion of mobile robots on directed anonymous graphs
- Optimal graph exploration without good maps
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- scientific article; zbMATH DE number 1947407 (Why is no real title available?)
- Exploring Endless Space
- Exploring a Planet, Revisited
- Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic
- Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
- Exploring Unknown Environments
- Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach
- Why Robots Need Maps
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Deterministic broadcasting time with partial knowledge of the network.
- On the Power of Local Orientations
- On a simple depth-first search strategy for exploring unknown graphs
- Impact of topographic information on graph exploration efficiency
- Exploring an unknown graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527009)
