| 基于有序加权平均的博弈树搜索法 |
| |
| 引用本文： | 张自力. 基于有序加权平均的博弈树搜索法[J]. 西南师范大学学报(自然科学版), 1992, 17(1): 44-50 |
| |
| 作者姓名： | 张自力 |
| |
| 作者单位： | 西南师范大学计算机科学系 重庆630715 |
| |
| 摘 要： | 提出了一种基于有序加权平均(Ordered Weighted Averaging—OWA)的博奕树搜索方法.该方法可以弥补α—β剪枝等方法中存在的一些缺陷,且具有比基于广义均值的Min/Max近似搜索更好的性能.
|
| 关 键 词： | 对策树搜索法 对策 有序加权平均 |
GAME TREE SEARCHING BY ORDERED WEIGHTED AVERAGING AGGREGATION |
| |
| Zhang Zili. GAME TREE SEARCHING BY ORDERED WEIGHTED AVERAGING AGGREGATION[J]. Journal of southwest china normal university(natural science edition), 1992, 17(1): 44-50 |
| |
| Authors: | Zhang Zili |
| |
| Abstract: | A new approach for game tree searching based on the ordered weighted averaging (OWA) aggregation is presented. This method can remedy the defect of some game tree searching techniques such as a pruning. And its performance is better than that of the Min/Max approximation which based on the generalized mean-valued operator. |
| |
| Keywords: | game playing game tree searching ordered weighted averaging aggregation |
| 本文献已被 CNKI 维普 等数据库收录！ |
