Distributed Constraint Optimization Problems (DCOPs) are widely used in Multi-Agent Systems for coordination and scheduling. The present paper proposes a heuristic algorithm that uses probabilistic assessment of the optimal solution in order to quickly find a solution that is not far from the optimal one. The heuristic assessment uses two passes by the agents to produce a high-quality solution. Extensive performance evaluation demonstrates that the solution of the proposed probabilistic assessment algorithm is indeed very close to the optimum, on smaller problems where this could be measured. In larger set-ups, the quality of the solution is demonstrated relatively to standard incomplete search algorithms.
|Number of pages||21|
|Journal||Annals of Mathematics and Artificial Intelligence|
|State||Published - 1 May 2018|
Bibliographical noteFunding Information:
Supported by the Lynn and William Frankel center for Computer Sciences, the Paul Ivanier Center for Robotics and Production Management, and the Milken Families Foundation Chair in Mathematics.
© 2018, Springer International Publishing AG, part of Springer Nature.
- Constraints optimization