Abstract
In this paper, we study a pursuit-evasion differential game problem in the Hilbert space Dynamics of countable number of pursuers and evader expressed as nth-order differential equations with geometric constraints on the control functions of the players. The game terminates at a given fixed time which is denoted by ϑ. The game's payoff is the infimum of the distances between the evader and pursuers at the time ϑ. According to the rule of the game, pursuers try to minimise the distance to the evader and the evader tries to maximises it. We found value of the game and constructed players' optimal strategies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
