Header menu link for other important links
Extending and tuning heuristics for a partial order causal link planner
Published in Springer Verlag
Volume: 9468
Pages: 81 - 92
Recent literature reveals that different heuristic functions perform well in different domains due to the varying nature of planning problems. This nature is characterized by the degree of interaction between subgoals and actions. We take the approach of learning the characteristics of different domains in a supervised manner. In this paper, we employ a machine learning approach to combine different, possibly inadmissible, heuristic functions in a domain dependent manner. With the renewed interest in Partial Order Causal Link (POCL) planning we also extend the heuristic functions derived from state space approaches to POCL planning. We use Artificial Neural Network (ANN) for combining these heuristics. The goal is to allow a planner to learn the parameters to combine heuristic functions in a given domain over time in a supervised manner. Our experiments demonstrate that one can discover combinations that yield better heuristic functions in different planning domains. © Springer International Publishing Switzerland 2015.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
Open AccessNo
Concepts (11)
  •  related image
    Artificial intelligence
  •  related image
    Learning systems
  •  related image
    Neural networks
  •  related image
  •  related image
  •  related image
  •  related image
  •  related image
  •  related image
  •  related image
  •  related image
    Heuristic algorithms