Sciweavers

17 search results - page 1 / 4
» Relevance Grounding for Planning in Relational Domains
Sort
View
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
13 years 11 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
AIPS
2006
13 years 5 months ago
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing
Much has been made of the need for academic planning research to orient towards real-world applications. In this paper, we relate our experience in adapting domain-independent pla...
Minh Binh Do, Wheeler Ruml
JAIR
2010
145views more  JAIR 2010»
13 years 2 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
CI
2011
110views more  CI 2011»
12 years 11 months ago
Experiences with planning for natural language generation
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
Alexander Koller, Ronald P. A. Petrick
AIPS
2007
13 years 6 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier