A formalism for stochastic decision processes with asynchronous events

AAAI Workshop - Technical Report

Volumn WS-04-08, Issue , 2004, Pages 107-110

  Younes, Håkan L S ^a   Simmons, Reid G ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS SEQUENTIAL LOGIC; DECISION MAKING; MARKOV PROCESSES; MATHEMATICAL MODELS;

ASYNCHRONOUS MODELS; SEMI-MARKOV DECISION PROCESS;

RANDOM PROCESSES;

EID: 24944436905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Alur, R.; Courcoubetis, C.; and Dill, D. 1993. Model-checking in dense real-time. Information and Computation 104(1):2-34.
2. Bobbio, A.; Horváth, A.; Scrapa, M.; and Telek, M. 2003. Acyclic discrete phase type distributions: Properties and a parameter estimation algorithm. Performance Evaluation 54(1):1-32.
3. Cantaluppi, L. 1984. Optimality of piecewise-constant policies in semi-Markov decision chains. SIAM Journal on Control and Optimization 22(5):723-739.
4. Chitgopekar, S. S. 1969. Continuous time Markovian sequential control processes. SIAM Journal on Control 7(3):367-389.
5. Dirac, P. A. M. 1927. The physical interpretation of the quantum dynamics. Proceedings of the Royal Society of London. Series A 113(765):621-641.
6. Glynn, P. W. 1989. A GSMP formalism for discrete event systems. Proceedings of the IEEE 77(1):14-23.
7. Gordon, G. J. 1995. Stable function approximation in dynamic programming. In Proc. Twelfth International Conference on Machine Learning, 261-268. Morgan Kaufmann Publishers.
8. Guestrin, C.; Koller, D.; and Parr, R. 2002. Multiagent planning with factored MDPs. In Advances in Neural Information Processing Systems 14: Proc. 2001 Conference. Cambridge, MA: The MIT Press. 1523-1530.
9. Howard, R. A. 1960. Dynamic Programming and Markov Processes. New York, NY: John Wiley & Sons.
10. Howard, R. A. 1971. Dynamic Probabilistic Systems, volume II. New York, NY: John Wiley & Sons.
11. Matthes, K. 1962. Zur Theorie der Bedienungsprozesse. In Trans. Third Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, 513-528. Publishing House of the Czechoslovak Academy of Sciences.
12. Mausam, and Weld, D. S. 2004. Solving concurrent Markov decision processes. In Proc. Nineteenth National Conference on Artificial Intelligence. AAAI Press.
13. Neuts, M. F. 1975. Probability distributions of phase type. In Liber Amicorum Professor emeritus dr. H. Florin. Leuven, Belgium: Katholieke Universiteit Leuven. 173-206.
14. Neuts, M. F. 1981. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Baltimore, MD: Johns Hopkins University Press.
15. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York, NY: John Wiley & Sons.
16. Rohanimanesh, K., and Mahadevan, S. 2001. Decision-theoretic planning with concurrent temporally extended actions. In Proc. Seventeenth Conference on Uncertainty in Artificial Intelligence, 472-479. Morgan Kaufmann Publishers.
17. Shedler, G. S. 1993. Regenerative Stochastic Simulation. Boston, MA: Academic Press.
18. Stone, L. D. 1973. Necessary and sufficient conditions for optimal control of semi-Markov jump processes. SIAM Journal on Control 11(2):187-201.
19. Younes, H. L. S., and Simmons, R. G. 2004. Solving generalized semi-markov decision processes using continuous phase-type distributions. In Proc. Nineteenth National Conference on Artificial Intelligence. AAAI Press.