A Local Stability Supported Parallel Distributed Constraint Optimization Algorithm

الملخص EN

This paper presents a new distributed constraint optimization algorithm called LSPA, which can be used to solve large scale distributed constraint optimization problem (DCOP).

Different from the access of local information in the existing algorithms, a new criterion called local stability is defined and used to evaluate which is the next agent whose value needs to be changed.

The propose of local stability opens a new research direction of refining initial solution by finding key agents which can seriously effect global solution once they modify assignments.

In addition, the construction of initial solution could be received more quickly without repeated assignment and conflict.

In order to execute parallel search, LSPA finds final solution by constantly computing local stability of compatible agents.

Experimental evaluation shows that LSPA outperforms some of the state-of-the-art incomplete distributed constraint optimization algorithms, guaranteeing better solutions received within ideal time.