Lehrstuhl Grundlagen der Künstlichen Intelligenz, Institut für Informatik, Universität Freiburg

• Planen durch heuristische lokale Suche
  
  • Jörg Hoffmann: A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm
    Proceedings of the 12th International Symposium on Methodologies for Intelligent Systems (ISMIS 2000)
    Charlotte, North Carolina, 2000. (Download Postscript)
  • Jörg Hoffmann: Local Search Topology in Planning Benchmarks: An Empirical Analysis
    Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI '01).
    Conference Preprints, Seattle, Washington 2001. (Download Postscript)
  
  
• Planen durch heuristische Suche mit Musterdatenbanken
  
  • Stefan Edelkamp: Planning with Pattern Databases
    Proceedings of the Sixth European Conference on Planning (ECP '01)
    Conference Preprints, Toledo 2001. (Download Postscript)
  
  
• Planen mit unvollständiger Information durch heuristische Suche
  
  • Blai Bonet und Hector Geffner: Planning with Incomplete Information as Heuristic Search in Belief Space
    Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000)
    AAAI Press, Menlo Park, California 2000. (Download Postscript)
  
  
• Hybride Planungsalgorithmen
  
  • Maria Fox und Derek Long: Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub-problems in Planning
    Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI '01).
    Conference Preprints, Seattle, Washington 2001. (Download Postscript)
  
  
• Neue Ideen im Partial Order Planning
  
  • XuanLong Nguyen und Subbarao Kambhampati: Reviving Partial Order Planning
    Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI '01).
    Conference Preprints, Seattle, Washington 2001. (Download Postscript)
  
  
• Planen als aussagenlogisches Erfüllbarkeitsproblem
  
  • Henry Kautz und Bart Selman: Pushing the Evelope: Planning, Propositional Logic, and Stochastic Search
    Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI '96)
    AAAI Press, Menlo Park, California 1996. (Download Postscript)
  
  
• Planen mit BDDs
  
  • Alessandro Cimatti, Marco Pistore, Marco Roveri und Paolo Traverso: Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking
    IRST Technical Report 0104-11
    Istituto Trentino di Cultura, Trento 2001. (Download Postscript)
  
  
• Planen mit BDDs in Zweipersonenspielen
  
  • Rune M. Jensen, Manuela M. Veloso und Michael H. Bowling: OBDD-Based Optimistic and Strong Cyclic Adversarial Planning
    Proceedings of the Sixth European Conference on Planning (ECP '01)
    Conference Preprints, Toledo 2001. (Download Postscript)
  
  
• Berechnung von Invarianten für Planungsprobleme
  
  • Jussi Rintanen: An Iterative Algorithm for Synthesizing Invariants
    Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000)
    AAAI Press, Menlo Park, California 2000. (Download Postscript)
  
  
• Planen mit reduzierten Operatorlisten
  
  • Patrik Haslum und Peter Jonsson: Planning with Reduced Operator Sets
    Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000)
    AAAI Press, Menlo Park, California 2000. (Download Postscript)
  
  
• Ausdrucksstärke verschiedener Planungsformalismen
  
  • Bernhard Nebel: On the Expressive Power of Planning Formalisms: Conditional Effects and Boolean Preconditions in the STRIPS Formalism
    In: J. Minker (Hrsg.), Logic-Based Artificial Intelligence, S. 469-490
    Kluwer, Dordrecht, 2000. (Download Postscript)
  
  
• Komplexitätsresultate für typische Planungsprobleme
  
  • Malte Helmert: On the Complexity of Planning in Transportation Domains
    Proceedings of the Sixth European Conference on Planning (ECP '01)
    Conference Preprints, Toledo 2001. (Download Postscript)

Bei Problemen beim Download oder anderen Fragen bitte Mail an Malte Helmert.

Zurück zur Hauptseite des Seminars.