找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Optimal Search for Moving Targets; Lawrence D. Stone,Johannes O. Royset,Alan R. Washb Book 2016 Springer International Publishing Switzerl

[復(fù)制鏈接]
查看: 16164|回復(fù): 39
樓主
發(fā)表于 2025-3-21 17:55:57 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Optimal Search for Moving Targets
編輯Lawrence D. Stone,Johannes O. Royset,Alan R. Washb
視頻videohttp://file.papertrans.cn/703/702916/702916.mp4
概述Follow-up to the 1975 award-winning Theory of Optimal Search.Authors are three of the most respected names in Operations Research.Includes supplementary material:
叢書名稱International Series in Operations Research & Management Science
圖書封面Titlebook: Optimal Search for Moving Targets;  Lawrence D. Stone,Johannes O. Royset,Alan R. Washb Book 2016 Springer International Publishing Switzerl
描述.This book begins with a review of basic results in optimal search for a stationary target. It then develops the theory of optimal search for a moving target, providing algorithms for computing optimal plans and examples of their use. Next it develops methods for computing optimal search plans involving multiple targets and multiple searchers with realistic operational constraints on search movement. These results assume that the target does not react to the search. In the final chapter there is a brief overview of mostly military problems where the target tries to avoid being found as well as rescue or rendezvous problems where the target and the searcher cooperate.?..Larry Stone wrote his definitive book .Theory of Optimal Search.?in 1975, dealing almost exclusively with the stationary target search problem. Since then the theory has advanced to encompass search for targets that move even as the search proceeds, and computers have developed sufficient capability to employ the improved theory. In this book, Stone joins Royset and Washburn to document and explain this expanded theory of search. The problem of how to search for moving targets arises every day in military, rescue, la
出版日期Book 2016
關(guān)鍵詞Brown‘s Alorithm; Continuous Space and Time; Discrete Space and Time; Generalized Search Optimization; M
版次1
doihttps://doi.org/10.1007/978-3-319-26899-6
isbn_softcover978-3-319-80038-7
isbn_ebook978-3-319-26899-6Series ISSN 0884-8289 Series E-ISSN 2214-7934
issn_series 0884-8289
copyrightSpringer International Publishing Switzerland 2016
The information of publication is updating

書目名稱Optimal Search for Moving Targets影響因子(影響力)




書目名稱Optimal Search for Moving Targets影響因子(影響力)學(xué)科排名




書目名稱Optimal Search for Moving Targets網(wǎng)絡(luò)公開度




書目名稱Optimal Search for Moving Targets網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Optimal Search for Moving Targets被引頻次




書目名稱Optimal Search for Moving Targets被引頻次學(xué)科排名




書目名稱Optimal Search for Moving Targets年度引用




書目名稱Optimal Search for Moving Targets年度引用學(xué)科排名




書目名稱Optimal Search for Moving Targets讀者反饋




書目名稱Optimal Search for Moving Targets讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:25:22 | 只看該作者
978-3-319-80038-7Springer International Publishing Switzerland 2016
板凳
發(fā)表于 2025-3-22 03:29:58 | 只看該作者
地板
發(fā)表于 2025-3-22 08:08:38 | 只看該作者
International Series in Operations Research & Management Sciencehttp://image.papertrans.cn/o/image/702916.jpg
5#
發(fā)表于 2025-3-22 08:58:26 | 只看該作者
6#
發(fā)表于 2025-3-22 16:27:22 | 只看該作者
7#
發(fā)表于 2025-3-22 19:32:24 | 只看該作者
Search for a Moving Target in Discrete Space and Time, function is exponential, optimal moving target plans can be obtained by computing a sequence of optimal stationary target plans. The algorithm developed to find these plans is a special case of the more general Forward-And-Backward (FAB) algorithm which is also presented in this chapter.
8#
發(fā)表于 2025-3-22 21:47:52 | 只看該作者
9#
發(fā)表于 2025-3-23 03:20:48 | 只看該作者
Search for a Stationary Target,er provides an overview of the standard models and results for optimal search for a stationary target. It discusses search sensors and some basic notions of detection modeling, including lateral range curves, sweep widths, and detection functions. It defines the search space and the prior distributi
10#
發(fā)表于 2025-3-23 09:13:32 | 只看該作者
Search for a Moving Target in Discrete Space and Time, function is exponential, optimal moving target plans can be obtained by computing a sequence of optimal stationary target plans. The algorithm developed to find these plans is a special case of the more general Forward-And-Backward (FAB) algorithm which is also presented in this chapter.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 04:42
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
昔阳县| 临朐县| 团风县| 武宁县| 广南县| 遵化市| 肇庆市| 万山特区| 攀枝花市| 张家界市| 旬邑县| 双牌县| 运城市| 宜丰县| 容城县| 十堰市| 左权县| 出国| 开平市| 辽宁省| 彝良县| 从化市| 永川市| 杭州市| 衡山县| 清徐县| 朝阳区| 清镇市| 韶山市| 万安县| 泸定县| 丹东市| 太仆寺旗| 井研县| 曲沃县| 广昌县| 海口市| 陕西省| 绥棱县| 调兵山市| 双辽市|