Pages that link to "Item:Q2456354"
From MaRDI portal
The following pages link to Map construction of unknown graphs by multiple agents (Q2456354):
Displaying 16 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Exploring an unknown dangerous graph with a constant number of tokens (Q896695) (← links)
- Election and rendezvous with incomparable labels (Q930904) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Search by a metamorphic robotic system in a finite 2D square grid (Q2139088) (← links)
- Exploring a dynamic ring without landmark (Q2166751) (← links)
- Distributed exploration of dynamic rings (Q2174251) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616) (← links)
- Efficient live exploration of a dynamic ring with mobile robots (Q6069843) (← links)
