LHTNDT: LEARN HTN METHOD PRECONDITIONS USING DECISION TREE

Fatemeh Nargesian, Gholamreza Ghassem-Sani

2008

Abstract

In this paper, we describe LHTNDT, an algorithm that learns the preconditions of HTN methods by examining plan traces produced by another planner. LHTNDT extracts conditions for applying methods by using decision tree based algorithm. It considers the state of relevant domain objects in both current and goal states. Redundant training samples are removed using graph isomorphism. Our experiments, LHTNDT converged. It can learn most of preconditions correctly and quickly. 80% of our test problems were solved by preconditions extracted by ¾ of plan traces needed for full convergence.

Paper Citation

in Harvard Style

Nargesian F. and Ghassem-Sani G. (2008). LHTNDT: LEARN HTN METHOD PRECONDITIONS USING DECISION TREE . In Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8111-30-2, pages 60-65. DOI: 10.5220/0001499900600065

in Bibtex Style

@conference{icinco08,
author={Fatemeh Nargesian and Gholamreza Ghassem-Sani},
title={LHTNDT: LEARN HTN METHOD PRECONDITIONS USING DECISION TREE},
booktitle={Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2008},
pages={60-65},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001499900600065},
isbn={978-989-8111-30-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - LHTNDT: LEARN HTN METHOD PRECONDITIONS USING DECISION TREE
SN - 978-989-8111-30-2
AU - Nargesian F.
AU - Ghassem-Sani G.
PY - 2008
SP - 60
EP - 65
DO - 10.5220/0001499900600065