Artificial Intelligence Planning (40-637)

Spring 2002

Instructor: 

Dr. Gholamreza Ghassem-Sani(Home)

(sani@sina.sharif.edu)

Assistant: 

Abolfazl Keighobadi-Lamjiri(Home)



Midterm Exam is due on Sunday 81/2/29.


Downloads:


Links:

Here are some links to the course pages in some universities:

The University of Maryland(College Park) CMSC 722 Lecture Notes Syllabus Homework & Answers
Arizona State University CSE 574: Planning and Learning Methods Lecture Notes Syllabus & Grading Overview of the whole course Slides - (on CE - old) , (on CE - new)
USC CS 541: AI Planning Lecture Notes & Course Materials Suggested Project Areas Homeworks & Assignments

Suggested Readings:

  • ?, Evolution of Planning, Sample Chapter, 2000.(pdf)

  • Daniel S. Weld, Recent Advances in AI Planning, AI Magazine, 1999(ps)

  • Back to Top

    Outstanding papers for presentation:

  • Hoffmann J., FF: The Fast-Forward Planning System, AI Magazine, 2001.(ps on ce) - Miss Hassan-Zadeh, 10:30 to 11, 5 Khordad.

  • Ernst M., Weld D. SAT Planning: automatic sat-compilation of planning problems , IJCAI, 97.(pdf on ce) - Miss Ghandehari, 11:15 to 11:45, 5 Khordad.

  • Veloso M., Flexible Strategy Learning- Analogical Replay of Problem Solving Episodes - veloso, aaai94.(ps on ce) - Miss Rastkar, 10:30 to 11, 12 Khordad.

  • Erol K., Nau D., Subrahmanian V., Complexity, decidability and undecidability results for domain-independent planning , AIJ, 94.(ps on ce) - Miss Simjur, 11:15 to 11:45, 12 Khordad.

  • Bacchus F., Using temporal logic to control search in a forward-chaining planner , EWSP, 95.(ps on ce) - Miss Sadeghi, 10:30 to 11, 19 Khordad.

  • Blythe J. An Overview of Planning Under Uncertainty , AI Magazine, 1999.(pdf on ce) - Miss Salaari, 11:15 to 11:45, 19 Khordad.

  • Gratch Jonathan, How to Make Your Planner Rude and Other Issues in Multi-Agent Planning , AI Magazine.(ps on ce) - Mr Foladgar, 9 to 9:30, 26 Khordad.

  • Hoffmann J. On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , JAIR, 2000.(ps on ce) - Mr Niaamanesh, 9:45 to 10:15, 26 Khordad.

  • Armano G, An Adaptive Approach for Planning in Dynamic Environments, ICAI-2001.(pdf on ce) - Mr Baba'ali, 10:30 to 11, 26 Khordad.

  • Bonet B., Geffner, Planning as heuristic search New results, IJCAI97.(ps on ce) - Excluded.

  • desJardins Marie, Coordinating Planning Activity and Information Flow in a Distributed Planning System , AI Magazine, Winter 1999, pp. 45-53.(ps on ce) Excluded.

  • Erol K., Hendler J., Nau D., Complexity Results for Hierarchical Task-Network Planning , Annals of Mathematics and AI, 95.(ps on ce) .

  • Boutilier C., Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , JAIR 1999.(ps on ce) .

  • Back to Top

    Course Syllabus & Outline (persian)

    • Representing a Planning Problem
    • Strip Operators
    • Planning Assumptions
      • Closed World Assumption
      • STRIPS Assumption
      • Instantaneous Actions
    • Planning Approaches
      • Linear & Nonlinear Planning
      • Hierarchical Planning
      • Meta-Level Planning
      • Opportunistic Planning
    • Planning with Time Consideration
      • Actions
      • Alen Planner
    • Replanning
    • Conditional Planning
    • Distributed Planning
    • Interleaving Planning and Execution
    • Modal Truth Criterion

    Evaluation:

    • Midterm and Final Exams (50%)
    • Presentation (15%)
    • Exercises (10%)
    • Final Project (25%)
    Back to Top

    Exercises

    Back to Top