Inference and Learning in Planning

  • Hector Geffner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7207)


Planning is the model-based approach to autonomous behaviour where the action to do next is derived from a model. The main challenge in planning is computational, as all models, whether accommodating non-determinism and feedback or not, are intractable in the worst case. In the last few years, however, significant progress has been made resulting in algorithms that can produce plans effectively in a variety of settings. These developments have to do with the formulation and use of general inference techniques and transformations. In this talk, I review the inference techniques that have proven useful for solving individual planning instances, and discuss also the use of learning methods and transformations for solving complete planning domains. The former include the automatic derivation of heuristic functions to guide the search for plans, and the identification of helpful actions and landmarks. The latter include methods for deriving generalized policies and finite state controllers capable of dealing with changes in the initial situation and in the number of objects. I’ll also discuss the alternative ways in which learning can be used in planning and the challenges ahead.


Artificial Intelligence Mathematical Logic Main Challenge Significant Progress Formal Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hector Geffner
    • 1
  1. 1.ICREA and Universitat Pompeu FabraBarcelonaSpain

Personalised recommendations