Sciweavers

622 search results - page 1 / 125
» Understanding and Extending Graphplan
Sort
View
ECP
1997
Springer
92views Robotics» more  ECP 1997»
13 years 8 months ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
IJCAI
2003
13 years 6 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
JAIR
2000
100views more  JAIR 2000»
13 years 4 months ago
On the Compilability and Expressive Power of Propositional Planning Formalisms
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power&qu...
Bernhard Nebel
KR
2004
Springer
13 years 10 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
DAGM
2008
Springer
13 years 6 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
Stefan Schwärzler, Joachim Schenk, Frank Wall...