【摘要】：首次基于搜索成本及搜索資源等限制因素,構(gòu)造局中人面向多重約束條件的可行策略集合,建立相應(yīng)的搜索空間;在給定搜索點(diǎn)權(quán)值的基礎(chǔ)上,考慮搜索成本與搜索成功概率等因素,構(gòu)造相應(yīng)的支付函數(shù),建立多重因素約束下的網(wǎng)格搜索對(duì)策模型.為簡(jiǎn)化模型求解,將對(duì)策論問(wèn)題轉(zhuǎn)化為約束最優(yōu)化問(wèn)題,求解約束問(wèn)題獲得最優(yōu)值,轉(zhuǎn)化為模型的對(duì)策值,并給出雙方最優(yōu)混合策略.最后,給出軍事想定實(shí)例,說(shuō)明上述模型的實(shí)用性及方法的有效性.
[Abstract]:For the first time, based on the limited factors such as search cost and search resources, a set of feasible strategies for multiple constraints is constructed, and the corresponding search space is established. On the basis of the given search point weights, considering the factors such as search cost and search success probability, the corresponding payment function is constructed, and the grid search game model with multiple constraints is established. In order to simplify the solution of the model, the game theory problem is transformed into the constrained optimization problem, the optimal value is obtained by solving the constraint problem, and the game value of the model is transformed into the game value of the model. Finally, a military scenario example is given to illustrate the practicability of the above model and the validity of the method.
【作者單位】： 海軍工程大學(xué)理學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(71171198)
【分類號(hào)】：O225

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 康璇;解無(wú)導(dǎo)數(shù)優(yōu)化問(wèn)題的非單調(diào)過(guò)濾集網(wǎng)格搜索方法[D];南京師范大學(xué);2014年

，

本文編號(hào)：2311819