Piecemeal Learning of an Unknown Environment

Betke, Margrit; Rivest, Ronald L.; Singh, Mona

Piecemeal Learning of an Unknown Environment

Name

AIM-1474.pdf

Size

675.38 KB

Format

Adobe PDF

Checksum (MD5)

bca69ec6b7a1f967870f4c7ea48fcd4f

Name

AIM-1474.ps.Z

Size

191.26 KB

Format

Unknown

Checksum (MD5)

7656ee8d71e1d9bba77a62e21eab4057

Author(s)

Betke, Margrit

•

Rivest, Ronald L.

•

Singh, Mona

Date Issued

March 1, 1994

Series/Report no.

AIM-1474

Abstract

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.

Persistent DSpace Link

http://hdl.handle.net/1721.1/6627