CS 541: Artificial Intelligence Planning
Instructors:
Jim Blythe,
Jose-Luis Ambite, and
Yolanda Gil.
Time: Tuesday and Thursday, 3:30 - 4:50 PM
Location: THH 114
Course Description
Planning is a key ability for intelligent systems, increasing their
autonomy and flexibility through the construction of sequences of
actions to achieve their goals. It has been an area of research in
artificial intelligence for over three decades. Planning techniques
have been applied in a variety of tasks including robotics, process
planning, web-based information gathering, autonomous agents and
spacecraft mission control.
Planning involves the representation of actions and world models,
reasoning about the effects of actions, and techniques for efficiently
searching the space of possible plans. This course will focus on
the basic foundations and techniques in planning and survey a variety
of planning systems and approaches. The class will be run as a
lecture course with hands-on experience with state-of-the-art planning
systems. Topics covered in the course will include: action and plan
representation, reactive systems, hierarchical and abstraction
planning, case-based planning, machine learning in planning,
multi-agent planning, interacting with the environment, planning under
uncertainty, and recent applications such as web service composition
and workflow construction on the computational Grid.
Prerequisites: CS561a (Introduction to AI), or by permission
from the instructors.
Here are links to the 2000 and 1998 versions of this
course.
Sample exams
Here are sample answers for
the midterm.
Here is a
sample midterm from the course that was
given in Fall 2000.
Here is a
sample final from that course.
Projects
Here is information about projects
for the course, including deadlines.
Homeworks
The first homework assignment is available here. It is due on Sept 18th.
Discussion Group
Share your ideas and questions in the usc-csci-541
discussion group.
Schedule
Notes:
Suggested Readings are for student enrichment, and students will
not be tested on those readings' content.
Introduction
Aug 26: Action and plan representations, historical overview,
STRIPS (Blythe)
Planning Approaches
Aug 28: Plan generation and causal-link planning 1 (Ambite)
- Class Slides (ppt)
(pdf)
- Required Reading (also for Sep 02):
Dan Weld, "An Introduction to Least-Commitment Planning";, AI Magazine
1994 (PDF)
- Suggested Reading (also for Sep 02):
J.S. Penberthy and D. Weld "UCPOP: A Sound, Complete, Partial-Order
Planner for ADL," Proceedings of KR-92, 103-114, Cambridge, MA,
October 1992 (PDF)
Sep 02: Plan generation and causal-link planning 2 (Ambite)
Sep 04: Plan graph search (Ambite)
- Class Slides (ppt)
(pdf)
- Required Reading: A. Blum and M. Furst, "Fast Planning Through Planning Graph
Analysis", Artificial Intelligence, 90:281--300 (1997). (PDF)
(USC students should have acccess to the original AI journal.
If you can't access the original, get the preprint from the authors's page. I
had some problems viewing it with Ghostview on Linux, but it prints
fine. Let me know if you have problems printing-- Jose-Luis).
- Required Reading: Jana Koehler, Bernhard Nebel, Jorg Hoffman and Yannis
Dimopoulos. "Extending planning graphs to an ADL subset", European
Conference on Planning (ECP) 1997. (PDF)
-
Graphplan planner
Sep 09: Planning as satisfiability, Planning as constraint
satisfaction (Ambite)
- Class Slides (ppt)
(pdf)
- Required Reading: Henry Kautz and Bart Selman. Pushing the
envelope: Planning, propositional logic, and stochastic search. In
AAAI 1996. (Postscript)
- Required Reading: Henry Kautz and Bart Selman. Unifying SAT-based
and Graph-based Planning. IJCAI 1999. (Postscript)
- Blackbox
planner
- Required Reading: Minh Binh Do & Subbarao Kambhampati. Solving
planning-graph by compiling it into CSP. AIPS 2000.
(postscript).
- GP-CSP planner.
- Suggested Reading: M. Ernst and T. Millstein and D. Weld
"Automatic SAT-Compilation of Planning Problems" IJCAI 1997. (PDF)
- Suggested Reading: Minh Binh Do & Subbarao
Kambhampati. Planning as Constraint Satisfaction: Solving the planning
graph by compiling it into CSP. Artificial Intelligence 132 (2001)
151-182 (PDF)
(postscript)
- Homework
1
Sep 11: Planning as model checking, OBDD (Ambite)
- Suggested Reading:
F. Giunchiglia, P. Traverso. Planning as Model Checking. In
Proceeding of the Fifth European Conference on Planning (ECP'
1999). LNAI, Springer-Verlag.
(ps.gz)
- Suggested Reading: Randal E. Bryant. Graph-Based
Algorithms for Boolean Function Manipulation. IEEE Transactions on
Computers, Vol. C-35, No. 8, August, 1986, pp. 677-691.
(ps).
- Class Slides (ppt)
(pdf)
Sep 16: Planning on a computational grid (Blythe)
- Required reading:
J. Blythe, E. Deelman, Y. Gil, C. Kesselman, A. Agarwal, G. Mehta,
K. Vahi. The role of planning in grid compution. In Proceedings of the
first International Conference on Automated Planning and Scheduling,
(ICAPS 2003).
PDF.
- Required reading:
B. Srivastava and J. Koehler. Web service composition - current
solutions and open problems. In Proceedings of the ICAPS 03 workshop on
Planning for Web Services,
PDF
- Suggested reading:
E. Deelman, J. Blythe, Y. Gil, C, Kesselman, G. Mehta, K. Vahi,
A. Lazzarini, A. Arbree, R. Cavanaugh, S. Koranda.
Mapping Abstract Complex Workflows onto Grid Environments
Journal of Grid Computing, Vol. 1, No. 1, pp 9 - 23
PDF
- If you are interested, you can also check out the papers at the ICAPS
2003 Workshop on Planning for Web Services.
- Class slides (powerpoint)
Sep 18: Hierarchical task network (HTN) planning (Ambite)
- Class Slides (ppt)
(pdf)
- Required reading:
K. Erol, J. Hendler, and D. S. Nau. UMCP: A sound and complete
procedure for hierarchical task-network planning. Proceedings of the
International Conference on AI Planning Systems (AIPS), pp. 249-254,
June 1994
(pdf)
(ps)
- Required reading: D. S. Nau, Y. Cao, A. Lotem, and
H. Muoz-Avila. SHOP: Simple hierarchical ordered planner. Proceedings
of the International Joint Conference on Artificial Intelligence
(IJCAI), pp. 968-973. Morgan Kaufmann Publishers, Jul 31-August 6
1999.
(pdf)
- Suggested reading: A. Barrett and D. Weld
"Task-Decomposition via Plan Parsing," Proceedings of AAAI-94,
Seattle, WA, July 1994.
(pdf)
- Suggested reading: S. Kambhampati. "A comparative
analysis of partial order planning and task reduction planning" SIGART
Bulletin, Special Section on Evaluating Plans, Planners and Planning
agents, Vol. 6., No. 1, January, 1995.
(ps)
- Suggested reading: Austin Tate, "Generating project
networks", IJCAI-1977. Reprinted in "Readings in Planning" James
Allen, James Hendler, and Austin Tate, editors. Morgan Kaufmann, 1990.
- The SHOP planner.
Sep 23: Planning using temporal logics (Blythe)
- Required reading: Bacchus and Kabanza, "Using temporal
logics to express search control knowledge for planning", AIJ
(pdf)
Skip sections 7.2 - 7.6, inclusive.
- Suggested reading: Sections 7.2 - 7.6 of the above
- TLPlan
homepage
-
slides from a talk by Fahiem Bacchus, in pdf. Slides 31 - 66 are
particularly relevant to the class.
Sep 25: Heuristic search planning (Blythe)
- Required reading: Blai Bonet and Hector Geffner. "Planning
As Heuristic Search". Artificial Intelligence 129
(2001).
(postscript)
- Class notes:
(powerpoint).
Plan Representations
Sep 30: Knowledge representation for planning, ontologies,
description logics (Gil)
- Required reading: Yolanda Gil. "A (Very Short) Introduction to Description Logics". (pdf)
- Required reading: Yolanda Gil. "Plan Representation and Reasoning with Description Logics". (pdf)
- Suggested reading: A. Ankolekar et al., "DAML-S: Semantic Markup for Web Services," submitted for publication in The Emerging Semantic Web. (link)
Oct 02: Reasoning about time: temporal reasoning and
scheduling (Blythe)
- Required reading: Gregg Rabideau, Russell Knight, Steve
Chien, Alex Fukunaga, Anita Govindjee. "Iterative repair planning for
spacecraft operations using the ASPEN system"
(pdf)
- Required reading: D. Smith and D. Weld. "Temporal Planning
with Mutual Exclusion Reasoning." IJCAI 99.
(pdf)
- Class notes:
(powerpoint).
Controlling Search
Oct 07: Complexity of planning problems (Ambite)
- Class Slides (ppt)
(pdf)
- Required Reading: Kutluhan Erol, Dana Nau, and
V.S. Subrahmanian. "Complexity, Decidability and Undecidability
Results for Domain-Independent Planning", Artificial Intelligence
Journal, Vol. 76, Nr. 1-2, pps. 75-88, July, 1995. (ps)
- Required Reading: Section 1 of: Tom Bylander, "The
Computational Complexity of Propositional STRIPS Planning," Artificial
Intelligence, 69:165-204, 1994. (ps.gz)
- Suggested Reading: All of: Tom Bylander, "The
Computational Complexity of Propositional STRIPS Planning," Artificial
Intelligence, 69:165-204, 1994. (ps.gz)
Oct 09: Abstraction, macros, hierarchical planning
(Knoblock)
- Required Reading: Craig A. Knoblock. "Automatically
generating abstractions for planning", Artificial Intelligence, 68(2),
1994.
(pdf)
- Suggested Reading: Richard E. Korf. "Planning as search: A
quantitative approach". Artificial Intelligence, 33(1):65-88,
1987. Reprinted in Readings in Planning, edited by Allen, Hendler, and
Tate, pages 566-578. Morgan Kaufman, 1990.
Oct 14: Learning search control knowledge & case-based
planning (Blythe)
- Required Reading:
Manuela Veloso, Jaime Carbonell, Alicia Perez, Daniel Borrajo, Eugene
Fink and Jim Blythe. "Integrating Planning and Learning: the Prodigy
Architecture", Journal of Theoretical and Experimental AI, 7(1), 1995
(PDF).
-
Required Reading: Manuela Veloso. "Flexible Strategy Learning:
Analogical Replay of Problem Solving Episodes." In Proceedings of
AAAI-94. Postscript
- Class slides:
(powerpoint)
Some of these slides are from
Manuela Veloso and Reid Simmons' course on planning at CMU. I also
used Manuela's slides to discuss analogical reasoning.
Oct 16: Distributed & multi-agent planning (Gil)
- Required Reading: Edmund H. Durfee. Distributed problem solving and planning. In M. Luck, V.
Marik, O. Stepankova, and R. Trappl (eds.), Multiagent Systems and
Applications: Selected tutorial papers from the Ninth ECCAI Advanced Course
(ACAI 2001) and AgentLink's Third European Agent Systems Summer School
(EASSS 2001), pages 118-149, Springer-Verlag Lecture Notes in AI 2086,
Berlin 2001.
(pdf)
Oct 21: Learning from an external environment (Wei-Min Shen)
Oct 23: Midterm
Oct 28: Planning and execution (Ambite)
- Required Reading: Chapter 13. Artificial Intelligence: A
Modern Approach. 1st Edition. Russel & Norvig.
- Required Reading: Oren Etzioni, Steve Hanks, Daniel Weld,
Denise Draper, Neal Lesh, Mike Williamson (1992) "An Approach to
Planning with Incomplete Information". Proceedings of the 3rd
International Conference on Principles of Knowledge Representation and
Reasoning.
(ps)
- Suggested Reading: Ambros-Ingerson, J. & Steel, S (1988)
Integrating planning execution and monitoring. In Proceedings of the
seventh national conference on artificial intelligence (AAAI 88),
Saint Paul, MN, (pp. 83-88).
- Suggested Reading: Golden, K., Etzioni, O. & Weld,
D. 1996. Planning with Execution and Incomplete Information, UW
Technical Report TR96-01-09, February 1996.
(ps)
- Suggested Reading: Golden, K. 1998. "Leap before you
look: Information Gathering in the PUCCINI planner", Proceedings of
the International Conference on AI Planning Systems (AIPS-98). (ps)
- Class Slides (ppt)
(pdf)
Oct 30: Reactive systems (Gil)
- Required Reading: M. P. Georgeff and
A. L. Lansky. Reactive reasoning and planning. In Proceedings of the
Sixth National Conference on Artificial Intelligence (AAAI-87), pages
677-682, Seattle, WA, 1987. ( supplemental info link )
- Suggested Reading: Firby, J "Task Networks for Controlling Continuous Processes",
Proceedings of Artificial Intelligence Planning conference, 1994. (
supplemental info link)
- Suggested Reading: Simmons, R. "Structured Control for Autonomous Robots", IEEE
Transactions on Robotics and Automation, Feb 1994. (
supplemental info link 1 ,
supplemental info link 2)
- Suggested Reading: Zilberstein, S. "Using Anytime Algorithms in Intelligent Systems", AI Magazine, 1996.
- Class notes:
(powerpoint).
Planning Under Uncertainty
Nov 04: Probabilistic planning (Blythe)
-
Required reading:
Blythe, J., "Decision-Theoretic Planning",
AI Magazine, Volume 20, Number 2, Summer 1999, pages 1 to 15 only
(PDF version)
- Slides:
powerpoint and
pdf (but the PDF
has a problem with the slide on the POP algorithm).
Nov 06: Planning in training simulation environments (Jon
Gratch, ICT)
Nov 11: Probabilistic planning II, exogenous events
(Blythe)
- Required reading:
Blythe, J., "Event-based decompositions for reasoning about
external change in planners", AIPS 1996
(pdf).
- Slides: (pdf).
Nov 13: Planning and decision theory, Markov decision
processes (Blythe)
-
Required reading:
Exploiting Structure in Policy Construction. Boutilier, Dearden and
Goldszmidt, IJCAI 95
(PDF)
- Slides: (pdf).
Nov 18: Planning in space
(guest speaker: Ben Smith,
NASA JPL)
-
Required reading:
Re-read the ASPEN paper from the October 2nd class on temporal reasoning
and scheduling:
Gregg Rabideau, Russell Knight, Steve
Chien, Alex Fukunaga, Anita Govindjee. "Iterative repair planning for
spacecraft operations using the ASPEN system"
(pdf)
- suggested readings:
The three featured publications on the
JPL AI group home page.
Nov 20: Mixed-initiative planning (Gil)
-
Required reading:
Myers, K. Abductive Completion of Plan Sketches, in Proceedings of the Fourteenth National Conference on Artificial Intelligence, AAAI Press, 1997. (PDF)
- Required reading: James Allen and George Ferguson, "Human-Machine Collaborative Planning", to appear in Proceedings of the Third International NASA Workshop on Planning and Scheduling for Space, Houston, TX, October 27-29, 2002. (PDF)
- Suggested reading: Myers, K. L. and Morley, D. N. Human Directability of Agents, in Proceedings of the First International Conference on Knowledge Capture, Victoria, B.C., 2001.
- Suggested reading: Myers, K. L. and Jarvis, P. A. and Tyson, W. M. and Wolverton, M. J. A Mixed-initiative Framework for Robust Plan Sketching, in Thirteenth International Conference on Automated Planning and Scheduling (ICAPS-03), 2003.
- Slides: (ppt).
Nov 25: Final Review
Dec 02: Student presentations of course projects 1
Dec 04: Student presentations of course projects 2
Dec 16: Final exam