Clustering fully and partially observable graphs via nonconvex optimization.
Dimitrios KatselisCarolyn L. BeckPublished in: ACC (2016)
Keyphrases
- partially observable
- optimization problems
- decision problems
- dynamical systems
- markov decision processes
- state space
- reinforcement learning
- k means
- partial observability
- markov decision problems
- partially observable domains
- partially observable environments
- partial observations
- belief state
- evolutionary algorithm
- infinite horizon
- action models
- planning domains
- graph mining
- orders of magnitude
- domain specific