Pages that link to "Item:Q4337436"
From MaRDI portal
The following pages link to Navigating in Unfamiliar Geometric Terrain (Q4337436):
Displaying 30 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimal graph exploration without good maps (Q703557) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Tree exploration with advice (Q958304) (← links)
- Walking an unknown street with bounded detour (Q1194307) (← links)
- How to find a point on a line within a fixed distance (Q1289022) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT (Q3070042) (← links)
- Evasive Navigation of an Autonomous Mobile Robot in Hostile Unknown Environments (Q3381952) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- Efficient strategies for robot navigation in unknown environment (Q4632462) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (Q5096778) (← links)
- On a simple depth-first search strategy for exploring unknown graphs (Q5096951) (← links)
- Navigating an Infinite Space with Unreliable Movements (Q5146843) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Competitive searching over terrains (Q6547937) (← links)
