SEARCHING IN THE PLANE

被引：250

作者：

BAEZAYATES, RA

CULBERSON, JC

RAWLINS, GJE

机构：

[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2H1,AB,CANADA

[2] INDIANA UNIV,DEPT COMP SCI,BLOOMINGTON,IN 47405

来源：

INFORMATION AND COMPUTATION | 1993年 / 106卷 / 02期

关键词：

D O I：

10.1006/inco.1993.1054

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we initiate a new area of study dealing with the best way to search a possibly unbounded region for an object. The model for our search algorithms is that we must pay costs proportional to the distance of the next probe position relative to our current position. This model is meant to give a realistic cost measure for a robot moving in the plane. We also examine the effect of decreasing the amount of a priori information given to search problems. Problems of this type are very simple analogues of non-trivial problems on searching an unbounded region, processing digitized images, and robot navigation. We show that for some simple search problems, knowing the general direction of the goal is much more informative than knowing the distance to the goal. © 1993 Academic Press. All rights reserved.

引用

页码：234 / 252

页数：19

共 19 条

[11] Gluss B., 1961, NAV RES LOGIST Q, V8, P117
[12] GLUSS B, 1961, NAVAL RES LOGIST Q, V8, P357
[13] Isbell J.R., 1957, NAVAL RES LOGIST Q, V4, P357
[14] Joris H., 1980, ELEM MATH, V35, P1
[15] Karp R. M., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P19, DOI 10.1109/SFCS.1986.34
[16] MELZAK ZA, 1973, COMPANION CONCRETE M, P153
[17] OGLIVY CS, 1962, TOMORROWS MATH UNSOL, P23
[18] Papadimitriou C.H., 1989, LECT NOTES COMPUTER, V372, P610
[19] COPING WITH ERRORS IN BINARY SEARCH PROCEDURES
RIVEST, RL
MEYER, AR
KLEITMAN, DJ
WINKLMANN, K
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (03) : 396 - 404

← 1 2 →