Piecemeal Learning of an Unknown Environment

  • Authors:

  • Margrit Betke;Ronald L. Rivest;Mona Singh

  • Affiliations:

  • Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139. margrit@theory.lcs.mit.edu;Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139. rivest@theory.lcs.mit.edu;Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139. mona@theory.lcs.mit.edu

  • Venue:
  • Machine Learning - Special issue on COLT '93
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.