Sciweavers

317 search results - page 11 / 64
» Improving Planning Performance Using Low-Conflict Relaxed Pl...
Sort
View
ECAI
2010
Springer
14 years 12 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
15 years 5 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
AGTIVE
2007
Springer
15 years 5 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ß
DATE
2009
IEEE
147views Hardware» more  DATE 2009»
15 years 5 months ago
Decoupling capacitor planning with analytical delay model on RLC power grid
— Decoupling capacitors (decaps) are typically used to reduce the noise in the power supply network. Because the delay of gates and interconnects is affected by the supply voltag...
Ye Tao, Sung Kyu Lim
JAIR
2002
95views more  JAIR 2002»
14 years 10 months ago
A Critical Assessment of Benchmark Comparison in Planning
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
Adele E. Howe, Eric Dahlman