An Efficient Algorithm For Solving Dynamic Complex DCOP Problems

Loading...
Thumbnail Image
File version
Author(s)
Khanna, Sankalp
Sattar, Abdul
Hansen, David
Stantic, Bela
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

BaezaYates, R

Berendt, B

Bertino, E

Lim, EP

Pasi, G

Date
2009
Size

495392 bytes

File type(s)

application/pdf

Location

Milan, ITALY

License
Abstract

Multi Agent Systems and the Distributed Constraint Op- timization Problem (DCOP) formalism o several asyn- chronous and optimal algorithms for solving naturally dis- tributed optimization problems eᣩently. There has been good application of this technology in addressing real world problems in areas like Sensor Networks and Meeting Schedul- ing. Most of these algorithms however exploit static tree structures and are thus not well suited to modeling and solving problems in rapidly changing domains. Also, while in theory most DCOP algorithms can be extended to han- dle complex local sub-problems, we argue that this gener- ally results in making their performance sub-optimal, and thus their application less suitable. In this paper we present new measures that emphasize the interconnectedness be- tween each agent's local and inter-agent sub-problems and use these measures to guide dynamic agent ordering during distributed constraint reasoning. The resulting algorithm, DCDCOP, os a robust, ॸible, and eᣩent mechanism for modeling and solving dynamic complex problems. Ex- perimental evaluation of the algorithm shows that DCD- COP signintly outperforms ADOPT, the gold standard in search-based DCOP algorithms

Journal Title
Conference Title

2009 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCES ON WEB INTELLIGENCE (WI) AND INTELLIGENT AGENT TECHNOLOGIES (IAT), VOL 2

Book Title
Edition
Volume

2

Issue
Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Item Access Status
Note
Access the data
Related item(s)
Subject

Analysis of Algorithms and Complexity

Persistent link to this record
Citation