Policy generation for continuous-time stochastic domains with concurrency

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 325-333

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

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; FAILURE ANALYSIS; MARKOV PROCESSES; PLANNING; PROBABILITY; RANDOM PROCESSES; WEIBULL DISTRIBUTION;

CONTINUOUS STOCHASTIC LOGIC (CSL); SEMI-MARKOV DECISION PROCESS (SMDP); STOCHASTIC DOMAINS;

CONCURRENT ENGINEERING;

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

References (27)

1. Aziz, A.; Sanwal, K.; Singhal, V.; and Brayton, R. 2000. Model-checking continuous-time Markov chains. ACM Transactions on Computational Logic 1(1):162-170.
2. Baier, C.; Haverkort, B. R.; Hermanns, H.; and Katoen, J.-P. 2003. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering 29(6):524-541.
3. Blythe, J. 1994. Planning with external events. In Proc. Tenth Conference on Uncertainty in Artificial Intelligence, 94-101. Morgan Kaufmann Publishers.
4. Bonet, B.; Loerincs, G.; and Geffner, H. 1997. A robust and fast action selection mechanism for planning. In Proc. Fourteenth National Conference on Artificial Intelligence, 714-719. AAAI Press.
5. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proc. Fourteenth International Joint Conference on Artificial Intelligence, 1104-1111. Morgan Kaufmann Publishers.
6. Boyan, J. A., and Littman, M. L. 2001. Exact solutions to time-dependent MDPs. In Advances in Neural Information Processing Systems 13: Proc. 2000 Conference. Cambridge, MA: The MIT Press. 1026-1032.
7. Bresina, J.; Dearden, R.; Meuleau, N.; Ramakrishnan, S.; Smith, D. E.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In Proc. Eighteenth Conference on Uncertainty in Artificial Intelligence, 77-84. Morgan Kaufmann Publishers.
8. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
9. Drummond, M., and Bresina, J. 1990. Anytime synthetic projection: Maximizing the probability of goal satisfaction. In Proc. Eighth National Conference on Artificial Intelligence, 138-144. AAAI Press.
10. Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20. Forthcoming.
11. Glynn, P. W. 1989. A GSMP formalism for discrete event systems. Proceedings of the IEEE 77(1):14-23.
12. 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.
13. Ha, V., and Musliner, D. J. 2002. Toward decision-theoretic CIRCA with application to real-time computer security control. In Papers from the AAAI Workshop on Real-Time Decision Support and Diagnosis Systems, 89-90. AAAI Press. Technical Report WS-02-15.
14. Howard, R. A. 1960. Dynamic Programming and Markov Processes. New York, NY: John Wiley & Sons.
15. Howard, R. A. 1971. Dynamic Probabilistic Systems, volume II. New York, NY: John Wiley & Sons.
16. 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.
17. Nelson, W. 1985. Weibull analysis of reliability data with few or no failures. Journal of Quality Technology 17(3):140-146.
18. Quinlan, J. R. 1986. Induction of decision trees. Machine Learning 1(1):81-106.
19. Simmons, R. G. 1988. A theory of debugging plans and interpretations. In Proc. Seventh National Conference on Artificial Intelligence, 94-99. AAAI Press.
20. Utgoff, P. E.; Berkman, N. C.; and Clouse, J. A. 1997. Decision tree induction based on efficient tree restructuring. Machine Learning 29(1):5-44.
21. Weld, D. S. 1994. An introduction to least commitment planning. AI Magazine 15(4):27-61.
22. Younes, H. L. S., and Simmons, R. G. 2002a. On the role of ground actions in refinement planning. In Proc. Sixth International Conference on Artificial Intelligence Planning and Scheduling Systems, 54-61. AAAI Press.
23. Younes, H. L. S., and Simmons, R. G. 2002b. Probabilistic verification of discrete event systems using acceptance sampling. In Proc. 14th International Conference on Computer Aided Verification, volume 2404 of LNCS, 223-235. Springer.
24. Younes, H. L. S., and Simmons, R. G. 2003. VHPOP: Versatile heuristic partial order planner. Journal of Artificial Intelligence Research 20:405-430.
25. Younes, H. L. S.; Kwiatkowska, M.; Norman, G.; and Parker, D. 2004. Numerical vs. statistical probabilistic model checking: An empirical study. In Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer. Forthcoming.
26. Younes, H. L. S.; Musliner, D. J.; and Simmons, R. G. 2003. A framework for planning in continuous-time stochastic domains. In Proc. Thirteenth International Conference on Automated Planning and Scheduling, 195-204. AAAI Press.
27. Younes, H. L. S. 2003. Extending PDDL to model stochastic decision processes. In Proc. ICAPS-03 Workshop on PDDL, 95-103.