@InProceedings{BRS93,
  author = 	 { Margrit Betke and Ronald L. Rivest and Mona Singh },
  title = 	 { Piecemeal learning of an unknown environment },
  pages = 	 { 277--286 },
  doi =          { 10.1145/168304.168352 },                  
  acmid =        { 168352 },                  
  acm =          { 78895 },
  booktitle =    { Proceedings of the Sixth Annual Conference on Computational Learning Theory },
  publisher =    { ACM },
  editor = 	 { Lenny Pitt },
  isbn =         { 0-89791-611-5 },
  date =         { 1993-07 },                  
  OPTyear = 	 { 1993 },
  OPTmonth = 	 { July 26--28, },
  eventtitle =   { COLT'93 },
  eventdate =    { 1993-07-26/1993-07-28 },
  venue =        { Santa Cruz, California },                  
  abstract =     {
        We introduce a new learning problem: learning a graph by
        \emph{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 \emph{city-block graphs}: grid graphs with
        rectangular obstacles.                  
                 },
}