Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds
نویسندگان
چکیده
Most incomplete DCOP algorithms generally do not provide any guarantees on the quality of the solutions. In this paper, we introduce a new incomplete DCOP algorithm that can provide the upper bounds of the absolute/relative errors of the solution, which can be obtained a priori/a posteriori, respectively. The evaluation results illustrate that this algorithm can obtain better quality solutions and bounds compared to existing bounded incomplete DCOP algorithms, while the run time of this algorithm is much shorter.
منابع مشابه
Pseudo-Tree Based Hybrid Algorithm for Distributed Constraint Optimization
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Considering pseudo-tree based search algorithms is important in DCOPs, since their memory requirements are polynomial in the number of agents. However, these algorithms require a large run time. Thus, how to speed up pseudo-tree based search a...
متن کاملPseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, considering faster incomplete algorithms is necessary for large-scale applications. Most incomplete algorithms generally do not provide any guarantees on the quality of solutions. Some notable exceptions are DALO, the boun...
متن کاملImprovement of efficiency in pseudo-tree based distributed best first search
Abstract— Distributed constraint optimization problem is an area of research in multi agent system. In recent years, a distributed constraint optimization algorithm, which performs best-first search in bottom up manner according to pseudo tree, was proposed. In this paper, we propose several efficient methods for the distributed bottom up best-first search. Derivation of partial solution is int...
متن کاملEfficient Methods for Pseudo-tree Based Distributed Best First Search
Abstract— Distributed constraint optimization problem is an area of research in multi agent system. In recent years, a distributed constraint optimization algorithm, which performs best-first search in bottom up manner according to pseudo tree, was proposed. In this paper, we propose several efficient methods for the distributed bottom up best-first search. Derivation of partial solution is int...
متن کاملCluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their practical applicability. Here we present some distributed algorithms for these problems when they are arranged in a tree of agents. The exact algorithm, DCTE, computes the optimal solution but requires messages of size ...
متن کامل