59 search results - page 7 / 12 » aips 2006 |
95
Voted
AIPS
2006
15 years 1 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
AIPS
2006
15 years 1 months ago
2006
We describe HDL, an algorithm that learns HTN domain descriptions by examining plan traces produced by an expert problem-solver. Prior work on learning HTN methods requires that a...
84
Voted
AIPS
2006
15 years 1 months ago
2006
Much has been made of the need for academic planning research to orient towards real-world applications. In this paper, we relate our experience in adapting domain-independent pla...
AIPS
2006
15 years 1 months ago
2006
We present an architecture that provides a robust, scalable and flexible software framework for planning and scheduling systems through the use of standardized industrial-strength...
100
click to vote
AIPS
2006
15 years 1 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...