PIECEMEAL LEARNING OF AN UNKNOWN ENVIRONMENT

被引：62

作者：

BETKE, M

RIVEST, RL

SINGH, M

机构：

来源：

MACHINE LEARNING | 1995年 / 18卷 / 2-3期

关键词：

MAP LEARNING; GRAPH ALGORITHMS; ROBOT NAVIGATION;

D O I：

10.1007/BF00993411

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We introduce a new learning problem: learning a graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two linear-time piecemeal-search algorithms for learning city-block graphs: grid graphs with rectangular obstacles.

引用

页码：231 / 254

页数：24

共 12 条

[1]

DENG XT, 1990, ANN IEEE SYMP FOUND, P355

[2]

Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113

[3] SHORTEST PATHS WITHOUT A MAP [J].

PAPADIMITRIOU, CH ;

YANNAKAKIS, M .

THEORETICAL COMPUTER SCIENCE, 1991, 84 (01) :127-150

[4] COMPLEXITY OF EDGE TRAVERSING [J].

PAPADIMITRIOU, CH .

JOURNAL OF THE ACM, 1976, 23 (03) :544-554

[5]

Stein C, 2001, INTRO ALGORITHMS 2 V, Vsecond

[6]

[No title captured]

[7]

[No title captured]

[8]

[No title captured]

[9]

[No title captured]

[10]

[No title captured]

← 1 2 →