IDA - Intelligent Data Analysis Research Group

BibTeX Entry

  file = {znalosti2011.pdf},
  category = {ida-publications},
  author = {Radom{\'i}r {\v C}ernoch and Filip {\v Z}elezn{\'y}},
  title = {Speeding up planning through minimal generalizations of partially ordered plans},
  booktitle = {Inductive Logic Programming},
  editor = {Paolo Frasconi and Francesca Lisi},
  series = {Lecture Notes in Computer Science},
  volume = {6489},
  year = {2011},
  language = {English},
  publisher = {Springer Berlin / Heidelberg},
  pages = {269-276},
  url = {},
  keywords = {Computer Science},
  note = {10.1007/978-3-642-21295-6_29},
  abstract = {We present a novel strategy enabling to exploit existing plans in solving new similar planning tasks by finding a common generalized core of the existing plans. For this purpose we develop an operator yielding a minimal joint generalization of two partially ordered plans. In three planning domains we show a substantial speed-up of planning achieved when the planner starts its search space exploration from the learned common generalized core, rather than from scratch.},
  vvvs = {1},

Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.