Plan aggregation for strong cyclic planning in nondeterministic domains

DOI10.1016/J.ARTINT.2014.07.007MaRDI QIDQ460629zbMATH OpenOpenAlexWikidataFDO

Authors Ron Alford, Ugur Kuter, Dana Nau, Robert P. Goldman

Publication date 13 October 2014

Published in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

automated planningnondeterministic actionsstrong cyclic solutions

Mathematics Subject Classification ID

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

Recommendations

• Weak, strong, and strong cyclic planning via symbolic model checking
• Fast strong planning for fully observable nondeterministic planning problems
• Strong planning under partial observability
• Task decomposition on abstract states, for planning under nondeterminism
• scientific article; zbMATH DE number 1560498

Cites work

• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• scientific article; zbMATH DE number 2243413 (Why is no real title available?)
• Complexity, decidability and undecidability results for domain-independent planning
• LAO*: A heuristic search algorithm that finds solutions with loops
• Planning control rules for reactive agents
• Planning graph heuristics for belief space search
• Planning with Markov decision processes. An AI perspective
• Strong planning under partial observability
• Symbolic model checking: \(10^{20}\) states and beyond
• Task decomposition on abstract states, for planning under nondeterminism
• The FF planning system: Fast plan generation through heuristic search
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(8)

• Strong planning under partial observability
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
• Reasoning about actions with loops via Hoare logic
• Weak, strong, and strong cyclic planning via symbolic model checking
• Task decomposition on abstract states, for planning under nondeterminism
• Algorithms and conditional lower bounds for planning problems
• A planner agent that tries its best in presence of nondeterminism
• Fast strong planning for fully observable nondeterministic planning problems

Describes a project that uses

Uses Software

• UCPOP

This page was built for publication: Plan aggregation for strong cyclic planning in nondeterministic domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460629)