A framework and a mean-field algorithm for the local control of spatial processes
DOI10.1016/J.IJAR.2011.09.007zbMATH Open1242.90284DBLPjournals/ijar/SabbadinPF12OpenAlexW2100514244WikidataQ60558405 ScholiaQ60558405MaRDI QIDQ433494FDOQ433494
Nicklas Forsell, Nathalie Peyrard, Régis Sabbadin
Publication date: 5 July 2012
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2011.09.007
Recommendations
- Solving Markov decision processes by \(d\)-graph algorithms
- Influence of modeling structure in probabilistic sequential decision problems
- scientific article; zbMATH DE number 1929153
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes
- A methodology for computation reduction for specially structured large scale Markov decision problems
approximate linear programmingapproximate policy iterationdecision-theoretic planningfactored Markov decision processesmean-field principle
Cites Work
- Title not available (Why is that?)
- The Linear Programming Approach to Approximate Dynamic Programming
- Title not available (Why is that?)
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Optimal control of diffusion processes with reflection
- Title not available (Why is that?)
- Stochastic dynamic programming with factored representations
- Advanced mean field methods. Theory and practice
- A computational theory of decision networks
- Title not available (Why is that?)
- Management of the risk of wind damage in forestry: a graph-based Markov decision process approach
- Control of spatially structured random processes and random fields with applications.
Cited In (2)
This page was built for publication: A framework and a mean-field algorithm for the local control of spatial processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433494)
