首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于离散模型的双边搜索博弈问题的研究
引用本文:陈俊,王令群,郑应平.基于离散模型的双边搜索博弈问题的研究[J].科技导报(北京),2007,25(2):64-67.
作者姓名:陈俊  王令群  郑应平
作者单位:同济大学控制科学与工程系,上海,201804;水产大学计算机科学与技术系,上海,200090
摘    要:在双边搜索中,被搜索者不希望被搜索到,因此可以将搜索双方的行为看成二人零和博弈问题。在考虑搜索双方的搜索花费和搜索单元格的探测概率情况下描述了搜索过程,并基于离散搜索模型提出了一类双边搜索问题的算法,通过仿真算例,分析了搜索双方在均衡解下的搜索结果。

关 键 词:搜索论  双边搜索  二人零和
文章编号:1000-7857(2007)02-0064-04
修稿时间:10 19 2006 12:00AM

Two-sided Search Game Based on Discrete Model
CHEN Jun,WANG Lingqun,ZHENG Yingping.Two-sided Search Game Based on Discrete Model[J].Science & Technology Review,2007,25(2):64-67.
Authors:CHEN Jun  WANG Lingqun  ZHENG Yingping
Institution:1. Department of Control Science and Engineering, Tongji University, Shanghai 201804, China ;2. Department of Computer Science and Technology, Fisheries University, Shanghai 200090, China
Abstract:A two-sided search,where the target makes every effort to evade searchers' detection,can be regarded as a two-person zero-sum game.The game is formulated with consideration of search costs on both players and detection probabilities of cells.Based on a discrete model,a solution to this two-sided search game is proposed.The equilibrium of both players is analyzed after the simulation.
Keywords:search theory  two-sided search  two-person zero-sum
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号