総面積最小のm個の円盤による点集合の多重被覆
Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
各点を指定回数以上覆うようm個の円盤を配置し総面積を最小化する問題に対し、高速ヒューリスティックと整数計画法を組み合わせた解法を提案した。
著者: Mariem Guitouni, Chek-Manh Loi, Sándor P. Fekete, Michael Perk, Aaron T. Becker
分類: cs.RO, cs.CG
原文アブストラクト
A common robotics sensing problem is to place sensors to robustly monitor a set of assets, where robustness is assured by requiring asset $p$ to be monitored by at least $\kappa(p)$ sensors. Given $n$ assets that must be observed by $m$ sensors, each with a disk-shaped sensing region, where should the sensors be placed to minimize the total area observed? We provide and analyze a fast heuristic for this problem. We then use the heuristic to initialize an exact Integer Programming solution. Subsequently, we enforce separation constraints between the sensors by modifying the integer program formulation and by changing the disk candidate set.
