@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",
note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; Proceedings of the 6th Annual ACM Conference on Computational Learning Theory ; Conference date: 26-07-1993 Through 28-07-1993",
year = "1993",
doi = "10.1145/168304.168352",
language = "English (US)",
isbn = "0897916115",
series = "Proceedings of the 6th annual conference on Computational learning theory, COLT 1993",
publisher = "Publ by ACM",
pages = "277--286",
booktitle = "Proceedings of the 6th annual conference on Computational learning theory, COLT 1993",
}