Linear search problem with low sensing on two rays

Linear Search Problem, Search Games

West, Argen McAllister

关键词: Linear Search Problem, Search Games;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/101550/WEST-DISSERTATION-2018.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

We consider a generalization of the linear search problem where the searcher has low sensing capabilities on two rays.We first show the necessary conditions for an optimal search plan to exist.We then investigate properties of optimal search plans and show that optimal search plans are defined by an underlying fourth order recurrence relation.We then develop numerical methods that aid in estimating and finding optimal search plans. In Chapter 4, we present an algorithm that produces a search plan that approximates the minimum expected cost up to any desired accuracy for any probability density distribution. In Chapter 5, for specific distributions, properties of the underlying dynamics are used to numerically find optimal search plans.