Show simple item record

Adaptive Envelope MDPs for Relational Equivalence-based Planning

dc.date.accessioned2008-08-01T21:30:16Z
dc.date.accessioned2018-11-26T22:25:24Z
dc.date.available2008-08-01T21:30:16Z
dc.date.available2018-11-26T22:25:24Z
dc.date.issued2008-07-29en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/41920
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/41920
dc.description.abstractWe describe a method to use structured representations of the environmentâ s dynamics to constrain and speed up the planning process. Given a problem domain described in a probabilistic logical description language, we develop an anytime technique that incrementally improves on an initial, partial policy. This partial solution is found by ï¬ rst reducing the number of predicates needed to represent a relaxed version of the problem to a minimum, and then dynamically partitioning the action space into a set of equivalence classes with respect to this minimal representation. Our approach uses the envelope MDP framework, which creates a Markov decision process out of a subset of the full state space as de- termined by the initial partial solution. This strategy permits an agent to begin acting within a restricted part of the full state space and to expand its envelope judiciously as resources permit.en_US
dc.format.extent17 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.titleAdaptive Envelope MDPs for Relational Equivalence-based Planningen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2008-050.pdf711.7Kbapplication/pdfView/Open
MIT-CSAIL-TR-2008-050.ps73.87Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record