Show simple item record

dc.contributor.authorSteinkraus, Kurt
dc.contributor.authorKaelbling, Leslie Pack
dc.date.accessioned2005-12-22T01:41:41Z
dc.date.available2005-12-22T01:41:41Z
dc.date.issued2004-10-21
dc.identifier.otherMIT-CSAIL-TR-2004-065
dc.identifier.otherAIM-2004-023
dc.identifier.urihttp://hdl.handle.net/1721.1/30496
dc.description.abstractOne of the reasons that it is difficult to plan and act in real-worlddomains is that they are very large. Existing research generallydeals with the large domain size using a static representation andexploiting a single type of domain structure. In this paper, wecreate a framework that encapsulates existing and new abstraction andapproximation methods into modules, and combines arbitrary modulesinto a system that allows for dynamic representation changes. We showthat the dynamic changes of representation allow our framework tosolve larger and more interesting domains than were previouslypossible, and while there are no optimality guarantees, suitablemodule choices gain tractability at little cost to optimality.
dc.format.extent12 p.
dc.format.extent9975204 bytes
dc.format.extent424481 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subjectAI
dc.titleCombining dynamic abstractions in large MDPs


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record