Piecemeal learning of an unknown environment
Margrit Betke, Ronald L. Rivest, Mona Singh · 1993
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.