Imagine that two robots collaborate to search in a street area, which has an entrance and an exit. At an abstract level, this is the well-known two-guard street walk problem. In essence, given a simple polygon <i>P</i> with two distinct vertices s and <i>g</i> on its boundary and two guards (robots), the general street walk problem asks whether the two… (More)

@article{Zhang2007AUF,
title={A unified framework for two-guard street walk problems},
author={John Zenghui Zhang},
journal={2007 IEEE International Conference on Robotics and Biomimetics (ROBIO)},
year={2007},
pages={793-798}
}