DYNAMIC-PROGRAMMING AND THE BACKPACKERS LINEAR SEARCH PROBLEM

被引：3

作者：

WASHBURN, A ^{[1
]}

机构：

[1] USN,POSTGRAD SCH,DEPT OPERAT RES,MONTEREY,CA 93943

来源：

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 1995年 / 60卷 / 03期

关键词：

SEARCH; DYNAMIC PROGRAMMING;

D O I：

10.1016/0377-0427(94)00038-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：357 / 365

页数：9

共 8 条

[1] THE GENERALIZED LINEAR SEARCH PROBLEM, EXISTENCE OF OPTIMAL SEARCH PATHS [J].