Abstract
Abstract The evasion problem is considered in which group of pursuers and group of evaders participate under the condition that the pursuers include participants whose capabilities do not yield place to the capabilities of evaders and participants with lesser capabilities. The goal of the group of pursuers is to “catch” all the evaders. The goal of the group of evaders is to prevent this from happening, i.e., to make it possible for at least one of the evaders to avoid an encounter. The pursuers and the evaders employ piecewise-program strategies. It is shown that if in a differential game avoidance of an encounter by at least one evader takes place over an infinite time interval, then upon the addition of “weak” pursuers avoidance will take place on any finite time interval.
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.
