Piecemeal Learning of an Unknown Environment,

Abstract

We introduce a new learning problem: leaning 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. (AN)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1994
Accession Number
ADA291683

Entities

People

  • Margrit Betke
  • Mona Singh
  • Ronald L. Rivest

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Sensors

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Autonomous Navigation
  • Boundaries
  • Cognitive Science
  • Environment
  • Grids
  • Information Operations
  • Information Systems
  • Learning
  • Mathematics
  • Relocation
  • Robot Navigation
  • Robots
  • Standards
  • Trees (Data Structures)
  • Wavefronts

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • STEM Education