Before revision:  We study the problem of a watchman route in an online setting, i.e., in a setting where the watchman is only aware of the vertices of the polygonto which it had a direct line of sight along its route. We present an algorithm guaranteeing a ~89.83 competitive ratio relative to the optimal offline path length .
After revision:  We prove that the presented algorithms guarantees a \approx 22.77 competitive ratio compared to the optimal offline path length .