Sciweavers

72 search results - page 9 / 15
» Fast Planning by Search in Domain Transition Graph
Sort
View
97
Voted
IJCAI
2003
15 years 1 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
AAAI
2008
15 years 1 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
121
Voted
PCM
2004
Springer
224views Multimedia» more  PCM 2004»
15 years 5 months ago
Fast and Robust Short Video Clip Search for Copy Detection
Query by video clip (QVC) has attracted wide research interests in multimedia information retrieval. In general, QVC may include feature extraction, similaritymeasure,databaseorgan...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Surendra Rang...
AAAI
2000
15 years 29 days ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
JAIR
2010
167views more  JAIR 2010»
14 years 10 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