An agent based modelling approach for stochastic planning parameters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4659 LNAI, Issue , 2007, Pages 225-236

  Dangelmaier, Wilhelm ^a   Klöpper, Benjamin ^a   Blecken, Alexander ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; RANDOM PROCESSES; STRATEGIC PLANNING;

STOCHASTIC PLANNING PARAMETERS; STOCHASTICAL ENVIRONMENTAL FACTORS;

MULTI AGENT SYSTEMS;

EID: 37249023332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74481-8_22     Document Type: Conference Paper

References (19)

1. Bellifemine, F., Rimassa, G., Poggi, A.: JADE - A FIPA-compliant agent framework. In: Proceedings of the 4th International Conference and Exhibition on the Practical Application of Intelligent Agents and Multi-Agents, London, pp. 97-108 (1999)
2. Blythe, J.: Planning Under Uncertainty in Dynamic Domains. PhD thesis, Carnegie Mellon University Computer Science Department (May 1998)
3. Blythe, J.: An Overview of Planning Under Uncertainty. In: Wooldridge, M.J., Veloso, M. (eds.) Artificial Intelligence Today. LNCS (LNAI), vol. 1600, pp. 85-110. Springer, Heidelberg (1999)
4. Charniak, E.: Bayesian Networks without Tears. AI MAGAZINE (1991)
5. Cozman, Gagliardi, F.: XMLBIF: version 0.3 (2001), http://www.cs.cmu.edu/ javabayes/Home/index.html
6. Dangelmaier, W., Franke, H.: Decentralized management for transportationlogistics: A multi agent based approach. Integrated Computer-Aided Engineering 10(2), 203-210 (2003)
7. Dangelmaier, W., Klöpper, B., Wienstroer, J., Timm, T.: The Shortest Path Problem in Uncertain Domains - an Agentbased Approach with Bayesian Networks. In: Abraham, Ajith, Chen, Yuehui. (Hrsg.) (eds.) Sixth International Conference Intelligent Systems Design and Applications, vol. 2, pp. 943-948. IEEE Computer Society Press, Los Alamitos (2006)
8. Draper, D., Hanks, S., Weld, D.: Probabilistic planning with information gathering and contingent execution. In: Hammond, K. (ed.) Proc. Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Illinois, pp. 31-37. AAAI Press, Stanford (1994)
9. Haddawy, P., Suwaridi, M.: Decision-theoretic refinement planning using inheritance abstraction. In: Hammond, K. (ed.) Proc. Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Illinois, AAAI Press, Stanford (1994)
10. Jensen, F.V.: An Introduction to Bayesian Networks. Springer, New York (1996)
11. Jensen, F.V.: Bayesian Networks and Decision Graphs. Springer, New York (2001)
12. Krylov, N.V.: Introduction to the Theory of Random Processes. Amer. Math. Society, Graduate Studies in Mathematics 43 (2002)
13. Kushmerick, N., Hanks, S., Weld, D.: An algorithm for probabilistic planning. Artificial Intelligence 76(1-2), 239-286 (1995)
14. Lauritzen, S., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society B 50(2), 157-224 (1988)
15. Liu, B., Lai, K.K.: Stochastic programming models for vehicle routing problems. In: Focus on computational neurobiology, pp. 13-27. Nova Science Publisher, Inc. Commack (2004)
16. Murphy, K.P.: Dynamic Bayesian Networks: Representation, Inference and Learning. Doctoral Thesis. UMI Order Number: AAI3082340 (2002)
17. Pearl, J.: Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
18. Polychronopoulos, G.H., Tsitsiklis, J.N.: Stochastic Shortest Path Problems with recourse. Networks 27(2), 133-143 (1996)
19. Russell, Norvig, S., Peter.: Artificial Intelligence - A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)