Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

References

  • Mandatory reading:
    • D. McDermott. “PDDL – the planning domain definition language”, Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998.
    • N. Nilsson and R. Fikes. “STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving”, SRI Technical Note 43, 1970. http://www.ai.sri.com/pubs/files/tn043r-fikes71.pdf
  • Further reading:
    • S. Russell and P. Norvig. “AI: A Modern Approach” (2nd Edition), Prentice Hall, 2002
    • G. Malik; D.S. Nau, P. Traverso (2004), Automated Planning: Theory and Practice, Morgan Kaufmann, ISBN 1-55860-856-7
    • T .Bylander,The Computationa lComplexity of Propositional STRIPS Planning, Artificial Intelligence Journal, 1994
  • Wikipedia links:
    • http://en.wikipedia.org/wiki/Automated_planning_and_scheduling
    • http://en.wikipedia.org/wiki/STRIPS
    • http://en.wikipedia.org/wiki/Hierarchical_task_network
    • http://en.wikipedia.org/wiki/Planning_Domain_Definition_Language

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.