| 一类定量微分对策理论中最优策略的算法及其收敛性 |
| |
| 引用本文： | 吴汉生.一类定量微分对策理论中最优策略的算法及其收敛性[J].自动化学报,1992,18(2):143-150. |
| |
| 作者姓名： | 吴汉生 |
| |
| 作者单位： | 1.东北工学院自动控制系,沈阳 |
| |
| 摘 要： | 本文利用不动点原理讨论了一类定量微分对策理论中最优策略的计算方法问题.首先构
造出了一种迭代方法,然后利用不动点原理分析了该迭代法的收敛性.本文给出的方法还可
用于一类Nash微分对策的Nash策略的分散计算方法.
|
| 关 键 词： | 定量微分对策 最优策略 不动点定理 收敛性 |
| 收稿时间： | 1990-9-19 |
Algorithm and Convergence of Optimal Strategies in a Class of Quantitative Differential Games |
| |
| Wu Hansheng.Algorithm and Convergence of Optimal Strategies in a Class of Quantitative Differential Games[J].Acta Automatica Sinica,1992,18(2):143-150. |
| |
| Authors: | Wu Hansheng |
| |
| Affiliation: | 1.Dept.of Automatic Control,Northeast University of Technology,Shenyang |
| |
| Abstract: | In this paper,the algorithm for finding the optimal strategies for a class of quantitative differential games is discussed, by making use of the fixed point theorem. First, we construct an iterative process by which the optimal strategies are found, then by making use of he fixed point theorem, we analyze the convergence of this iterative process. The method developed in this paper may find some applications in a class of Nash differential games where one seeks to develop some distributed algorithms for the computation of Nash equilibria. |
| |
| Keywords: | Quantitative differential games optimal strategies fixed point theorein convergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
