Sciweavers

59 search results - page 3 / 12
» Course Generation as a Hierarchical Task Network Planning Pr...
Sort
View
BIRTHDAY
2005
Springer
13 years 11 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
CORR
2011
Springer
221views Education» more  CORR 2011»
13 years 23 days ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin
AAAI
2008
13 years 8 months ago
HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
Chad Hogg, Héctor Muñoz-Avila, Ugur ...
WOA
2001
13 years 7 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu
AIPS
1998
13 years 7 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati