University of Illinois Urbana-Champaign

Linear search problem with low sensing on two rays

West, Argen McAllister

Content Files
WEST-DISSERTATION-2018.pdf

Permalink

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

Description

Title
Linear search problem with low sensing on two rays
Author(s)
West, Argen McAllister
Issue Date
2018-07-10
Director of Research (if dissertation) or Advisor (if thesis)
Zharnitsky, Vadim
Doctoral Committee Chair(s)
DeVille, Lee
Committee Member(s)
  • Bronski, Jared
  • Rapti, Zoi
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Date of Ingest
2018-09-27T16:17:45Z
Keyword(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.
Graduation Semester
2018-08
Type of Resource
text
Permalink
http://hdl.handle.net/2142/101550
Copyright and License Information
Copyright 2018 Argen West

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Mathematics