Task Structure Abstraction
Number of Authors: 3
2001 (English)Report (Refereed)
This paper explores the idea of using formalised abstraction as means of describing various operations on structured representations of planing, scheduling and resource allocation problems. We define a notion of structures on tasks, relations and resources. Each task consists of task parameters and an inductively defined substructure. The task parameters denote domain variables constrained by the relations of the structure while resources formalises resource constraints, typically presupposing the semantics of some global constraint. A notion of consistency of such structures is briefly outlined. We go on characterise properties of safeness and certain conservation properties on operations We claim that such properties are relevant to problem domains where tasks on several different types or levels of resources has to scheduled simultaneously or by partitioning the problem into several subproblems that has then to be coordinated. Finally we present, in some detail, a model of such a problem from the rail transport industry formalised as several task structures. We show how operations on these can be seen as solvers for the various subproblems but also used to transform a specification or a solution of one subproblem into a specification of an other one. We claim that properties of such operations can be used to characterise reasoning in coordination problems.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 1. , 14 p.
SICS Technical Report, ISSN 1100-3154 ; 2001:05
Formal abstraction, task scheduling, resource management, hierarchical planning, approximate methods, problem coordination, constraint programming, formal models
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22109OAI: oai:DiVA.org:ri-22109DiVA: diva2:1041651