Abstract

In a finite-dimensional Euclidean space, the problem of a simple pursuit by a group of pursuers of two evaders is considered on a given time scale. It is assumed that all evaders use the same control and do not leave the convex polyhedral set. The pursuers use counter-strategies based on information about the initial positions and control history of the evaders. The set of admissible controls for each of the participants is a unit ball centered at zero, the target sets are the origin. The goal of the pursuers' group is the capture by two pursuers of at least one evader or the capture of two evaders. In terms of the initial positions and game parameters a sufficient capture condition has been obtained. The study uses the method of resolving functions as a basic one, which allows to obtain sufficient conditions for the solvability of the approach problem in some guaranteed time.

Full Text
Paper version not known

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 call

Disclaimer: 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.