Piecemeal learning of an unknown environment

摘要

We introduce a new learning problem: learning a graph bypiecemeal 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 learningcity-block graphs: grid graphs with rectangular obstacles.