Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques

A. Alzulaibani
{"title":"Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques","authors":"A. Alzulaibani","doi":"10.1504/ijmor.2020.10024710","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to study the stability of the optimal distribution for the searching effort to detect two related Markovian targets by using multiple cooperative searchers. This effort, at each fixed number of time intervals, is a random variable with a normal distribution. The optimal solution (which makes the discounted effort reward with fuzzy parameter maximum) is obtained from solving a fuzzy stochastic optimisation problem. Rather than presenting an algorithm that shows the stability of the optimal distribution of an effort, we study more interesting special cases of located spider landmines and unrestricted effort. Two illustrative examples of Markovian and randomly located spider landmines are discussed.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijmor.2020.10024710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The aim of this paper is to study the stability of the optimal distribution for the searching effort to detect two related Markovian targets by using multiple cooperative searchers. This effort, at each fixed number of time intervals, is a random variable with a normal distribution. The optimal solution (which makes the discounted effort reward with fuzzy parameter maximum) is obtained from solving a fuzzy stochastic optimisation problem. Rather than presenting an algorithm that shows the stability of the optimal distribution of an effort, we study more interesting special cases of located spider landmines and unrestricted effort. Two illustrative examples of Markovian and randomly located spider landmines are discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
模糊最大折现努力奖励搜索马尔可夫目标搜索努力最优分布的稳定性:以合作搜索技术为例
本文的目的是研究使用多个合作搜索器来检测两个相关马尔可夫目标的搜索努力最优分布的稳定性。这种努力,在每一个固定的时间间隔,是一个具有正态分布的随机变量。通过求解一个模糊随机优化问题,得到了使具有模糊参数的折现努力报酬最大的最优解。我们并没有提出一种算法来证明努力最优分配的稳定性,而是研究了定位蜘蛛地雷和不受限制努力的更有趣的特殊情况。讨论了马尔可夫和随机定位蜘蛛地雷的两个例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Availability analysis of a complex system consisting of two subsystems in parallel configuration with replacement at failure An inventory model for deteriorating items with preservation facility of ramp type demand and trade credit Performance prediction and ANFIS computing for unreliable retrial queue with delayed repair under modified vacation policy Material selection through of multi-criteria decisions methods applied to a helical gearbox Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1