Planning with Markov decision processes. An AI perspective
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5658801
- Simulation-based algorithms for Markov decision processes.
- scientific article; zbMATH DE number 1315585
- The logic of adaptive behavior. Knowledge representation and algorithms for adaptive sequential decision making under uncertainty in first-order and relational domains.
- A Concise Introduction to Models and Methods for Automated Planning
Cited in
(24)- Planning in hybrid relational MDPs
- Robust topological policy iteration for infinite horizon bounded Markov decision processes
- Analyzing generalized planning under nondeterminism
- The stochastic shortest path problem: a polyhedral combinatorics perspective
- Deliberative acting, planning and learning with hierarchical operational models
- An approximate dynamic programming approach to the admission control of elective patients
- Markov reward models and Markov decision processes in discrete and continuous time: performance evaluation and optimization
- An overview for Markov decision processes in queues and networks
- A synthesis of automated planning and reinforcement learning for efficient, robust decision-making
- Influence of modeling structure in probabilistic sequential decision problems
- Markov decision processes in artificial intelligence. Vol. 2. Advanced methods and applications.
- Markov decision processes in artificial intelligence. Vol. 1. General principles and applications
- The logic of adaptive behavior. Knowledge representation and algorithms for adaptive sequential decision making under uncertainty in first-order and relational domains.
- Plan aggregation for strong cyclic planning in nondeterministic domains
- A Comprehensive Framework for Learning Declarative Action Models
- A Markov decision model with dead ends for operating room planning considering dynamic patient priority
- scientific article; zbMATH DE number 5658801 (Why is no real title available?)
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- On the efficiency of algebraic simplex algorithms for solving MDPs
- Efficient constraint generation for stochastic shortest path problems
- An offline risk-aware policy selection method for Bayesian Markov decision processes
- Bottom-up learning of hierarchical models in a class of deterministic pomdp environments
This page was built for publication: Planning with Markov decision processes. An AI perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841739)
