Monitoring the execution of partial-order plans via regression

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1975-1982

  Muise, Christian ^a   McIlraith, Sheila A ^a   Beck, J Christopher ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SELECTION; DECISION DIAGRAM; EXECUTION MONITORING; EXPONENTIAL NUMBERS; ORDERING CONSTRAINTS; PLANNING DOMAINS; STATE EVALUATION;

ARTIFICIAL INTELLIGENCE;

LINEARIZATION;

EID: 84866456564     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-330     Document Type: Conference Paper

References (15)

1. C. Bäckström. Computational aspects of reordering plans. Journal of Artificial Intelligence Research, 9(1):99-137, 1998. (Pubitemid 128636201)
2. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebric decision diagrams and their applications. Formal methods in system design, 10(2):171-206, 1997. (Pubitemid 127506986)
3. C. Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1104-1113, 1995.
4. R.E. Fikes, P.E. Hart, and N.J. Nilsson. Learning and executing generalized robot plans. Artificial Intelligence, 3:251-288, 1972.
5. C. Fritz and S. McIlraith. Monitoring plan optimality during execution. In Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), pages 144-151, 2007.
6. C. Gretton and S. Thiébaux. Exploiting first-order regression in inductive policy selection. In Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence (UAI-04), pages 217-225, 2004.
7. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14(1):253-302, 2001.
8. S. Kambhampati and S. Kedar. A unified framework for explanation-based generalization of partially ordered and partially instantiated plans. Artificial Intelligence, 67(1):29-70, 1994.
9. A Kolobov, Mausam, and D Weld. Re-TrASE: Integrating paradigms for approximate probabilistic planning. Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pages 1746-1753, 2009.
10. S. Sanner and C. Boutilier. Practical linear value-approximation techniques for first-order MDPs. In Proceedings of the 22nd Conference in Uncertainty in Artificial Intelligence (UAI-06), 2006.
11. J. Shah, J. Stedl, B. Williams, and P. Robertson. A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), pages 296-303, 2007.
12. M.M. Veloso, M.E. Pollack, and M.T. Cox. Rationale-based monitoring for planning in dynamic environments. In Proceedings of the Fourth International Conference on AI Planning Systems (AIPS-98), pages 171-179, 1998.
13. R. Waldinger. Achieving Several Goals Simultaneously. Machine Intelligence, 8:94-136, 1977.
14. D.S. Weld. An introduction to least commitment planning. AI Magazine, 15(4):27, 1994.
15. D.E.Wilkins. Recovering from execution errors in SIPE. Computational Intelligence, 1(1):33-45, 1985.