AIPS
2006
13 years 6 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...
AIPS
2006
13 years 6 months ago
2006
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...
AIPS
2006
13 years 6 months ago
2006
AIPS
2006
13 years 6 months ago
2006
We describe a domain-independent framework for plan summarization and comparison that can help a human understand both the key elements of an individual plan and important differe...
AIPS
2006
13 years 6 months ago
2006
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
AIPS
2006
13 years 6 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...
AIPS
2006
13 years 6 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
AIPS
2006
13 years 6 months ago
2006
AIPS
2006
13 years 6 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...
AIPS
2006
13 years 6 months ago
2006
The ultimate objective in planning is to construct plans for execution. However, when a plan is executed in a real environment it can encounter differences between the expected an...