限られたセンシング範囲を持つ複数ロボットによる静的・移動侵入者の探索
Multi-robot searching with limited sensing range for static and mobile intruders
直交多角形領域内で複数の探索ロボットが限られたセンシング範囲で侵入者を探す問題を扱い、空間充填曲線やランダム探索などの効率的なアルゴリズムを提案し、ロボット数と探索時間のトレードオフを評価した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Swadhin Agrawal, Sujoy Bhore, Joseph S. B. Mitchell, P. B. Sujit, Aayush Gohil
分類: cs.RO, cs.CG, cs.CR, cs.MA
原文アブストラクト
We consider the problem of searching for an intruder in a geometric domain by utilizing multiple search robots. The domain is a simply connected orthogonal polygon with edges parallel to the cartesian coordinate axes. Each robot has a limited sensing capability. We study the problem for both static and mobile intruders. It turns out that the problem of finding an intruder is NP-hard, even for a stationary intruder. Given this intractability, we turn our attention towards developing efficient and robust algorithms, namely methods based on space-filling curves, random search, and cooperative random search. Moreover, for each proposed algorithm, we evaluate the trade-off between the number of search robots and the time required for the robots to complete the search process while considering the geometric properties of the connected orthogonal search area.
