Sciweavers

1713 search results - page 1 / 343
» Planning for Performance
Sort
View
WSC
2008
14 years 1 months ago
A simulation framework for assessing the performance of cooperative transportation planning algorithms
In this paper, we suggest a framework that allows for the simulation-based performance assessment of algorithms for cooperative transportation planning. Therefore, we consider a c...
Ralf Sprenger, Lars Mönch
AIPS
2009
13 years 12 months ago
Improving Planning Performance Using Low-Conflict Relaxed Plans
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. Ho...
Jorge A. Baier, Adi Botea
AAAI
2000
14 years 6 days ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
AI
2010
Springer
13 years 11 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
AIPS
2006
14 years 7 days ago
New Complexity Results for Classical Planning Benchmarks
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
Malte Helmert