Zur Kurzanzeige

dc.contributor.authorSiebers, Michael
dc.date2014-02-01
dc.date.accessioned2018-01-08T09:17:02Z
dc.date.available2018-01-08T09:17:02Z
dc.date.issued2014
dc.identifier.issn1610-1987
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/11395
dc.description.abstractIn this paper we present an approach to avoid dead-ends during automated plan generation. A first-order logic formula can be learned that holds in a state if the application of a specific action will lead to a dead-end. Starting from small problems within a problem domain examples of states where the application of the action will lead to a dead-end will be collected. The states will be generalized using inductive logic programming to a first-order logic formula. We will show how different notions of goal-dependence could be integrated in this approach. The formula learned will be used to speed-up automated plan generation. Furthermore, it provides insight into the planning domain under consideration.
dc.publisherSpringer
dc.relation.ispartofKI - Künstliche Intelligenz: Vol. 28, No. 1
dc.relation.ispartofseriesKI - Künstliche Intelligenz
dc.subjectAutomated planning
dc.subjectDead-end states
dc.subjectInductive logic programming
dc.subjectLearning domain knowledge
dc.titleTransfer of Domain Knowledge in Plan Generation: Learning Goal-dependent Annulling Conditions for Actions
dc.typeText/Journal Article
mci.reference.pages35-38
gi.identifier.doi10.1007/s13218-013-0282-z


Dateien zu dieser Ressource

DateienGrößeFormatAnzeige

Zu diesem Dokument gibt es keine Dateien.

Zur Kurzanzeige