Generating Optimal Two-Robot Street Walk Schedules
J.Z. Zhang · 2009
Two robots collaboratively search a street area. At an abstract level, this is the well-known two-guard street walk problem. Variations of the problem, i.e., general walk, straight walk, counter walk, straight counter walk, have been studied. In this work, deepening our previous work on simple characterizations of walkable streets, we consider the generation of optimal walk schedules by two robots.