Optimal Temporal Decoupling in Task Scheduling with Preferences

Conference paper (2011)
Department
Software Computer Technology (EEMCS) (TU Delft)
Copyright: Witteveen, C.
More Info
expand_more

Published Date

03-11-2011

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

BNAIC 2011: 23rd Benelux Conference on Artificial Intelligence, Ghent, Belgium, 3-4 November 2011

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Computer Technology

Abstract

Multi-agent planning and scheduling concerns finding a joint plan to achieve some set of common goals with several independent agents each aiming to find a plan or schedule for their part of the goals. To avoid conflicts in these individual plans or schedules decoupling is used. Such a decoupling entails adding local constraints for the agents such that they can schedule autonomously within those constraints, while they guarantee that a conflict-free global solution can be constructed from the individual agents’ schedules. In this paper we investigate finding an ‘optimal’ decoupling, that maximizes the sum of the agents’ preferences about their scheduling of tasks. We show using a Linear Programming (LP) approach that optimal decouplings can be found efficiently by exploiting the properties of a task scheduling instance.

Files

Endhoven_2011.pdf
(pdf | 0.448 Mb)