We find the coordinated motion for two square robots that minimizes the sum of the length of the path of every robot, for every initial and final positions of both robots. We study it in an obstacle-free plane, so the unique constraint is that the robots can not collide
