  Two cooperating, autonomous mobile robots with arbitrary nonzero max speeds
are placed at arbitrary initial positions in the plane. A remotely detonated
bomb is discovered at some source location and must be moved to a safe distance
away from its initial location as quickly as possible. In the Bomb Squad
problem, the robots cooperate by communicating face-to-face in order to pick up
the bomb from the source and carry it away to the boundary of a disk centered
at the source in the shortest possible time. The goal is to specify
trajectories which define the robots' paths from start to finish and their
meeting points which enable face-to-face collaboration by exchanging
information and passing the bomb from robot to robot.
  We design algorithms reflecting the robots' knowledge about orientation and
each other's speed and location. In the offline case, we design an optimal
algorithm. For the limited knowledge cases, we provide online algorithms which
consider robots' level of agreement on orientation as per OneAxis and NoAxis
models, and knowledge of the boundary as per Visible, Discoverable, and
Invisible. In all cases, we provide upper and lower bounds for the competitive
ratios of the online problems.
