University of Massachusetts Amherst
Department of Computer Science

 

 

CS 791AP

Advanced Topics in Automated Planning

Fall 2010

 

Siddharth Srivastava and Shlomo Zilberstein

 


Bibliography


  1. F. Bacchus. AIPS'00 planning competition. AI Magazine, 22(3):47-56, 2001.

  2. J.A. Baier, C. Fritz, M. Bienvenu, and S. McIlraith. Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners Proc. of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), 26-33, 2007.

  3. P. Bertoli, M. Pistore, and P. Traverso. Automated composition of Web services via planning in asynchronous domains. Artificial Intelligence, 174(3-4): 316-361, 2010.

  4. A.L. Blum and M.L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):281-300, 1997.

  5. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. Proc. of the 5th International Conference on AI Planning Systems (AIPS-2000), 52-61, 2000.

  6. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.

  7. B. Bonet, H. Palacios, H. Geffner. Automatic derivation of memoryless policies and finite-state controllers using classical planners. Proc. of the International Conference on Automated Planning and Scheduling (ICAPS-09), 34-41, 2009.

  8. C. Boutilier, R. Reiter, and B. Price. Symbolic dynamic programming for first-order MDPs. Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 690-697, 2001.

  9. D. Bryce and S. Kambhampati. Cost sensitive reachability heuristics for handling state uncertainty. Proc. of the 21st Conference on Uncertainty in Artificial Intelligence (UAI-05), 60-68, 2005.

  10. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.

  11. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1-2):35-84, 2003.

  12. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 415-426, 2006.

  13. M.B. Do and S. Kambhampati. Solving planning-graph by compiling it into CSP. Proc. of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-2000), 82-91, 2000.

  14. M.B. Do and S. Kambhampati. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2):151-182, 2001.

  15. S. Eker, T.J. Lee, and M. Gervasio. Iteration learning by demonstration. AAAI Spring Symposium on Agents that Learn from Human Teachers, 2009.

  16. K. Erol, J. Hendler, and D.S. Nau. Complexity results for HTN planning. Annals of Mathematics and Artificial Intelligence, 18(1):69-93, 1996.

  17. M.D. Ernst, T.D. Millstein, and D.S. Weld. Automatic SAT Compilation of Planning Problems. Proc. of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), 1169-1176, 1997.

  18. R.E. Fikes, P.E. Hart, and N.J. Nilsson. Learning and executing generalized robot plans. Technical Note 70. AI Center, SRI International, 1972.

  19. R.E. Fikes and N.J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3-4):189-208, 1971.

  20. H. Geffner. Perspectives on AI planning. Proc. of the 18th National Conference on Artificial Intelligence (AAAI-02), 1013-1023, 2002.

  21. F. Giunchiglia, P. Traverso. Planning as model checking. Proc. of the 5th European Conference on Planning (ECP-99), 1999.

  22. E.A. Hansen and S. Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129(1-2):35-62, 2001.

  23. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. Proc. of the 5th International Conference on AI Planning Systems (AIPS-2000), 140-149, 2000.

  24. M. Helmert. Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143(2):219-262, 2003.

  25. M. Helmert, P. Haslum, and J. Hoffmann. Flexible Abstraction Heuristics for Optimal Sequential Planning. Proc. of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), 176-183, 2007.

  26. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. Proc. of the Symposium on Principles of Programming Language, 58-70, 2002.

  27. J. Hoffmann, R. Brafman. Contingent planning via heuristic forward search with implicit belief states. Proc. of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), 71-80, 2005.

  28. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 253-302, 2001.

  29. H. Kautz and B. Selman. Planning as satisfiability. Proc. of the European Conference on Artificial Intelligence (ECAI-92), 359-363, 1992.

  30. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. Proc. of the 13th National Conference on Artificial (AAAI-96), 1194-1201, 1996.

  31. H. Kautz and B. Selman. Unifying SAT-based and Graph-based planning. Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 318-325, 1999.

  32. J. Koehler, B. Nebel, J. Hoffman and Y. Dimopoulos. Extending planning graphs to an ADL subset. Proc. of the European Conference on Planning (ECP-97), 273-285, 1997.

  33. T. Lau, S.A. Wolfman, P. Domingos, and D.S. Weld. Programming by demonstration using version space algebra. Machine Learning, 53:111Đ156, 2003.

  34. H.J. Levesque. Planning with loops. Proc. of the 19th International Joint Conference on Artificial intelligence (IJCAI-05), 509-515, 2005.

  35. D. McAllester and D. Rosenblitt. Systematic nonlinear planning. Proc. of the N9th National Conference on Artificial Intelligence (AAAI-91), 634-639, 1991.

  36. J. McCarthy and P.J. Hayes. Some philosophical problems from the standpoint of Artificial Intelligence. Machine Intelligence, 4:463-502, 1969.

  37. D. McDermott. The 1998 AI planning systems competition. AI Magazine, 21(2):35-56, 2000.

  38. D.S. Nau. Current trends in automated planning. AI Magazine, 28(4):43-58, 2007.

  39. B. Nebel. Compilation schemes: A theoretical tool for assessing the expressive power of planning formalisms. Proc. of the Annual German Conference on Artificial Intelligence (KI-99), 183-194, 1999.

  40. A. Newell and H. Simon. GPS: A program that simulates human thought. In E. Feigenbaum and J. Feldman, eds., Computers and Thought, McGraw Hill, 279--293, 1995.

  41. X.L. Nguyen and S. Kambhampati. Reviving partial order planning. Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 459-464, 2001.

  42. J.S. Penberthy and D.S. Weld. UCPOP: A sound, complete, partial-order planner for ADL. Proc. of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, 103-114, 1992.

  43. M.A. Peot and D.E. Smith. Conditional nonlinear planning. Proc. of the 1st International Conference on Artificial Intelligence Planning Systems (AIPS-92), 189-197, 1992.

  44. R.P.A. Petrick and F. Bacchus. A knowledge-based approach to planning with incomplete information and sensing. Proc. of the 6th International Conference on Artificial Intelligence Planning Systems (AIPS-02), 212-222, 2002.

  45. M. Pistore, A. Marconi, P. Bertoli, and P. Traverso. Automated Composition of Web Services by Planning at the Knowledge Level. Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), 1252-1259, 2005.

  46. A. Podelski and A. Rybalchenko. A Complete Method for the Synthesis of Linear Ranking Functions. Proc. of 5th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI-04), 465-486, 2004.

  47. J. Rintanen. Automated Planning: Algorithms and Complexity. Habilitation thesis, Albert-Ludwigs-UniversitŠt Freiburg, 2005.

  48. J. Rintanen and J. Hoffmann. An overview of recent algorithms for AI planning. Proc. of the German Conference on Artificial Intelligence (KI-01), 5-11, 2001.

  49. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 2002.

  50. J. Shavlik. Acquiring recursive and iterative concepts with explanation-based learning. Machine Learning, 5:39-70, 1990.

  51. S. Srivastava, N. Immerman, and S. Zilberstein. Learning generalized plans using abstract counting. Proc. of The 23rd Conference on Artificial Intelligence (AAAI-08), 991-997, 2008.

  52. S. Srivastava, N. Immerman, and S. Zilberstein. Challenges in finding generalized plans. ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control, 2009.

  53. S. Srivastava, N. Immerman, and S. Zilberstein. Merging example plans into generalized plans for non-deterministic environments. Proc. of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-10), 1341-1348, 2010.

  54. S. Srivastava, N. Immerman, and S. Zilberstein. Computing applicability conditions for plans with loops. Proc. of the 20th International Conference on Automated Planning and Scheduling (ICAPS-10), 161-168, 2010.

  55. C. Wang, S. Joshi and R. Khardon. First Order Decision Diagrams for Relational MDPs. Journal of Artificial Intelligence Research, 31:431-472, 2008.

  56. D.S. Weld. An introduction to least commitment planning. AI Magazine 15(4):27-61, 1994.

  57. D.S. Weld. Recent advances in AI planning. AI Magazine, 20(2): 93-123, 1999.

  58. D.E. Wilkins. Can AI Planners Solve Practical Problems? Computational Intelligence, 6(4):232-246, 1990.

  59. D.E. Wilkins, and M. desJardins. A call for knowledge-based planning. AI Magazine, 22(1):99-115. 2001.

  60. E. Winner, M.M. Veloso. DISTILL: Learning Domain-Specific Planners by Example Proc. of the 20th International Conference on Machine Learning, 800-807, 2007.

  61. E. Winner, M.M. Veloso. LoopDISTILL: Learning domain-specific planners from example plans. ICAPS-07 Workshop on Artificial Intelligence Planning and Learning, 2007.

  62. S. Yoon, A. Fern, and R. Givan. Learning control knowledge for forward search planning. Journal of Machine Learning Research, 9:683-718, 2008.


© 2010 Siddharth Srivastava & Shlomo Zilberstein