Abstract
In the finite-dimensional Euclidean space, a generalized nonstationary example of L.S. Pontryagin with many participants is considered with the same dynamic and inertial capabilities of all players. The aim of the group of pursuers is to catch at least q evaders, and each evader must be caught by at least r pursuers. Assuming that evaders use program strategies, and each pursuer catches no more than one evader. Sufficient conditions for the solvability of the pursuit problem are obtained.
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.
