Shortest Paths for a Two-robot Rendez-vous

In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the robots can travel to move from their initial positions to positions in which they are able to communicate. In order to communicate, the robots need to be visible to one another. We give e cient algorithms for minimizing either the sum or the maximum of the two path lengths.

• Type: Conference
• Year: 1993
• Where: CCCG
• Authors: Erik L. Wynters, Joseph S. B. Mitchell
• Keywords: CCCG 1993, CCCG 2007, Optimalmotionplanning Problem, Point Robots, Robots