Walking an unknown street with bounded detour
From MaRDI portal
Publication:1194307
DOI10.1016/0925-7721(92)90010-PzbMath0752.68086MaRDI QIDQ1194307
Publication date: 27 September 1992
Published in: Computational Geometry (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (18)
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework ⋮ Tight analysis of a self-approaching strategy for the online kernel-search problem ⋮ Walking streets faster ⋮ Lower bounds in on-line geometric searching metric searching ⋮ Going home through an unknown street ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ Position-independent near optimal searching and on-line recognition in star polygons ⋮ Online algorithms for searching and exploration in the plane ⋮ Searching and on-line recognition of star-shaped polygons. ⋮ Agent search in uniform b-ary trees: Multiple goals and unequal costs ⋮ The ultimate strategy to search on \(m\) rays? ⋮ On-line path planning in an unknown polygonal environment ⋮ Parallel searching on \(m\) rays ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS ⋮ GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA ⋮ Piecemeal graph exploration by a mobile robot. ⋮ Walking in Streets with Minimal Sensing ⋮ Walking in streets with minimal sensing
Cites Work
This page was built for publication: Walking an unknown street with bounded detour
