72 search results - page 1 / 15 » Fast Planning by Search in Domain Transition Graph |
AAAI
2008
13 years 7 months ago
2008
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 ...
CAEPIA
2007
Springer
13 years 9 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
AIPS
2000
13 years 6 months ago
2000
AIPS
2000
13 years 6 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
MM
2006
ACM
13 years 11 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...