Linear search problem with low sensing on two rays

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2018

Author dc:creator

• West, Argen McAllister

Contributors dc:contributor

• Zharnitsky, Vadim
• DeVille, Lee
• Bronski, Jared
• Rapti, Zoi

• Linear Search Problem, Search Games

Statement dc:rights

• Copyright 2018 Argen West

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/101550

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/101550