Asynchronous Optimization for DisCOPs Academic Article uri icon

abstract

  • The basic framework of ADOPT relies on the computation of lower and upper bounds by each agent. The agents are pre-arranged (before the search) in a pseudo-tree ordering (see Section 14.1 for the definition of pseudo-trees). Each agent is responsible for computing bounds for the entire subproblem rooted at it, and reporting them to its parent. Here are some definitions that will help us understand what these bounds are:• Agent priority- between two agents that share a constraint, the one further up the tree is said to be of …

publication date

  • January 1, 2008