Sciweavers

179 search results - page 5 / 36
» Using Classical Planners to Solve Nondeterministic Planning ...
Sort
View
ICTAI
2010
IEEE
15 years 1 months ago
Combining Learning Techniques for Classical Planning: Macro-operators and Entanglements
Planning techniques recorded a significant progress during recent years. However, many planning problems remain still hard even for modern planners. One of the most promising appro...
Lukás Chrpa
AAAI
2008
15 years 6 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 ...
AAAI
2004
15 years 5 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
164
Voted
JAIR
2010
167views more  JAIR 2010»
15 years 2 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
AAAI
2010
15 years 5 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Jia Pan, Christian Lauterbach, Dinesh Manocha