Exploring Unknown Environments
From MaRDI portal
Recommendations
Cited in
(89)- Approximate sequencing for variable length tasks.
- Evacuating two robots from multiple unknown exits in a circle
- Piecemeal graph exploration by a mobile robot.
- Online graph exploration: New results on old and new algorithms
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Gossiping by energy-constrained mobile agents in tree networks
- Search on a line with faulty robots
- Weighted group search on a line \& implications to the priority evacuation problem
- Exploring sparse graphs with advice
- Graph exploration by energy-sharing mobile agents
- Exploring a dynamic ring without landmark
- Distributed exploration of dynamic rings
- Priority evacuation from a disk: the case of \(n \geq 4\)
- A tight lower bound for semi-synchronous collaborative grid exploration
- Building a nest by an automaton
- Exploration of dynamic networks: tight bounds on the number of agents
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Beachcombing on strips and islands
- Group search of the plane with faulty robots
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Collision-free network exploration
- The ANTS problem
- Searching without communicating: tradeoffs between performance and selection complexity
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Predicting the labels of an unknown graph via adaptive exploration
- Map construction of unknown graphs by multiple agents
- Broadcast in the rendezvous model
- Using a collective of agents for exploration of undirected graphs
- Graph exploration by a finite automaton
- Online graph exploration on trees, unicyclic graphs and cactus graphs
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Optimal constrained graph exploration
- Communication problems for mobile agents exchanging energy
- Efficient grid exploration with a stationary token
- Optimal constrained graph exploration
- Exploration of Faulty Hamiltonian Graphs
- Online Graph Exploration: New Results on Old and New Algorithms
- Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
- More efficient periodic traversal in anonymous undirected graphs
- Lower and upper competitive bounds for online directed graph exploration
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach
- Learning unknown graphs
- scientific article; zbMATH DE number 1303571 (Why is no real title available?)
- Drawing maps with advice
- Deterministic network exploration by a single agent with Byzantine tokens
- scientific article; zbMATH DE number 1947407 (Why is no real title available?)
- scientific article; zbMATH DE number 1559557 (Why is no real title available?)
- Energy-Optimal Broadcast in a Tree with Mobile Agents
- Building a nest by an automaton
- A tight lower bound for semi-synchronous collaborative grid exploration
- Exploring a Planet, Revisited
- On a simple depth-first search strategy for exploring unknown graphs
- Exploration of Time-Varying Connected Graphs with Silent Agents
- Memory Efficient Anonymous Graph Exploration
- A general lower bound for collaborative tree exploration
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Efficient live exploration of a dynamic ring with mobile robots
- Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
- Search on a Line by Byzantine Robots
- Exploring Endless Space
- Algorithms for \(p\)-Faulty Search on a half-line
- Exploring a Dynamic Ring Without Landmark
- Tight bounds for deterministic high-dimensional grid exploration
- Graph exploration by a deterministic memoryless automaton with pebbles
- Learning to act and observe in partially observable domains
- Exploration of convex terrains by a deterministic automaton with pebbles
- Graph exploration: the impact of a distance constraint
- Exploration of graphs with excluded minors
- Exploring wedges of an oriented grid by an automaton with pebbles
- Optimal graph exploration without good maps
- Collaborative exploration of trees by energy-constrained mobile robots
- Performance bounds for planning in unknown terrain
- An improved lower bound for competitive graph exploration
- Fault-tolerant sequential scan
- The beachcombers' problem: walking and searching with mobile robots
- How many ants does it take to find the food?
- Exploring an unknown dangerous graph with a constant number of tokens
- Fast periodic graph exploration with constant memory
- Setting port numbers for fast graph exploration
- Impact of memory size on graph exploration capability
- Tree exploration with advice
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Anonymous graph exploration without collision by mobile robots
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles
This page was built for publication: Exploring Unknown Environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943862)
