Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
SPUDD: stochastic planning using decision diagrams
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Improving adjustable autonomy strategies for time-critical domains
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
From Coordination to Stochastic Models of QoS
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Planning and verification for stochastic processes with asynchronous events
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Probabilistic temporal planning with uncertain durations
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning and execution with phase transitions
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Planning for human-robot interaction using time-state aggregated POMDPs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
A fast analytical algorithm for solving Markov decision processes with real-valued resources
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning with continuous resources in stochastic domains
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Deliberation scheduling using GSMDPs in stochastic asynchronous domains
International Journal of Approximate Reasoning
Strengthening schedules through uncertainty analysis
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
Science of Computer Programming
| Hi-index | 0.00 |
We introduce the generalized semi-Markov decision process (GSMDP) as an extension of continuous-time MDPs and semi-Markov decision processes (SMDPs) for modeling stochastic decision processes with asynchronous events and actions. Using phase-type distributions and uniformization, we show how an arbitrary GSMDP can be approximated by a discrete-time MDP, which can then be solved using existing MDP techniques. The techniques we present can also be seen as an alternative approach for solving SMDPs, and we demonstrate that the introduction of phases allows us to generate higher quality policies than those obtained by standard SMDP solution techniques.