We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of investigation, we show that imposing various degrees of robustness on the notion of visibility coverage leads to a more tractable (and realistic) problem for which we can provide approximation algorithms with constant factor guarantees.

翻译：我们提出在多种模型下“鲁棒地”守卫一个区域的精确定义。尽管最小化多边形中（精确）点守卫数量的近似算法是一个众所周知的具有挑战性的研究领域，但我们表明，对可见性覆盖概念施加不同程度的鲁棒性，将导致一个更易处理（且更现实）的问题，我们能够为其提供具有常数因子保证的近似算法。