Navigating in Unfamiliar Geometric Terrain

DOI10.1137/S0097539791194931MaRDI QIDQ4337436zbMATH OpenFDO

Authors Prabhakar Raghavan, Baruch Schieber, Avrim Blum

Publication date 7 August 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

robot navigation, computational geometry, on-line algorithms

Mathematics Subject Classification ID

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)

Recommendations

• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
• An Online Algorithm for Improving Performance in Navigation
• Efficient strategies for robot navigation in unknown environment
• Going home through an unknown street

Cited in

(33)

• Walking an unknown street with bounded detour
• Online algorithms for searching and exploration in the plane
• Optimal graph exploration without good maps
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Navigating an Infinite Space with Unreliable Movements
• How to find a point on a line within a fixed distance
• An Online Algorithm for Improving Performance in Navigation
• LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
• Competitive complexity of mobile robot on-line motion planning problems
• Competitive searching over terrains
• Advice complexity of treasure hunt in geometric terrains
• Exploration of Faulty Hamiltonian Graphs
• Memory Efficient Anonymous Graph Exploration
• Efficient strategies for robot navigation in unknown environment
• Piecemeal graph exploration by a mobile robot.
• The power of a pebble: Exploring and mapping directed graphs
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Performance bounds for planning in unknown terrain
• Graph exploration by a finite automaton
• Optimal robot localization in trees
• Searching and on-line recognition of star-shaped polygons.
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Worst-case optimal exploration of terrains with obstacles
• A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
• On a simple depth-first search strategy for exploring unknown graphs
• Evasive navigation of an autonomous mobile robot in hostile unknown environments
• Exploring sparse graphs with advice
• Multidimensional online motion planning for a spherical robot
• Convergecast and broadcast by power-aware mobile agents
• Tree exploration with advice
• Leaving an unknown maze using an error-prone compass
• scientific article; zbMATH DE number 1552907 (Why is no real title available?)
• Competitive Searching for a Line on a Line Arrangement.

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)