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.
Casini, M., Garulli, A. (2017). An improved lion strategy for the lion and man problem. IEEE CONTROL SYSTEMS LETTERS, 1(1), 38-43 [10.1109/LCSYS.2017.2702652].
An improved lion strategy for the lion and man problem
CASINI, MARCO;GARULLI, ANDREA
2017-01-01
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
L-CSS17_Lion_and_man_final.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
499.5 kB
Formato
Adobe PDF
|
499.5 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/1006597