Minimization of the maximum distance between the two guards patrolling a polygon

The two-guard problem asks whether two guards can walk to detect an unpredictable, moving target in a polygonal region P. no matter how fast the target moves, and if so, construct a walk schedule of the guards. For safety, two guards are required to always be mutually visible, and thus they move on