Show simple item record

dc.contributor.convenorNicholas R. Jenningsen_AU
dc.contributor.authorKhanna, Sankalpen_US
dc.contributor.authorSattar, Abdulen_US
dc.contributor.authorHansen, Daviden_US
dc.contributor.authorStantic, Belaen_US
dc.contributor.editorEditor exceeds RIMS limiten_US
dc.date.accessioned2017-05-03T11:26:26Z
dc.date.available2017-05-03T11:26:26Z
dc.date.issued2009en_US
dc.date.modified2010-06-03T09:25:20Z
dc.identifier.refurihttp://www.optmas09.org/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/29968
dc.description.abstractMulti 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 algorithmsen_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusNoen_AU
dc.format.extent495392 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherIEEE Computer Societyen_US
dc.publisher.placeWashington, DC, USAen_US
dc.publisher.urihttp://www.optmas09.org/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencename8th International Joint Conference on Autonomous Agents and Multi-Agent Systems - AAMASen_US
dc.relation.ispartofconferencetitleSecond International Workshop on Optimisation in Multi-Agent Systemsen_US
dc.relation.ispartofdatefrom2009-05-11en_US
dc.relation.ispartofdateto2009-05-11en_US
dc.relation.ispartoflocationBudapest, Hungaryen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchAnalysis of Algorithms and Complexityen_US
dc.subject.fieldofresearchcode080201en_US
dc.titleAn Efficient Algorithm For Solving Dynamic Complex DCOP Problemsen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 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.en_AU
gro.date.issued2009
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record