The University of Southampton
University of Southampton Institutional Repository

A generic domain pruning technique for GDL-based DCOP algorithms in cooperative multi-agent systems

A generic domain pruning technique for GDL-based DCOP algorithms in cooperative multi-agent systems
A generic domain pruning technique for GDL-based DCOP algorithms in cooperative multi-agent systems
Generalized Distributive Law (GDL) based message passing algorithms,
such as Max-Sum and Bounded Max-Sum, are often used
to solve distributed constraint optimization problems in cooperative
multi-agent systems (MAS). However, scalability becomes
a challenge when these algorithms have to deal with constraint
functions with high arity or variables with a large domain size. In
either case, the ensuing exponential growth of search space can
make such algorithms computationally infeasible in practice. To
address this issue, we develop a generic domain pruning technique
that enables these algorithms to be effectively applied to larger and
more complex problems. We theoretically prove that the pruned
search space obtained by our approach does not affect the outcome
of the algorithms. Moreover, our empirical evaluation illustrates a
significant reduction of the search space, ranging from 33% to 81%,
without affecting the solution quality of the algorithms, compared
to the state-of-the-art.
1595-1603
International Foundation for Autonomous Agents and Multiagent Systems
Khan, Md. Mosaddek
6c5cfdba-17fd-4b64-9c26-97e562071ed2
Tran-Thanh, Long
e0666669-d34b-460e-950d-e8b139fab16c
Jennings, Nicholas
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Khan, Md. Mosaddek
6c5cfdba-17fd-4b64-9c26-97e562071ed2
Tran-Thanh, Long
e0666669-d34b-460e-950d-e8b139fab16c
Jennings, Nicholas
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Khan, Md. Mosaddek, Tran-Thanh, Long and Jennings, Nicholas (2018) A generic domain pruning technique for GDL-based DCOP algorithms in cooperative multi-agent systems. In 17th International Conference on Autonomous Agents and Multiagent Systems. vol. 3, International Foundation for Autonomous Agents and Multiagent Systems. 9 pp, pp. 1595-1603.

Record type: Conference or Workshop Item (Paper)

Abstract

Generalized Distributive Law (GDL) based message passing algorithms,
such as Max-Sum and Bounded Max-Sum, are often used
to solve distributed constraint optimization problems in cooperative
multi-agent systems (MAS). However, scalability becomes
a challenge when these algorithms have to deal with constraint
functions with high arity or variables with a large domain size. In
either case, the ensuing exponential growth of search space can
make such algorithms computationally infeasible in practice. To
address this issue, we develop a generic domain pruning technique
that enables these algorithms to be effectively applied to larger and
more complex problems. We theoretically prove that the pruned
search space obtained by our approach does not affect the outcome
of the algorithms. Moreover, our empirical evaluation illustrates a
significant reduction of the search space, ranging from 33% to 81%,
without affecting the solution quality of the algorithms, compared
to the state-of-the-art.

Text MM Khan, L Tran-Thanh - 2018 - A Generic Domain Pruning Technique for GDL-Based DCOP Algorithms in Cooperative Multi-Agent Systems(2) - Accepted Manuscript
Download (1MB)

More information

Accepted/In Press date: 24 January 2018
e-pub ahead of print date: 10 July 2018
Venue - Dates: 17th International Conference on Autonomous Agents and Multiagent Systems, Stockholm, Sweden, 2018-07-11 - 2018-07-13

Identifiers

Local EPrints ID: 420548
URI: https://eprints.soton.ac.uk/id/eprint/420548
PURE UUID: 873daafe-8bf3-4b4f-9b5e-6bf0465e319e
ORCID for Long Tran-Thanh: ORCID iD orcid.org/0000-0003-1617-8316

Catalogue record

Date deposited: 10 May 2018 16:30
Last modified: 27 Nov 2018 01:32

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×