Piecemeal learning of an unknown environment

Margrit Betke; Ronald L. Rivest; Mona Singh

doi:10.1145/168304.168352

Piecemeal learning of an unknown environment

Margrit Betke, Ronald L. Rivest, Mona Singh

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proc 6 Annu ACM Conf Comput Learn Theory
Publisher	Publ by ACM
Pages	277-286
Number of pages	10
ISBN (Print)	0897916115, 9780897916110
DOIs	https://doi.org/10.1145/168304.168352
State	Published - 1993
Externally published	Yes
Event	Proceedings of the 6th Annual ACM Conference on Computational Learning Theory - Santa Cruz, CA, USA Duration: Jul 26 1993 → Jul 28 1993

Publication series

Name	Proc 6 Annu ACM Conf Comput Learn Theory

Other

Other	Proceedings of the 6th Annual ACM Conference on Computational Learning Theory
City	Santa Cruz, CA, USA
Period	7/26/93 → 7/28/93

All Science Journal Classification (ASJC) codes

General Engineering

Access to Document

10.1145/168304.168352

Cite this

@inproceedings{698371da51a44a41b3c94a9e9956264a,

title = "Piecemeal learning of an unknown environment",

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.",

author = "Margrit Betke and Rivest, {Ronald L.} and Mona Singh",

year = "1993",

doi = "10.1145/168304.168352",

language = "English (US)",

isbn = "0897916115",

series = "Proc 6 Annu ACM Conf Comput Learn Theory",

publisher = "Publ by ACM",

pages = "277--286",

booktitle = "Proc 6 Annu ACM Conf Comput Learn Theory",

}

TY - GEN

T1 - Piecemeal learning of an unknown environment

AU - Betke, Margrit

AU - Rivest, Ronald L.

AU - Singh, Mona

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027794763&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027794763&partnerID=8YFLogxK

U2 - 10.1145/168304.168352

DO - 10.1145/168304.168352

M3 - Conference contribution

AN - SCOPUS:0027794763

SN - 0897916115

SN - 9780897916110

T3 - Proc 6 Annu ACM Conf Comput Learn Theory

SP - 277

EP - 286

BT - Proc 6 Annu ACM Conf Comput Learn Theory

PB - Publ by ACM

T2 - Proceedings of the 6th Annual ACM Conference on Computational Learning Theory

Y2 - 26 July 1993 through 28 July 1993

ER -

Piecemeal learning of an unknown environment

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this