PIECEMEAL LEARNING OF AN UNKNOWN ENVIRONMENT

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