Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimal Pursuit with Countably Many Pursuers and One Evader

Optimal Pursuit with Countably Many Pursuers and One Evader Differential Equations, Vol. 41, No. 5, 2005, pp. 627–635. Translated from Differentsial'nye Uravneniya, Vol. 41, No. 5, 2005, pp. 603–610. Original Russian Text Copyright c 2005 by Ibragimov. ORDINARY DIFFERENTIAL EQUATIONS Optimal Pursuit with Countably Many Pursuers and One Evader G. I. Ibragimov The University of World Economy and Diplomacy, Tashkent, Uzbekistan Received March 5, 2004 1. STATEMENT OF THE PROBLEM Numerous papers [1{11] deal with di erential games. Fundamental results were obtained in [1{4]. Constructing the players' optimal strategies and nding the game value are of special interest in the analysis of di erential games. Di erential pursuit-evasion games involving several objects with simple motion attract the at- tention of numerous authors [6{11]. Important results for optimal pursuit theory were obtained in [6{9]. In the present paper, we consider a di erential game of pursuit of one object by countably many dynamical objects in the space l . The terminal time of the game is xed. The game value is the greatest lower bound of the distances between the evader and the pursuers at terminal time. The pursuers' objective is to minimize the value, and the evader's objective is to maximize it. The present paper continues the research http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Differential Equations Springer Journals

Optimal Pursuit with Countably Many Pursuers and One Evader

Ibragimov, G.
Differential Equations , Volume 41 (5) – Jul 27, 2005
Download PDF
9 pages

Loading next page...
 
/lp/springer-journals/optimal-pursuit-with-countably-many-pursuers-and-one-evader-X9Kf2J0rDx

References (1)

Publisher
Springer Journals
Copyright
Copyright © 2005 by MAIK “Nauka/Interperiodica”
Subject
Mathematics; Difference and Functional Equations; Ordinary Differential Equations; Partial Differential Equations
ISSN
0012-2661
eISSN
1608-3083
DOI
10.1007/s10625-005-0198-y
Publisher site
See Article on Publisher Site

Abstract

Differential Equations, Vol. 41, No. 5, 2005, pp. 627–635. Translated from Differentsial'nye Uravneniya, Vol. 41, No. 5, 2005, pp. 603–610. Original Russian Text Copyright c 2005 by Ibragimov. ORDINARY DIFFERENTIAL EQUATIONS Optimal Pursuit with Countably Many Pursuers and One Evader G. I. Ibragimov The University of World Economy and Diplomacy, Tashkent, Uzbekistan Received March 5, 2004 1. STATEMENT OF THE PROBLEM Numerous papers [1{11] deal with di erential games. Fundamental results were obtained in [1{4]. Constructing the players' optimal strategies and nding the game value are of special interest in the analysis of di erential games. Di erential pursuit-evasion games involving several objects with simple motion attract the at- tention of numerous authors [6{11]. Important results for optimal pursuit theory were obtained in [6{9]. In the present paper, we consider a di erential game of pursuit of one object by countably many dynamical objects in the space l . The terminal time of the game is xed. The game value is the greatest lower bound of the distances between the evader and the pursuers at terminal time. The pursuers' objective is to minimize the value, and the evader's objective is to maximize it. The present paper continues the research

Journal

Differential Equations – Springer Journals

Published: Jul 27, 2005

There are no references for this article.