Piecemeal Learning of an Unknown Environment

Margrit Betke; Ronald L. Rivest; Mona Singh

doi:10.1023/A:1022803514157

Piecemeal Learning of an Unknown Environment

Margrit Betke, Ronald L. Rivest, Mona Singh

Research output: Contribution to journal › Article › peer-review

71 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	231-254
Number of pages	24
Journal	Machine Learning
Volume	18
Issue number	2
DOIs	https://doi.org/10.1023/A:1022803514157
State	Published - Feb 1995

All Science Journal Classification (ASJC) codes

Software
Artificial Intelligence

Keywords

graph algorithms
map learning
robot navigation

Access to Document

10.1023/A:1022803514157

Cite this

@article{484755d529ba4437af7f4f2a063f56a3,

title = "Piecemeal Learning of an Unknown Environment",

abstract = "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.",

keywords = "graph algorithms, map learning, robot navigation",

author = "Margrit Betke and Rivest, {Ronald L.} and Mona Singh",

year = "1995",

month = feb,

doi = "10.1023/A:1022803514157",

language = "English (US)",

volume = "18",

pages = "231--254",

journal = "Machine Learning",

issn = "0885-6125",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Piecemeal Learning of an Unknown Environment

AU - Betke, Margrit

AU - Rivest, Ronald L.

AU - Singh, Mona

PY - 1995/2

Y1 - 1995/2

N2 - 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.

AB - 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.

KW - graph algorithms

KW - map learning

KW - robot navigation

UR - http://www.scopus.com/inward/record.url?scp=0029256026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029256026&partnerID=8YFLogxK

U2 - 10.1023/A:1022803514157

DO - 10.1023/A:1022803514157

M3 - Article

AN - SCOPUS:0029256026

SN - 0885-6125

VL - 18

SP - 231

EP - 254

JO - Machine Learning

JF - Machine Learning

IS - 2

ER -

Piecemeal Learning of an Unknown Environment

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this