ドゥビンスダイナミクスを持つ防衛エージェントによる連続侵入者への目標防衛アルゴリズム
Target Defense against Sequentially Arriving Intruders: Algorithm for Agents with Dubins Dynamics
非ホロノミックなドゥビンスダイナミクスを持つ防衛者と侵入者の目標防衛問題を扱い、部分情報と完全情報の2段階に分けて捕獲可能性を解析し、有限・無限の侵入者列に対する捕獲率を評価した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Arman Pourghorban, Dipankar Maity
分類: eess.SY, cs.RO, cs.SY
原文アブストラクト
We consider a variant of the target defense problem where a single defender is tasked to capture a sequence of incoming intruders. Both the defender and the intruders have non-holonomic dynamics. The intruders' objective is to breach the target perimeter without being captured by the defender, while the defender's goal is to capture as many intruders as possible. After one intruder breaches or is captured, the next appears randomly on a fixed circle surrounding the target. Therefore, the defender's final position in one game becomes its starting position for the next. We divide an intruder-defender engagement into two phases, partial information and full information, depending on the information available to the players. We address the capturability of an intruder by the defender using the notions of Dubins path and guarding arc. We quantify the percentage of capture for both finite and infinite sequences of incoming intruders. Finally, the theoretical results are verified through numerical examples using Monte-Carlo-type random trials of experiments.
