ライオンと人の問題に対する改良ライオン戦略
An improved lion strategy for the lion and man problem
追跡者と逃走者の古典的問題「ライオンと人」において、中心を毎ステップ更新する新戦略を提案し、収束性とゲーム長の上界を従来より改善した。
著者: Marco Casini, Andrea Garulli
分類: math.OC, cs.RO
原文アブストラクト
In this paper, a novel lion strategy for David Gale's lion and man problem is proposed. The devised approach enhances a popular strategy proposed by Sgall, which relies on the computation of a suitable "center". The key idea of the new strategy is to update the center at each move, instead of computing it once and for all at the beginning of the game. Convergence of the proposed lion strategy is proven and an upper bound on the game length is derived, which dominates the existing bounds.
