Artificial Intelligence - Special issue on knowledge representation
Hierarchisation of the search space in temporal planning
New directions in AI planning
An Argument for a Hybrid HTN/Operator-Based Approach to Planning
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Scaling up Planning by Teasing out Resource Scheduling
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning, Scheduling And Constraint Satisfaction: From Theory To Practice
Planning, Scheduling And Constraint Satisfaction: From Theory To Practice
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Hybrid planning using flexible strategies
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
On the Construction and Evaluation of Flexible Plan-Refinement Strategies
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Thematic issue on contribution of Artificial Intelligence to Ambient Intelligence
Journal of Ambient Intelligence and Smart Environments
A framework for interactive hybrid planning
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
On the decidability of HTN planning with task insertion
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Thematic issue on contribution of Artificial Intelligence to Ambient Intelligence
Journal of Ambient Intelligence and Smart Environments
Hi-index | 0.00 |
Many real-world application domains that demand planning and scheduling support do not allow for a clear separation of these capabilities.Typically, an adequate mixture of both methodologies is required, since some aspects of the underlying planning problem imply consequences on the scheduling part and vice versa. Several integration efforts have been undertaken to couple planning and scheduling methods, most of them using separate planning and scheduling components which iteratively exchange partial solutions until both agree on a result. This paper presents a framework that provides a uniform integration of hybrid planning-the combination of operator based partial order planning and abstraction based hierarchical task network planning-and a hierarchical scheduling approach. It is based on a proper formal account of refinement planning, which allows for the formal definition of hybrid planning, scheduling, and search strategies. In a first step, the scheduling functionality is used to produce plans that comply with time restrictions and resource bounds. We show how the resulting framework is thereby able to perform novel kinds of search strategies that opportunistically interleave what used to be separate planning and scheduling processes.