论文信息 - Escaping an Infinitude of Lions - 字舞流文

Escaping an Infinitude of Lions

Abstract We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed for some value . Can the man survive? We answer the question in the affirmative for any .

Christian Wulff-Nilsen | Mikkel Abrahamsen | Eva Rotenberg | Jacob Holm

[1] Nicolas Nisse,et al. Pursuing a fast robber on a graph , 2010, Theor. Comput. Sci..

[2] Massoud Amini,et al. Evasion from many pursuers in simple motion differential game with integral constraints , 2012, Eur. J. Oper. Res..

[3] B. Bollobás,et al. Lion and man—can both win? , 2009, 0909.2524.

[4] Efstathios Bakolas. On the finite-time capture of a fast moving target , 2017 .

[5] F. L. Chernous'ko. A problem of evasion from many pursuers: PMM vol. 40, n≗1, 1976, pp. 14–24 , 1976 .

[6] Mangal Kothari,et al. Pursuit-Evasion Games of High Speed Evader , 2017, J. Intell. Robotic Syst..

[7] J. Lewin,et al. The lion and man problem revisited , 1986 .

[8] H. T. Croft. “Lion and Man”: A Postscript , 1964 .

[9] James Flynn,et al. Lion and Man: The General Case , 1974 .

[10] S. Bhogle,et al. LITTLEWOOD'S MISCELLANY , 1990 .

[11] Noga Alon,et al. Chasing a Fast Robber on Planar Graphs and Random Graphs , 2015, J. Graph Theory.

[12] James Flynn,et al. Lion and Man: The Boundary Constraint , 1973 .