Comment: Heuristic Algorithm (Score 1) 514
Examination of the example in the article suggests a heuristic algorithm that should provide near-optimal solutions and is suitable for real-time execution on neural wetware.
1. Start by mowing around the outside border.
2. Proceed going around, from the outside in.
3. When you reach a strip <= 3 mowers wide, clear it with short back-and-forths.
Proof of an upper bound on excess mowing vis-a-vis the optimal solution is left as an exercise for the reader.