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 introduced to decrease number of backtracking among agents, Synchronization control method is applied to decrease number of communication message cycles. In addition, error bounds are applied to obtain quasi optimal solution within less number of message cycles. Experiment results are shown for the efficiency evaluation of the proposed heuristics methods.
منابع مشابه
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...
متن کاملDistributed Generation Effects on Unbalanced Distribution Network Losses Considering Cost and Security Indices
Due to the increasing interest on renewable sources in recent years, the studies on integration of distributed generation to the power grid have rapidly increased. In order to minimize line losses of power systems, it is crucially important to define the size and location of local generation to be placed. Minimizing the losses in the system would bring two types of saving, in real life, one is ...
متن کاملDistributed Generation Effects on Unbalanced Distribution Network Losses Considering Cost and Security Indices
Due to the increasing interest on renewable sources in recent years, the studies on integration of distributed generation to the power grid have rapidly increased. In order to minimize line losses of power systems, it is crucially important to define the size and location of local generation to be placed. Minimizing the losses in the system would bring two types of saving, in real life, one is ...
متن کامل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...
متن کاملAn Efficient Method for Constructing a Distributed Depth-First Search Tree
We present an efficient distributed depth-first search algorithm. The algorithm in the worst case requires (1 + r)(|V | − 1) messages and (1 + r)(|V | − 1) units of time, where 0 ≤ r < 1 and |V | is the number of sites in the network. The value of r depends on the search path and the graph topology. In the best case when r = 0, the algorithm requires only |V | − 1 messages and time units. This ...
متن کامل