リードス・シープ追跡者の円錐視野からの最短時間脱出:同速以下の逃避者に対する分類とゲーム値
Minimum-Time Escape from the Conic Field of View of a Reeds-Shepp Pursuer: Classification and Game Value for a Slower or Equally Fast Evader
リードス・シープ車両の前方円錐視野から全方位逃避者が最短時間で脱出する問題を解析し、速度比による脱出可否の分類と、同速以下での脱出時間・保持領域をゲーム理論的に導出した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Ubaldo Ruiz
分類: cs.RO, math.OC
原文アブストラクト
We study minimum-time escape of an omnidirectional evader from the forward conic field of view of a Reeds-Shepp pursuer with minimum turning radius $r$. For speed ratio $ν$ and cone half-angle $0<α<π/2$, we prove a global escape/holding classification: straight reversal holds the whole cone for $ν\le\sinα$, escape is confined to a barrier-bounded dart for $\sinα<ν\le1$, and escape is possible from every state for $ν>1$. For the slower or equally fast evader, $\sinα<ν\le1$, we construct the solution with Isaacs' characteristics and verify it in feedback form, using a Filippov pursuer relay and a one-sided evader branch. The finite escape time is the first root of one scalar equation, and the holding region is bounded by the nonusable parts of the rays and a barrier that closes with a convex corner on the front axis. Sample-and-hold counter-controls show that this escape time is the value of the game in nonanticipative strategies at every state except the corner. There the two strategy values differ: the pursuer's is infinite, whereas an evader that chooses which barrier branch to cross from the initial germ of the pursuer's control escapes before the barrier time $τ_I$, which is the evader's exact strategy value. An independent level-set solver, refined on fixed comparison points, agrees with the closed-form escape time and reproduces the holding region at the tested parameters.
関連論文
- 空中ロボットによる地上侵入者からの境界防衛:理論と実践追跡逃避ゲーム