DocumentCode :
299960
Title :
Using abstractions for resource allocation
Author :
Choueiry, Berthe Y. ; Faltings, Boi
Author_Institution :
Artificial Intelligence Lab., Swiss Federal Inst. of Technol., Lausanne, Switzerland
Volume :
1
fYear :
1995
fDate :
21-27 May 1995
Firstpage :
1027
Abstract :
Abstraction is a useful technique for reducing complexity in problem solving. In this paper, the authors present two abstraction techniques and one partitioning heuristic to solve resource allocation problems. The partitioning heuristic decomposes the resource allocation problem into easy and difficult components competing for pools of resources. A hierarchy of resource pools allows conflict resolution to occur at the most appropriate level of abstraction. The temporal abstraction techniques simplify the decoupled components. They also aid the user in assessing the tightness of the problem and the types of missing resources. There are two main advantages to using the abstractions the authors propose: they rapidly provide a first solution which can be refined given more computation time, and they provide an explanation in terms of missing resources if the resource allocation problem is unsolvable
Keywords :
computational complexity; graph colouring; graph theory; problem solving; resource allocation; scheduling; abstractions; complexity reduction; conflict resolution; missing resources; partitioning heuristic; problem solving; resource allocation; temporal abstraction techniques; Airplanes; Artificial intelligence; Cities and towns; Investments; Job shop scheduling; Laboratories; Personnel; Problem-solving; Processor scheduling; Resource management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Automation, 1995. Proceedings., 1995 IEEE International Conference on
Conference_Location :
Nagoya
ISSN :
1050-4729
Print_ISBN :
0-7803-1965-6
Type :
conf
DOI :
10.1109/ROBOT.1995.525417
Filename :
525417
Link To Document :
بازگشت