找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 16140|回复: 39
发表于 2025-3-21 17:55:57 | 显示全部楼层 |阅读模式
书目名称Optimal Search for Moving Targets
编辑Lawrence D. Stone,Johannes O. Royset,Alan R. Washb
视频video
概述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
关键词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影响因子(影响力)学科排名




书目名称Optimal Search for Moving Targets网络公开度




书目名称Optimal Search for Moving Targets网络公开度学科排名




书目名称Optimal Search for Moving Targets被引频次




书目名称Optimal Search for Moving Targets被引频次学科排名




书目名称Optimal Search for Moving Targets年度引用




书目名称Optimal Search for Moving Targets年度引用学科排名




书目名称Optimal Search for Moving Targets读者反馈




书目名称Optimal Search for Moving Targets读者反馈学科排名




单选投票, 共有 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

您所在的用户组没有投票权限
发表于 2025-3-21 23:25:22 | 显示全部楼层
978-3-319-80038-7Springer International Publishing Switzerland 2016
发表于 2025-3-22 03:29:58 | 显示全部楼层
发表于 2025-3-22 08:08:38 | 显示全部楼层
International Series in Operations Research & Management Sciencehttp://image.papertrans.cn/o/image/702916.jpg
发表于 2025-3-22 08:58:26 | 显示全部楼层
发表于 2025-3-22 16:27:22 | 显示全部楼层
发表于 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.
发表于 2025-3-22 21:47:52 | 显示全部楼层
发表于 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
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-31 23:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表