AAAI Publications, Twenty-Eighth AAAI Conference on Artificial Intelligence

Font Size: 
Optimal Decoupling in Linear Constraint Systems
Cees Witteveen, Michel Wilson, Tomas Klos

Last modified: 2014-06-21

Abstract


Decomposition is a technique to obtain complete solutions by assembling independently obtained partial solutions. In particular, constraint decomposition plays an important role in distributed databases, distributed scheduling and violation detection: It enables conflict-free local decision making, while avoiding communication overloading. One of the main issues in decomposition is the loss of flexibility due to decomposition. Here, flexibility roughly refers to the freedom in choosing suitable values for the variables in order to satisfy the constraints. In this paper, we concentrate on linear constraint systems and efficient decomposition techniques for them. Using a generalization of a flexibility metric developed for Simple Temporal Networks, we show how an efficient decomposition technique for linear constraint systems can be derived that minimizes the loss of flexibility. As a by-product of this decomposition technique, we propose an intuitively attractive flexibility metric for linear constraint systems where decomposition does not incur any loss of flexibility.

Keywords


Decomposition, Linear Programming, Scheduling

Full Text: PDF