Abstract
Zero-sum linear differential games on a fixed time segment with geometrically constrained controls are considered. We study the efficiency of an algorithm to calculate the game value function, which is based on Krasovskii's concept of the stable bridge for differential games. The second order estimates of the error of the discrete-time algorithm for games with strongly convex penalty functions and for games with strongly convex restriction sets are obtained. Convex analysis and, in particular, the theory of convex conjugate functions are important means of the investigation.
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.
