Piecemeal Learning of an Unknown Environment

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.

Bibliografiska uppgifter
Huvudupphovsmän: Betke, Margrit, Rivest, Ronald L., Singh, Mona
Språk:en_US
Publicerad: 2004
Länkar:http://hdl.handle.net/1721.1/6627