An Efficient Algorithm For Solving Dynamic Complex DCOP Problems

File Size Format
59172_1.pdf 483Kb Adobe PDF View
Title An Efficient Algorithm For Solving Dynamic Complex DCOP Problems
Author Khanna, Sankalp; Sattar, Abdul; Hansen, David; Stantic, Bela
Publication Title Second International Workshop on Optimisation in Multi-Agent Systems
Editor Nicholas R. Jennings, Alex Rogers, Juan Antonio Rodriguez Aguilar, Alessandro Farinelli, Sarvapali D
Year Published 2009
Place of publication Washington, DC, USA
Publisher IEEE Computer Society
Abstract Multi Agent Systems and the Distributed Constraint Op- timization Problem (DCOP) formalism o®er several asyn- chronous and optimal algorithms for solving naturally dis- tributed optimization problems e±ciently. 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®ers a robust, °exible, and e±cient mechanism for modeling and solving dynamic complex problems. Ex- perimental evaluation of the algorithm shows that DCD- COP signi¯cantly outperforms ADOPT, the gold standard in search-based DCOP algorithms
Peer Reviewed No
Published No
Publisher URI http://www.optmas09.org/
Copyright Statement Copyright 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.
Conference name 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems - AAMAS
Location Budapest, Hungary
Date From 2009-05-11
Date To 2009-05-11
URI http://hdl.handle.net/10072/29968
Date Accessioned 2010-01-22
Language en_AU
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Analysis of Algorithms and Complexity
Publication Type Conference Publications (Full Written Paper - Refereed)
Publication Type Code e1d

Show simple item record

Griffith University copyright notice