Pages that link to "Item:Q460629"
From MaRDI portal
The following pages link to Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629):
Displaying 8 items.
- Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- A planner agent that tries its best in presence of nondeterminism (Q1948282) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
- Strong planning under partial observability (Q2457630) (← links)