Back to Results
First PageMeta Content
Randomness / Complexity classes / Probabilistic complexity theory / Quantum complexity theory / Automated planning and scheduling / Algorithm / Planning Domain Definition Language / Monte Carlo method / SL / Theoretical computer science / Computational complexity theory / Applied mathematics


RFF: A Robust, FF-Based MDP Planning Algorithm for Generating Policies with Low Probability of Failure Florent Teichteil-K¨onigsbuch and Guillaume Infantes Ugur Kuter
Add to Reading List

Document Date: 2008-09-15 10:48:04

Open Document

File Size: 132,83 KB

Share Result on Facebook

Company

John Wiley & Sons INC. / BP / /

Currency

pence / /

Facility

France University of Maryland Department / /

IndustryTerm

reactive online planning algorithm / heuristic search / near-optimal solutions / conformant solutions / /

Organization

Artificial Copyright Intelligence / University of Maryland Department of Computer Science College Park / Association for the Advancement / National Science Foundation / /

Person

Guillaume Infantes Ugur Kuter / /

Position

probabilistic planner / classical planner / planner / RFF planner / /

ProgrammingLanguage

D / /

ProvinceOrState

Maryland / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

LAN / MDP planning algorithm / replanning algorithm / simulation / artificial intelligence / graph G. Algorithm / reactive online planning algorithm / /

URL

www.aaai.org / /

SocialTag