Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Tree based discretization for continuous state space reinforcement learning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Stochastic dynamic programming with factored representations
Artificial Intelligence
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Variable Resolution Discretization in Optimal Control
Machine Learning
Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
Model minimization in Markov decision processes
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
SPUDD: stochastic planning using decision diagrams
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Planning under continuous time and resource uncertainty: a challenge for AI
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Planning with continuous resources for agent teams
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Planning and execution with phase transitions
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Lazy approximation for solving continuous finite-horizon MDPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Towards faster planning with continuous resources in stochastic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Solving factored MDPs with hybrid state and action variables
Journal of Artificial Intelligence Research
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
A heuristic search approach to planning with continuous resources in stochastic domains
Journal of Artificial Intelligence Research
Planning with continuous resources in stochastic domains
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An MCMC approach to solving hybrid factored MDPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Intensional dynamic programming. A Rosetta stone for structured dynamic programming
Journal of Algorithms
Information-lookahead planning for AUV mapping
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Probabilistic optimization and assessment of voting strategies for X-by-wire systems
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Planning in stochastic domains for multiple agents with individual continuous resource state-spaces
Autonomous Agents and Multi-Agent Systems
Solving hybrid markov decision processes
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Probabilistic planning for continuous dynamic systems under bounded risk
Journal of Artificial Intelligence Research
Robust optimization for hybrid MDPs with state-dependent noise
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.