Graph partitioning techniques for Markov Decision Processes decomposition.
Régis SabbadinPublished in: ECAI (2002)
Keyphrases
- markov decision processes
- graph partitioning
- partitioning algorithm
- optimal policy
- finite state
- graph model
- image segmentation
- state space
- dynamic programming
- decision theoretic planning
- policy iteration
- transition matrices
- reinforcement learning
- normalized cut
- spectral clustering
- clustering algorithm
- weighted graph
- data clustering
- infinite horizon
- average cost
- real time dynamic programming
- markov decision process
- superpixels
- average reward
- data objects
- natural images
- np hard
- search algorithm