Dynamic Programming and the Backpacker's Linear Search Problem

Abstract

A backpacker approaches a road with a marker on it desirous of finding the marker but having only a rough idea of where it is located. It is well known among backpackers that it is best to aim either right or left of the marker since otherwise it will not be clear which way to turn upon reaching the road. The problem of deciding exactly where to aim can be formalized as a modification of the Linear Search Problem. This paper does so, and also discusses dynamic programming as a solution method.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1995
Accession Number
ADA487452

Entities

People

  • Alan R. Washburn

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Backpacks
  • Computations
  • Computer Programming
  • Dynamic Programming
  • Equations
  • Intervals
  • Mathematics
  • Normal Distribution
  • Operations Research
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design
  • Vision Science/Vision Psychology/Cognitive Neuroscience.