Sciweavers

226 search results - page 24 / 46
» Heuristic Search Planning with BDDs
Sort
View
KI
2006
Springer
14 years 11 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
AIPS
2006
15 years 1 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman
ECAI
2004
Springer
15 years 5 months ago
Multiple Relaxations in Temporal Planning
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
Keith Halsey, Derek Long, Maria Fox
IJCAI
2001
15 years 1 months ago
Planning with Resources and Concurrency: A Forward Chaining Approach
Recently tremendous advances have been made in the performance of AI planning systems. However increased performance is only one of the prerequisites for bringing planning into th...
Fahiem Bacchus, Michael Ady
CP
2005
Springer
15 years 5 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner