An Optimal Competitive Strategy for Walking in Streets
We present a strategy for searching for a goal in a street which achieves the competitive factor of √2, matching the previously known lower bound. This finally solves an interesting open problem in the area of competitive path planning many authors have been working on.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten