Piecemeal learning of an unknown environment

Margrit Betke, Ronald L. Rivest, Mona Singh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 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)
Title of host publicationProceedings of the 6th annual conference on Computational learning theory, COLT 1993
PublisherPubl by ACM
Pages277-286
Number of pages10
ISBN (Print)0897916115, 9780897916110
DOIs
StatePublished - 1993
Externally publishedYes
EventProceedings of the 6th Annual ACM Conference on Computational Learning Theory - Santa Cruz, CA, USA
Duration: Jul 26 1993Jul 28 1993

Publication series

NameProceedings of the 6th annual conference on Computational learning theory, COLT 1993

Conference

ConferenceProceedings of the 6th Annual ACM Conference on Computational Learning Theory
CitySanta Cruz, CA, USA
Period7/26/937/28/93

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

Dive into the research topics of 'Piecemeal learning of an unknown environment'. Together they form a unique fingerprint.

Cite this