Navigating in Unfamiliar Geometric Terrain
From MaRDI portal
Publication:4337436
DOI10.1137/S0097539791194931zbMATH Open1075.68608MaRDI QIDQ4337436FDOQ4337436
Authors: Prabhakar Raghavan, Baruch Schieber, Avrim Blum 
Publication date: 7 August 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cited In (34)
- Optimal robot localization in trees
- Exploring sparse graphs with advice
- Convergecast and broadcast by power-aware mobile agents
- Competitive Searching for a Line on a Line Arrangement.
- Tree exploration with advice
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Optimal graph exploration without good maps
- An Online Algorithm for Improving Performance in Navigation
- Memory Efficient Anonymous Graph Exploration
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- Online makespan minimization with parallel schedules
- Leaving an unknown maze using an error-prone compass
- Navigating an Infinite Space with Unreliable Movements
- Exploration of Faulty Hamiltonian Graphs
- Walking an unknown street with bounded detour
- Online algorithms for searching and exploration in the plane
- How to find a point on a line within a fixed distance
- Evasive navigation of an autonomous mobile robot in hostile unknown environments
- Advice complexity of treasure hunt in geometric terrains
- Competitive complexity of mobile robot on-line motion planning problems
- Graph exploration by a finite automaton
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Title not available (Why is that?)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- Searching and on-line recognition of star-shaped polygons.
- Efficient strategies for robot navigation in unknown environment
- On a simple depth-first search strategy for exploring unknown graphs
- Multidimensional online motion planning for a spherical robot
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
- Competitive searching over terrains
- Performance bounds for planning in unknown terrain
- Worst-case optimal exploration of terrains with obstacles
This page was built for publication: Navigating in Unfamiliar Geometric Terrain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337436)
