Back to Results
First PageMeta Content
Planning / Dana S. Nau / Planner / STRIPS / Artificial intelligence / Automated planning and scheduling / Hierarchical task network


Conditionalization: Adapting Forward-Chaining Planners to Partially Observable Environments Ugur Kuter Dana Nau
Add to Reading List

Document Date: 2009-08-06 12:04:58


Open Document

File Size: 223,29 KB

Share Result on Facebook

City

Seattle / Minneapolis / /

Company

Goldman / Intel / AAAI Press / Robert Goldman Smart Information Flow Technologies / /

Country

United States / /

/

Facility

College Park / Systems Research University of Maryland / /

IndustryTerm

task network / polynomial-time search / search control knowledge / breadth-first search / search-control formula / explore search space / partial-observable planning algorithms / exponential-time search / search space / forward-chaining planning algorithm / /

OperatingSystem

Unix / Linux Fedora / /

Organization

Partially Observable Environments Ugur Kuter Dana Nau Elnatan Reisner Department of Computer Science / National Science Foundation / Mathematics and Articial Intelligence / University of Maryland / College Park / /

Person

Morgan Kaufmann / Fedora Core / Dana Nau Elnatan Reisner / /

Position

pure planner / forward chaining planner / second conditional POCL planner / abstract forward-chaining classical planner / planner for nondeterministic environments / puccini planner / HTN planner / conditional planner / planner / model based planner / early conditional planner / /

Product

Unix / /

ProvinceOrState

Minnesota / /

PublishedMedium

Annals of Mathematics / Journal of Artificial Intelligence Research / /

Technology

virtual machine / well known Graphplan algorithm / partial-observable planning algorithms / artificial intelligence / Unix / Linux / planning algorithm / laptop computer / planning algorithms / forward-chaining planning algorithm / /

SocialTag