Piecemeal Learning of an Unknown Environment
| dc.date.accessioned | 2004-10-08T20:35:47Z | |
| dc.date.accessioned | 2018-11-24T10:16:48Z | |
| dc.date.available | 2004-10-08T20:35:47Z | |
| dc.date.available | 2018-11-24T10:16:48Z | |
| dc.date.issued | 1994-03-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6627 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6627 | |
| dc.description.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. | en_US |
| dc.format.extent | 195855 bytes | |
| dc.format.extent | 691585 bytes | |
| dc.language.iso | en_US | |
| dc.title | Piecemeal Learning of an Unknown Environment | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-1474.pdf | 691.5Kb | application/pdf | View/ |
| AIM-1474.ps.Z | 195.8Kb | application/octet-stream | View/ |