Navigating in Unfamiliar Geometric Terrain
From MaRDI portal
Publication:4337436
DOI10.1137/S0097539791194931zbMath1075.68608MaRDI QIDQ4337436
Baruch Schieber, Prabhakar Raghavan, Avrim L. Blum
Publication date: 7 August 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Related Items
Online makespan minimization with parallel schedules ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ 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 ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Online algorithms for searching and exploration in the plane ⋮ Searching and on-line recognition of star-shaped polygons. ⋮ Efficient strategies for robot navigation in unknown environment ⋮ Walking an unknown street with bounded detour ⋮ Tree exploration with advice ⋮ COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS ⋮ Optimal graph exploration without good maps ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS ⋮ MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT ⋮ Evasive Navigation of an Autonomous Mobile Robot in Hostile Unknown Environments ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ How to find a point on a line within a fixed distance ⋮ Graph exploration by a finite automaton ⋮ Piecemeal graph exploration by a mobile robot. ⋮ Optimal robot localization in trees ⋮ The power of a pebble: Exploring and mapping directed graphs ⋮ Exploring sparse graphs with advice ⋮ Performance bounds for planning in unknown terrain ⋮ Convergecast and broadcast by power-aware mobile agents
