Power plant operator assistant: An industrial application of factored MDPs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2972, Issue , 2004, Pages 565-573

  Reyes, Alberto ^a   Ibargüengoytia, Pablo H ^a   Sucar, L Enrique ^a  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION THEORY; DYNAMIC PROGRAMMING; INDUSTRIAL APPLICATIONS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; STATE SPACE METHODS; STEAM GENERATORS; ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; COMBINED CYCLE POWER PLANTS; COMPLEX NETWORKS;

HEAT RECOVERY STEAM GENERATORS (HRSG); INTELLIGENT SYSTEMS; MARKOV DECISION PROCESSES (MDP); DYNAMIC BAYESIAN NETWORKS; MARKOV DECISION PROCESSES; OPTIMAL OPERATION; PLANNING PROBLEM; POWER PLANT OPERATORS; POWER PLANT SIMULATOR; REAL WORLD DOMAIN; REWARD FUNCTION;

COMBINED CYCLE POWER PLANTS; PROBLEM SOLVING;

EID: 9444235096     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24694-7_58     Document Type: Conference Paper

References (14)

1. Mario E. Agueda and Pablo H. Ibargüengoytia. An architecture for planning in uncertain domains. In Proc. ICTAI-Oi Thirteen International Conference on Tools with Artificial Intalligence, pages 152-159, Dallas, Tex., USA, 2001.
2. Boutilier C., Reiter R., and Price B. Simbolic dynamic programming for first order MDPs. In Proc. International Joint Conf. on Artificial Intelligence, IJCAI-2001, 2001.
3. Koller D. and Parr R. Policy iteration for factored MDPs. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, UAI-00, pages 326-334, Stanford, CA, USA, 2000.
4. A. Darwiche and Goldszmidt M. Action networks: A framework for reasoning about actions and change under understanding. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, UAI-94", pages 136-144, Seattle, WA, USA, 1994.
5. Bellman R. E. Dynamic Programming. Princeton University Press, Princeton, N.J., U.S.A., 1957.
6. The Elvira Consortium. Elvira: An environment for creating and using probabilistic graphical models. In Proceedings of the First European Workshop on Probabilistic graphical models (PGM'02)", pages 1-11, Cuenca, Spain, 2002.
7. Guestrin, Koller, and Parr. Multiagent planning with factored MDPs. In Advances in Neural Information Processing Systems NIPS-14, 2001.
8. J. Hoey, St-Aubin R., A. Hu, and Boutilier C. Spudd: Stochastic planning using decision diagrams. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, UAI-99, pages 279-288, 1999.
9. R. A. Howard. Dynamic Programming and Markov Processes. MIT Press, Cambridge, Mass., U.S.A., 1960.
10. Astrom K.J. Optimal control of Markov processes with incomplete state information. J. Math. Anal. Applications, 10:174-205, 1965.
11. Patrick Naughton and Herbert Schildt. Java 2: The Complete Reference. Osborne/Mc Graw Hill, 3rd Edition, London, Great Britain, 2000.
12. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, N.Y., U.S.A., 1995.
13. Dearden R. and Boutillier C. Abstraction and approximate decision-theoretic planning. Artificial Intelligence, 89:219-283, 1997.
14. Dean T. and Kanazawa K. A model for reasoning about persistence and causation. Computational Intelligence, 5(3):142-150, 1989.