nondeterministic domains

35

AIPS
2006

88views Artificial Intelligence» more AIPS 2006»

14 years 28 days ago

Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...

Alexandre Albore, Piergiorgio Bertoli

claim paper

Read More »

35

click to vote

AAAI
2006

136views Intelligent Agents» more AAAI 2006»

Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond

14 years 28 days ago

Download www.cs.umd.edu

Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...

Ugur Kuter, Dana S. Nau

claim paper

Read More »

49

click to vote

AAAI
2004

161views Intelligent Agents» more AAAI 2004»

Forward-Chaining Planning in Nondeterministic Domains

14 years 28 days ago

Download www.cs.umd.edu

In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...

Ugur Kuter, Dana S. Nau

claim paper

Read More »

30

click to vote

AAAI
2008

132views Intelligent Agents» more AAAI 2008»

Fusing Procedural and Declarative Planning Goals for Nondeterministic Domains

14 years 1 months ago

Download www.aaai.org

While in most planning approaches goals and plans are different objects, it is often useful to specify goals that combine declarative conditions with procedural plans. In this pap...

Dmitry Shaparau, Marco Pistore, Paolo Traverso

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers