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


Stochastic search in a convex region
Authors:Steven Lalley  Herbert Robbins
Institution:(1) Statistics Department, Math Sciences Building, Purdue University, 47907 West Lafayette, IN, USA;(2) Department of Statistics, Rutgers University, 08903 New Brunswick, NJ, USA
Abstract:Summary A stochastic search strategy is proposed for locating a possibility mobile target in a bounded, convex region of the plane. The strategy is asymptotically minimax as epsirarr0 with respect to the time required to get within epsi of the target. The proof involves the study of first passages to time-dependent boundaries by a certain semi-Markov process.Supported by NSF grant DMS 82-01723
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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