Abstract
This paper focuses on the issue of shared (vs. replicated) tasks in hierarchical plan description. We extend the notion of task networks (or plan schemas) with constraint expressions, which determine which sub-plans may be shared among parent plans, which must be shared, and which must be replicated (that is, consist of disjoint events) in the plan schema. The semantics of constraint expressions are defined by using an intermediate, simplified, level of plans, and a base level of structured events (concrete, "real-world" events). Applications for this representation are in planning, plan recognition, and in databases of plans and schedules. In all these areas, the possibility of representing a large number of events with common structure compactly, provided by the plan schemas, is beneficial.
Original language | English |
---|---|
Pages (from-to) | 257-292 |
Number of pages | 36 |
Journal | Computers and Artificial Intelligence |
Volume | 17 |
Issue number | 4 |
State | Published - 1 Dec 1998 |
Keywords
- Hierarchical plans
- Object-based schedule representation
- Plan subsumption
- Task networks
- Task sharing
- Terminological plan library
- Time maps
ASJC Scopus subject areas
- General Computer Science