連続センシングによる物体探索の期待時間最小化のための被覆経路計画
Coverage Path Planning For Minimizing Expected Time to Search For an Object With Continuous Sensing
連続的なセンシング情報を用いて物体を探索する際の期待検出時間を最小化する被覆経路計画問題を定式化し、近似アルゴリズムとヒューリスティクスを提案した。
著者: Linh Nguyen
分類: cs.RO
原文アブストラクト
In this paper, we present several results of both theoretical as well as practical interests. First, we propose the quota lawn mowing problem, an extension of the classic lawn mowing problem in computational geometry, as follows: given a quota of coverage, compute the shortest lawn mowing route to achieve said quota. We give constant-factor approximations for the quota lawn mowing problem. Second, we investigate the expected detection time minimization problem in geometric coverage path planning with local, continuous sensory information. We provide the first approximation algorithm with provable error bounds with pseudopolynomial running time. Our ideas also extend to another search mechanism, namely visibility-based search, which is related to the watchman route problem. We complement our theoretical analysis with some simple but effective heuristics for finding an object in minimum expected time, on which we provide simulation results.
