Back to Results
First PageMeta Content
Computing / Markov processes / Markov models / Equations / Mathematical optimization / Markov decision process / Reinforcement learning / Automated planning and scheduling / Bellman equation / Statistics / Dynamic programming / Control theory


Toward Hierachical Decomposition for Planning in Uncertain Environments Terran Lane and Leslie Pack Kaelbling MIT Artificial Intelligence Laboratory Cambridge, MA, 02139 USA terran,lpk @ai.mit.edu
Add to Reading List

Document Date: 2004-07-01 07:47:51

Open Document

File Size: 94,81 KB

Share Result on Facebook

City

Belmont / Springer Verlag / New York / Cambridge / Stockholm / /

Company

C. Boutilier L. P. / A. W. Moore L. C. / MIT Press / AAAI Press / The star / John Wiley & Sons / /

Country

Sweden / /

/

Facility

University of Massachusetts / Leslie Pack Kaelbling MIT Artificial Intelligence Laboratory / /

IndustryTerm

max-flow/min-cut algorithm / decomposition algorithms / /

Organization

University of Massachusetts / Amherst / Department of Computer Science / MIT / /

Person

Leslie Pack Kaelbling / Morgan Kaufmann / /

Position

Dean / and S. Hanks / Dean / editor / /

ProgrammingLanguage

D / /

ProvinceOrState

New York / Massachusetts / /

PublishedMedium

Journal of Artificial Intelligence Research / Machine Learning / /

Technology

planning algorithm / decomposition algorithms / caching / Machine Learning / max-flow/min-cut algorithm / artificial intelligence / /

SocialTag