{"title":"Numerical solutions to differential games based on approximations by Markov games","authors":"B. Tolwinski","doi":"10.1109/CDC.1989.70097","DOIUrl":null,"url":null,"abstract":"The dynamic programming equation arising in zero-sum differential games can be approximated by a sequence of finite-state Markov games that can be efficiently solved by a version of the modified policy iteration method. The authors use the approach to solve a combat problem related to the classical two-car game of R. Isaacs (Differential Games, Wiley, 1965). The results of this computational experiment indicate that the approach could be an effective tool for the solution of a variety of more complex models of conflict.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":" 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The dynamic programming equation arising in zero-sum differential games can be approximated by a sequence of finite-state Markov games that can be efficiently solved by a version of the modified policy iteration method. The authors use the approach to solve a combat problem related to the classical two-car game of R. Isaacs (Differential Games, Wiley, 1965). The results of this computational experiment indicate that the approach could be an effective tool for the solution of a variety of more complex models of conflict.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
