Sciweavers

160 search results - page 8 / 32
» Planning Graph Heuristics for Belief Space Search
Sort
View
AAAI
2007
14 years 12 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
AGTIVE
2007
Springer
15 years 3 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
ECAI
2008
Springer
14 years 11 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
ICRA
2010
IEEE
136views Robotics» more  ICRA 2010»
14 years 7 months ago
Efficient planning under uncertainty for a target-tracking micro-aerial vehicle
A helicopter agent has to plan trajectories to track multiple ground targets from the air. The agent has partial information of each target's pose, and must reason about its u...
Ruijie He, Abraham Bachrach, Nicholas Roy
AAAI
2008
14 years 12 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang