Files in this item



application/pdfWEST-DISSERTATION-2018.pdf (962kB)
(no description provided)PDF


Title:Linear search problem with low sensing on two rays
Author(s):West, Argen McAllister
Director of Research:Zharnitsky, Vadim
Doctoral Committee Chair(s):DeVille, Lee
Doctoral Committee Member(s):Bronski, Jared; Rapti, Zoi
Department / Program:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Linear Search Problem, Search Games
Abstract: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.
Issue Date:2018-07-10
Rights Information:Copyright 2018 Argen West
Date Available in IDEALS:2018-09-27
Date Deposited:2018-08

This item appears in the following Collection(s)

Item Statistics