An ε* based greedy single robot coverage path planner (CPP) [3] was developped. This algorithm does not require cell subdivision, making it more suitable for cluttered environments than STC.