The boundary explorer would try to move a small distance forward, if it could, it would back up, and turn right a small amount. Then it would try moving forward again, looking for the most right it could turn whilst still being able to walk forwards. This would trace the boundary clockwise.
If the lawnmower grid resolution pattern was half the smallest diameter of an obstacle. You would be guaranteed to discover the topology of the map (assuming the map walk operator is bidirectional, which it isn't, but should be.)