Reasoning About and Dynamically Posting n-ary Constraints in ADOPT


This article describes an approach to solving distributed constraint optimization problems (DCOP) with n-ary constraints. A key instance of this problem is distributed resource-constrained task scheduling, in which limited resource capacities implicitly imply n-ary relations among the start-times of the tasks. We describe ADOPT-N, an extension of ADOPT [16… (More)

7 Figures and Tables


  • Presentations referencing similar topics