Pages that link to "Item:Q2841739"
From MaRDI portal
The following pages link to Planning with Markov Decision Processes: An AI Perspective (Q2841739):
Displaying 16 items.
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Bottom-up learning of hierarchical models in a class of deterministic pomdp environments (Q747543) (← links)
- Planning in hybrid relational MDPs (Q1699911) (← links)
- Robust topological policy iteration for infinite horizon bounded Markov decision processes (Q1726357) (← links)
- Analyzing generalized planning under nondeterminism (Q2124464) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
- An approximate dynamic programming approach to the admission control of elective patients (Q2668708) (← links)
- Markov Reward Models and Markov Decision Processes in Discrete and Continuous Time: Performance Evaluation and Optimization (Q2937736) (← links)
- An Overview for Markov Decision Processes in Queues and Networks (Q3305576) (← links)
- Influence of modeling structure in probabilistic sequential decision problems (Q3411302) (← links)
- A Comprehensive Framework for Learning Declarative Action Models (Q5094057) (← links)
- A Markov decision model with dead ends for operating room planning considering dynamic patient priority (Q5214333) (← links)
- (Q5850827) (← links)
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies (Q6098853) (← links)
- GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory (Q6098857) (← links)
