Planning for Operational Control Systems with Predictable Exogenous Events

Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

Volumn , Issue , 2011, Pages 940-945

  Brafman, Ronen I ^a   Domshlak, Carmel ^b   Engel, Yagil ^c   Feldman, Zohar ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ECONOMICS; FLIGHT CONTROL SYSTEMS; MARKOV PROCESSES;

CUSTOMER RESPONSE; DEMAND PATTERN; EXTREME WEATHER CONDITIONS; FLIGHT TIME; MANAGEMENT SYSTEMS; MARKOV DECISION PROCESSES; OPERATIONAL CONTROL; PROBABILISTIC MODELS; RESPONSE MANAGEMENT; SERVICE TIME;

FORECASTING;

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

References (13)

1. Barto, A. G.; Bradtke, S. J.; and Singh, S. P. 1995. Learning to act using real-time dynamic programming. Artificial Inteligence 72(1):81-138.
2. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision theoretic planning: Structural assumptions and computational leverage. Journal of AI Research 11:1-94.
3. Delgado, K. V.; Sanner, S.; de Barros, L. N.; and Cozman, F. G. 2009. Efficient solutions to factored MDPs with imprecise transition probabilities. In ICAPS.
4. Engel, Y., and Etzion, O. 2011. Towards proactive event-driven computing. In DEBS.
5. Etzion, O., and Niblett, P. 2010. Event Processing in Action. Manning Publications.
6. Garnett, O., and Mandelbaum, A. 2001. An introduction to skills-based routing and its operational complexities. Teaching note, Technion.
7. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129(1-2):35-62.
8. Kearns, M. J.; Mansour, Y.; and Ng, A. Y. 2002. A sparse sampling algorithm for near-optimal planning in large markov decision processes. Machine Learning 49(2-3):193-208.
9. Marinescu, R., and Dechter, R. 2005. AND/OR branch-and-bound for graphical models. In IJCAI.
10. Regan, K., and Boutilier, C. 2010. Robust policy computation in reward-uncertain MDPs using nondominated policies. In AAAI.
11. Singh, S. P., and Gullapalli, V. 1993. Asynchronous modified policy iteration with single-sided updates. unpublished.
12. Wasserkrug, S.; Gal, A.; and Etzion, O. 2005. A model for reasoning with uncertain rules in event composition. In UAI.
13. Yoon, S. W.; Fern, A.; Givan, R.; and Kambhampati, S. 2008. Probabilistic planning via determinization in hindsight. In AAAI.