Dynamic agent priotisation with penalties in distributed local search.
MetadataShow full item record
SAMBO-MAGAJI, A., ARANA, I. and AHRIZ, H., 2013. Dynamic agent priotisation with penalties in distributed local search. In: J. FILIPE and A. L. N. FRED, EDS, Proceedings of the Fifth International Conference on Agents and Artificial Intelligence (ICAART 2013), 15-18 February 2013. Lisbon: SciTePress. Pp. 276-281.
Distributed Constraint Satisfaction Problems (DisCSPs) solving techniques solve problems which are distributed over a number of agents.The distribution of the problem is required due to privacy, security or cost issues and, therefore centralised problem solving is inappropriate. Distributed local search is a framework that solves large combinatorial and optimization problems. For large problems it is often faster than distributed systematic search methods. However, local search techniques are unable to detect unsolvability and have the propensity of getting stuck at local optima. Several strategies such as weights on constraints, penalties on values and probability have been used to escape local optima. In this paper, we present an approach for escaping local optima called Dynamic Agent Prioritisation and Penalties (DynAPP) which combines penalties on variable values and dynamic variable prioritisation for the resolution of distributed constraint satisfaction problems. Empirical evaluation with instances of random, meeting scheduling and graph colouring problems have shown that this approach solved more problems in less time at the phase transition when compared with some state of the art algorithms. Further evaluation of the DynAPP approach on iteration-bounded optimisation problems showed that DynAPP is competitive.