Sciweavers

176 search results - page 13 / 36
» Additive-Disjunctive Heuristics for Optimal Planning
Sort
View
ICTAI
1994
IEEE
13 years 11 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
AIPS
2008
13 years 10 months ago
Useless Actions Are Useful
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 26 days ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 7 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
14 years 1 months ago
Test Planning for Mixed-Signal SOCs with Wrapped Analog Cores
Many SOCs today contain both digital and analog embedded cores. Even though the test cost for such mixed-signal SOCs is significantly higher than that for digital SOCs, most prio...
Anuja Sehgal, Fang Liu, Sule Ozev, Krishnendu Chak...