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) |
|---|---|
| Pages (from-to) | 231-254 |
| Number of pages | 24 |
| Journal | Machine Learning |
| Volume | 18 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 1995 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence
Keywords
- graph algorithms
- map learning
- robot navigation
Fingerprint
Dive into the research topics of 'Piecemeal Learning of an Unknown Environment'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver