scientific article; zbMATH DE number 2000828
From MaRDI portal
Publication:4434179
zbMath1026.68125MaRDI QIDQ4434179
No author found.
Publication date: 4 November 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Practical solution techniques for first-order MDPs ⋮ Scalable Reinforcement Learning for Multiagent Networked Systems ⋮ Approximate linear programming for networks: average cost bounds ⋮ Scalable Online Planning for Multi-Agent MDPs ⋮ Open problems in universal induction \& intelligence ⋮ Symmetric approximate linear programming for factored MDPs with application to constrained problems ⋮ Exact decomposition approaches for Markov decision processes: a survey ⋮ Efficient approximate linear programming for factored MDPs ⋮ Modeling and optimization of decision-making process during loading and unloading operations at container port ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ From Reinforcement Learning to Deep Reinforcement Learning: An Overview ⋮ Decision-theoretic planning with generalized first-order decision diagrams ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ A framework and a mean-field algorithm for the local control of spatial processes ⋮ Efficient solutions to factored MDPs with imprecise transition probabilities ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ Embedding a state space model into a Markov decision process ⋮ Algorithms and conditional lower bounds for planning problems ⋮ Discovering hidden structure in factored MDPs ⋮ Uncertain convex programs: randomized solutions and confidence levels ⋮ Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path ⋮ Efficient algorithms for risk-sensitive Markov decision processes with limited budget ⋮ A Continuous-Time Markov Decision Process for Infrastructure Surveillance ⋮ Influence of modeling structure in probabilistic sequential decision problems ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ Solving factored MDPs using non-homogeneous partitions
This page was built for publication:
