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)

Full work available at URL https://doi.org/10.1137/S0097539791194931

zbMATH Keywords

robot navigation, computational geometry, on-line algorithms

Mathematics Subject Classification ID

Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

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

(36)

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

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)