Your turn - Session IV
Completion requirements
Opened: Wednesday, 22 November 2017, 12:00 AM
Upload your proposal (one line)
and your contribution (slides of a presentation, code, written report
...) about the issues involved in Planning.
Possible tasks I have proposed are:
- Solve a new planning problem with SATplan: for example “Monkey and bananas”, or the “Shakey world” (see descriptions at the end of AIMA Chapter 10).
- Solve a new planning problem with a regression planner such as STRIPS.
- An example of a system that makes use of effective heuristics is FF, or FastForward (Hoffmann, 2005). Discuss.
- Discuss heuristics that you find in the literature.
- Describe some of the winning algorithms for planning from planning competitions
- Implement/run Partial order planning algorithms
- Compute the planning graph for a new problem and discuss the execution of GraphPlan.
- Planning with resource constraints. You may look at some popular planners such as SAPA (Do and Kambhampati, 2001), T4 (Haslum and Geffner, 2001).
- HTN planning. Discuss approaches.
- O-PLAN (Bell and Tate, 1985), combines HTN planning with scheduling. Presentation.
- Reusing plans: Explanation based learning or Case based planning
- Non deterministic planning approaches.
- Multi-agent planning approaches.