Plan aggregation for strong cyclic planning in nondeterministic domains

DOI10.1016/j.artint.2014.07.007zbMath1405.68319OpenAlexW2128534877WikidataQ60107790 ScholiaQ60107790MaRDI QIDQ460629

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

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)

Related Items (3)

Reasoning about actions with loops via Hoare logic ⋮ Algorithms and conditional lower bounds for planning problems ⋮ Fast strong planning for fully observable nondeterministic planning problems

Uses Software

• UCPOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak, strong, and strong cyclic planning via symbolic model checking
• Task decomposition on abstract states, for planning under nondeterminism
• Symbolic model checking: \(10^{20}\) states and beyond
• Planning control rules for reactive agents
• Complexity, decidability and undecidability results for domain-independent planning
• Strong planning under partial observability
• Planning with Markov Decision Processes: An AI Perspective
• LAO*: A heuristic search algorithm that finds solutions with loops

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