Abstract
Consideration is given to a differential game on the plane when the moves of a pursuer and a running away are described by equations of the simple move, and integral constraints are imposed on control functions. In the process of the game the pursuer moves within the prescribed closed convex subset of the plane and the running away moves along its boundary. In the case when the running away has an advantage of resources, the development is made of the runaway strategy that affords the lower bound for the distance between the players. In the case when the pursuer has an advantage of resources, for any initial positions of the players the optimal time of pursuit is found and optimal strategies of the players are set up.
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.
