Piecemeal Learning of an Unknown Environment

We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two linear-timepiecemeal-searchalgorithms for learning city-block graphs: grid graphs with rectangular obstacles.

• Type: Conference
• Year: 1993
• Where: COLT
• Authors: Margrit Betke, Ronald L. Rivest, Mona Singh
• Keywords: COLT 1993, Learninga Graph, Machine Learning, Piecemeal Search, Starting Point