Task decomposition on abstract states, for planning under nondeterminism

DOI10.1016/j.artint.2008.11.012zbMath1191.68636OpenAlexW2072963858MaRDI QIDQ835827

Ugur Kuter, Dana Nau, Marco Pistore, Paolo Traverso

Publication date: 31 August 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.012

zbMATH Keywords

binary decision diagramshierarchical task-network planningplanning in nondeterministic domains

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Plan aggregation for strong cyclic planning in nondeterministic domains ⋮ Phase transitions of contingent planning problem ⋮ Learning hierarchical task network domains from partially observed plan traces ⋮ Fast strong planning for fully observable nondeterministic planning problems ⋮ PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS

Uses Software

• Graphplan
• SHOP2
• UCPOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak, strong, and strong cyclic planning via symbolic model checking
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Complexity results for HTN planning
• Planning control rules for reactive agents
• Fast planning through planning graph analysis
• TALplanner: A temporal logic based forward chaining planner
• Using temporal logics to express search control knowledge for planning
• Conformant planning via heuristic forward search: A new approach
• Strong planning under partial observability

This page was built for publication: Task decomposition on abstract states, for planning under nondeterminism