An Optimal Competitive Strategy for Walking in Streets

We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally settles an interesting open problem in the area of competitive path planning many authors have been working on. Key words: computational geometry, autonomous robot, competitive strategy, LRvisibility, on-line navigation, path planning, polygon, street.

• Type: Conference
• Year: 1999
• Where: STACS
• Authors: Christian Icking, Rolf Klein, Elmar Langetepe
• Keywords: Competitive Factor, Interesting Open Problem, Path Planning, STACS 1999, Theoretical Computer Science