The following pages link to (Q3624110):
Displaying 10 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- Deliberation scheduling using GSMDPs in stochastic asynchronous domains (Q962948) (← links)
- Permissive planning: Extending classical planning to uncertain task domains. (Q1399128) (← links)
- Strong temporal planning with uncontrollable durations (Q1748463) (← links)
- A correctness result for synthesizing plans with loops in stochastic domains (Q2300450) (← links)
- Modeling and Planning with Macro-Actions in Decentralized POMDPs (Q5376629) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898774) (← links)
- Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions (Q6080639) (← links)