Abstract
The article deals with the linear pursuit problem with n pursuers and m evaders with equal opportunities for all participants and geometric restrictions on the control of players. The evaders use program strategies, and each pursuer catches no more than one evader. The goal of the pursuers is to catch a given number of evaders, and each evader needs to be caught no less than a certain number of pursuers. In this paper, sufficient conditions are obtained for multiple capture of a given number of evaders.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
