Pages that link to "Item:Q3841650"
From MaRDI portal
The following pages link to How to learn an unknown environment. I (Q3841650):
Displayed 43 items.
- An alternative proof for the equivalence of searcher and 2-searcher (Q284588) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Operations research in the space industry (Q439363) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Optimal graph exploration without good maps (Q703557) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Tree exploration with advice (Q958304) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Efficient exploration of unknown indoor environments using a team of mobile robots (Q1022458) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- The simple grid polygon exploration problem (Q2025057) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Fibonacci helps to evacuate from a convex region in a grid network (Q2410092) (← links)
- Broadcast in the rendezvous model (Q2495650) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
- An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- LEAVING AN UNKNOWN MAZE USING AN ERROR-PRONE COMPASS (Q3575387) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- Online Strategies for Evacuating from a Convex Region in the Plane (Q4632211) (← links)
- Walking streets faster (Q5054825) (← links)
- Moving an angle around a region (Q5054844) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Going home through an unknown street (Q5057428) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)