AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT

DOI10.1142/S0218195993000154zbMath0804.68153MaRDI QIDQ4294713

Kwong-fai Chan, Tak-Wah Lam

Publication date: 12 January 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

shortest pathsroboticson-line algorithmscomputational geometrycompetitivenessmotion-planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Competitive exploration of rectilinear polygons ⋮ 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 ⋮ Parallel searching on \(m\) rays ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS