  We exhibit an algorithm with continuous instructions for two robots moving
without collisions on a track shaped as a wedge of three circles. We show that
the topological complexity of the configuration space associated with this
problem is 3. The topological complexity is a homotopy invariant that can be
thought of as the minimum number of continuous instructions required to
describe the movement of the robots between any initial configuration to any
final one without collisions. The algorithm presented is optimal in the sense
that it requires exactly 3 continuous instructions.
