Piecemeal Learning of an Unknown Environment

Margrit Betke, Ronald L. Rivest, Mona Singh

Research output: Contribution to journalArticle

66 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)231-254
Number of pages24
JournalMachine Learning
Volume18
Issue number2
DOIs
StatePublished - Feb 1995

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Keywords

  • graph algorithms
  • map learning
  • robot navigation

Cite this