Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network. It builds a tree structure by eliminating dependencies betwe...
Saved in:
| Published in | Artificial intelligence Vol. 175; no. 2; pp. 730 - 759 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Oxford
Elsevier B.V
01.02.2011
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0004-3702 1872-7921 |
| DOI | 10.1016/j.artint.2010.11.001 |
Cover
| Abstract | In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network. It builds a tree structure by eliminating dependencies between the functions and variables within the factor graph that have the least impact on solution quality. It then uses the max-sum algorithm to optimally solve the resulting tree structured constraint network, and provides a bounded approximation specific to the particular problem instance. In addition, we present two generic pruning techniques to reduce the amount of computation that agents must perform when using the max-sum algorithm. When this is combined with the above mentioned approximation algorithm, the agents are able to solve decentralised coordination problems that have very large action spaces with a low computation and communication overhead. We empirically evaluate our approach in a mobile sensor domain, where mobile agents are used to monitor and predict the state of spatial phenomena (e.g., temperature or gas concentration). Such sensors need to coordinate their movements with their direct neighbours to maximise the collective information gain, while predicting measurements at unobserved locations. When applied in this domain, our approach is able to provide solutions which are guaranteed to be within 2% of the optimal solution. Moreover, the two pruning techniques are extremely effective in decreasing the computational effort of each agent by reducing the size of the search space by up to 92%. |
|---|---|
| AbstractList | In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network. It builds a tree structure by eliminating dependencies between the functions and variables within the factor graph that have the least impact on solution quality. It then uses the max-sum algorithm to optimally solve the resulting tree structured constraint network, and provides a bounded approximation specific to the particular problem instance. In addition, we present two generic pruning techniques to reduce the amount of computation that agents must perform when using the max-sum algorithm. When this is combined with the above mentioned approximation algorithm, the agents are able to solve decentralised coordination problems that have very large action spaces with a low computation and communication overhead. We empirically evaluate our approach in a mobile sensor domain, where mobile agents are used to monitor and predict the state of spatial phenomena (e.g., temperature or gas concentration). Such sensors need to coordinate their movements with their direct neighbours to maximise the collective information gain, while predicting measurements at unobserved locations. When applied in this domain, our approach is able to provide solutions which are guaranteed to be within 2% of the optimal solution. Moreover, the two pruning techniques are extremely effective in decreasing the computational effort of each agent by reducing the size of the search space by up to 92%. |
| Author | Farinelli, A. Stranders, R. Jennings, N.R. Rogers, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Rogers fullname: Rogers, A. email: acr@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, UK – sequence: 2 givenname: A. surname: Farinelli fullname: Farinelli, A. email: af2@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, UK – sequence: 3 givenname: R. surname: Stranders fullname: Stranders, R. email: rs06r@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, UK – sequence: 4 givenname: N.R. surname: Jennings fullname: Jennings, N.R. email: nrj@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, UK |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23768925$$DView record in Pascal Francis |
| BookMark | eNqFkLtOAzEQRS0UJJLAH1Bsg6g2-LEvUyBBBAQpEg3UlmPPEke7drCdKPw9DoGGAqrRzNx7NXNGaGCdBYTOCZ4QTKqr1UT6aGycULwfkQnG5AgNSVPTvOaUDNAQY1zkrMb0BI1CWKWWcU6GaHbnNlaDzuR67d3O9DJCpkGBjV52JqSNcs5rY2U0zmZbI7O4hKyXuzxs-kx2b86buOxP0XEruwBn33WMXh_uX6azfP78-DS9neeKVU3MFWkWpQKOKddFzRtckIY1kKZM17imRNdUVwoq2ZK25QssedsuilIvClo2nLIxujzkpnPfNxCi6E1Q0HXSgtsE0VSkZCWjZVJefCtlULJrvbTKBLH26Un_ISirqxS4110fdMq7EDy0Qpn49W1CYDpBsNhTFitxoCz2lAUhIlFO5uKX-Sf_H9vNwQYJ1daAF0EZsAq08aCi0M78HfAJdlibYQ |
| CODEN | AINTBB |
| CitedBy_id | crossref_primary_10_1145_2133806_2133825 crossref_primary_10_1007_s10458_014_9255_3 crossref_primary_10_1016_j_artint_2014_03_002 crossref_primary_10_1016_j_artint_2024_104243 crossref_primary_10_1587_transinf_2016AGP0006 crossref_primary_10_1007_s10458_020_09464_9 crossref_primary_10_1145_2629559 crossref_primary_10_1007_s10458_017_9360_1 crossref_primary_10_1007_s10472_018_9582_1 crossref_primary_10_1016_j_ress_2021_108078 crossref_primary_10_1527_tjsai_29_277 crossref_primary_10_1007_s10458_018_9395_y crossref_primary_10_1007_s11227_024_06644_2 crossref_primary_10_20965_jaciii_2014_p0573 crossref_primary_10_1109_TWC_2014_2330831 crossref_primary_10_1007_s00521_023_09096_6 crossref_primary_10_1016_j_artint_2018_08_002 crossref_primary_10_1016_j_engappai_2018_02_017 crossref_primary_10_1109_TSMCA_2012_2204740 crossref_primary_10_1016_j_engappai_2023_107074 crossref_primary_10_1111_coin_12168 crossref_primary_10_1109_JSYST_2016_2614599 crossref_primary_10_1007_s10458_019_09436_8 crossref_primary_10_1109_TCNS_2018_2809963 crossref_primary_10_3934_jimo_2015_11_41 crossref_primary_10_1016_j_neunet_2017_04_004 crossref_primary_10_1007_s10462_022_10288_0 crossref_primary_10_1007_s11518_018_5365_9 crossref_primary_10_1109_JSAC_2019_2933887 crossref_primary_10_1007_s10458_024_09643_y crossref_primary_10_1016_j_comnet_2016_03_001 crossref_primary_10_7717_peerj_cs_1296 crossref_primary_10_1007_s42979_021_00650_4 crossref_primary_10_1093_comjnl_bxy021 crossref_primary_10_1007_s10462_017_9540_z crossref_primary_10_1016_j_artint_2012_10_006 crossref_primary_10_1016_j_eswa_2014_02_039 crossref_primary_10_1111_coin_12106 crossref_primary_10_1007_s10458_021_09511_z crossref_primary_10_1007_s10489_017_0905_4 crossref_primary_10_2514_1_I010512 crossref_primary_10_1007_s10458_013_9225_1 crossref_primary_10_1093_jigpal_jzaa069 crossref_primary_10_1142_S0218001423590139 crossref_primary_10_3233_IA_180037 crossref_primary_10_1007_s10458_023_09621_w crossref_primary_10_1007_s10922_017_9410_7 crossref_primary_10_1016_j_artint_2019_103212 crossref_primary_10_1109_LRA_2021_3068103 crossref_primary_10_1007_s10458_021_09506_w crossref_primary_10_1007_s10458_020_09476_5 |
| Cites_doi | 10.1145/357195.357200 10.1126/science.1136800 10.1109/TIT.2005.850085 10.1109/18.910572 10.1017/S0269888911000178 10.1109/MIS.2009.22 10.1023/B:STCO.0000021412.33763.d5 10.1613/jair.2591 10.1109/18.825794 10.1145/1102351.1102385 10.1109/ROBOT.2007.363077 10.1162/089976601750541769 10.1109/18.910585 10.1162/089976600300015880 10.1145/1754414.1754423 10.1145/28395.28421 10.1145/1160633.1160900 10.1109/IPSN.2008.25 10.1007/11600930_71 10.1109/TIT.1968.1054142 10.1007/11564751_68 10.1109/ISIT.1998.708881 10.1016/j.artint.2004.09.003 10.1145/1082473.1082631 |
| ContentType | Journal Article |
| Copyright | 2010 Elsevier B.V. 2015 INIST-CNRS |
| Copyright_xml | – notice: 2010 Elsevier B.V. – notice: 2015 INIST-CNRS |
| DBID | 6I. AAFTH AAYXX CITATION IQODW 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1016/j.artint.2010.11.001 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1872-7921 |
| EndPage | 759 |
| ExternalDocumentID | 23768925 10_1016_j_artint_2010_11_001 S0004370210001803 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c368t-c18b5ce9029d4798041838e18b3d70721d72d6ce6af1ff9b0a9ffb45db4258923 |
| IEDL.DBID | .~1 |
| ISSN | 0004-3702 |
| IngestDate | Sun Sep 28 03:58:05 EDT 2025 Mon Jul 21 09:15:39 EDT 2025 Thu Apr 24 23:03:08 EDT 2025 Wed Oct 01 06:45:44 EDT 2025 Fri Feb 23 02:31:59 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Decentralised coordination Max-sum algorithm DCOP Action Tree structured method Constraint satisfaction Tree structure Graph theory Approximation algorithm Middleware Information measure Multiagent system Decentralized control Optimal solution Pruning(tree) Software agents Localization Sensor array Gas detector Mobile computing |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c368t-c18b5ce9029d4798041838e18b3d70721d72d6ce6af1ff9b0a9ffb45db4258923 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0004370210001803 |
| PQID | 861535325 |
| PQPubID | 23500 |
| PageCount | 30 |
| ParticipantIDs | proquest_miscellaneous_861535325 pascalfrancis_primary_23768925 crossref_citationtrail_10_1016_j_artint_2010_11_001 crossref_primary_10_1016_j_artint_2010_11_001 elsevier_sciencedirect_doi_10_1016_j_artint_2010_11_001 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2011-02-01 |
| PublicationDateYYYYMMDD | 2011-02-01 |
| PublicationDate_xml | – month: 02 year: 2011 text: 2011-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Artificial intelligence |
| PublicationYear | 2011 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | E. Bowring, J. Pearce, C. Portway, M. Jain, M. Tambe, On W. Yeoh, A. Felner, S. Koenig, BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm, in: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 591–598. R. Stranders, A. Farinelli, A. Rogers, N.R. Jennings, Decentralised coordination of mobile sensors using the max-sum algorithm, in: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, 2009, pp. 299–304. Vinyals, Rodríguez-Aguilar, Cerquides (br0260) 2010 Weiss, Freeman (br0240) 2001; 13 Gershman, Meisels, Zivan (br0090) 2009; 34 Frey, Dueck (br0290) 2007; 315 Chow, Liu (br0420) 1968; 14 A. Krause, C. Guestrin, Near-optimal observation selection using submodular functions, in: Proceedings of the Twenty-Second Conference on Artificial Intelligence, 2007, pp. 1650–1655. Dechter, Kask, Larrosa (br0430) 2001; 2239 R. Zivan, Anytime local search for distributed constraint optimization, in: Proceedings of the Twenty-Third Conference on Artificial Intelligence, 2008, pp. 393–398. W. Yeoh, X. Sun, S. Koenig, Trading off solution quality for faster computation in DCOP search algorithms, in: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, 2009, pp. 354–360. Kok, Vlassis (br0200) 2006; 7 Weiss (br0310) 2000; 12 Dechter (br0250) 2003 A. Farinelli, A. Rogers, A. Petcu, N.R. Jennings, Decentralised coordination of low-power embedded devices using the max-sum algorithm, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 639–646. Aji, McEliece (br0210) 2000; 46 C. Guestrin, A. Krause, A.P. Singh, Near-optimal sensor placements in gaussian processes, in: Proceedings of the Twenty-Second International Conference on Machine Learning, 2005, pp. 265–272. A. Petcu, B. Faltings, MB-DPOP: A new memory-bounded algorithm for distributed optimization, in: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 2007, pp. 1452–1457. Cormen, Leiserson, Rivest, Stein (br0170) 2001 Modi, Shen, Tambe, Yokoo (br0050) 2005; 161 Gallager, Humblet, Spira (br0280) 1983; 5 A. Meliou, A. Krause, C. Guestrin, J.M. Hellerstein, Nonmyopic informative path planning in spatio-temporal models, in: Proceedings of the Twenty-Second Conference on, Artificial Intelligence, 2007, pp. 602–607. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 230–240. K.H. Low, J.M. Dolan, P. Khosla, Adaptive multi-robot wide-area exploration and mapping, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 23–30. Rogers, Corkill, Jennings (br0030) 2009; 24 A. Petcu, B. Faltings, A-DPOP: Approximations in distributed optimization, in: Principles and Practice of Constraint Programming, 2005, pp. 802–806. A. Chechetka, K. Sycara, No-commitment branch and bound search for distributed constraint optimization, in: Proceedings of Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 2006, pp. 1427–1429. Yedidia, Freeman, Weiss (br0450) 2004; 51 R. Mailler, V. Lesser, Solving distributed constraint optimization problems using cooperative mediation, in: Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems, 2004, pp. 438–445. T. Matsui, M.C. Silaghi, K. Hirayama, M. Yokoo, H. Matsuo, Directed soft arc consistency in pseudo trees, in: Proceedings of The Eighth International Conference on Autonomous Agents and Multiagent Systems, 2009, pp. 1065–1072. R.T. Maheswaran, J.P. Pearce, M. Tambe, Distributed algorithms for DCOP: A graphical game-based approach, in: Proceedings of the Seventeenth International Conference on Parallel and Distributed Computing Systems, 2004, pp. 432–439. Rasmussen, Williams (br0390) 2006 A. Chapman, A. Rogers, N.R. Jennings, D. Leslie, A unifying framework for iterative approximate best response algorithms for distributed constraint optimisation problems, The Knowedge Engineering Review (2011), in press. MacKay (br0220) 2003 A. Petcu, B. Faltings, DPOP: A scalable method for multiagent constraint optimization, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005, pp. 266–271. optimal distributed constraint optimization algorithms: New bounds and algorithms, in: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 607–614. Padhy, Dash, Martinez, Jennings (br0020) 2010; 6 Wainwright, Jaakkola, Willsky (br0340) 2004; 14 S.M. Aji, G.B. Horn, R.J. Mceliece, On the convergence of iterative decoding on graphs with a single cycle, in: Proceedings of the International Symposium on Information Theory, 1998, p. 276. Kschischang, Frey, Loeliger (br0320) 2001; 42 M.A. Osborne, A. Rogers, S.D. Ramchurn, S.J. Roberts, N.R. Jennings, Towards real-time information processing of sensor network data using computationally efficient multi-output gaussian processes, in: Proceedings of the Seventh International Conference on Information Processing in Sensor Networks, 2008, pp. 109–120. J.P. Pearce, M. Tambe, Quality guarantees on k-optimal solutions for distributed constraint optimization problems, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2007, pp. 1446–1451. Fitzpatrick, Meetrens (br0010) 2003 Weiss, Freeman (br0230) 2001; 47 S.M. Ali, S. Koenig, M. Tambe, Preprocessing techniques for accelerating the DCOP algorithm adopt, in: Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, 2005, pp. 1041–1048. Frey (10.1016/j.artint.2010.11.001_br0290) 2007; 315 Yedidia (10.1016/j.artint.2010.11.001_br0450) 2004; 51 Kschischang (10.1016/j.artint.2010.11.001_br0320) 2001; 42 10.1016/j.artint.2010.11.001_br0410 Weiss (10.1016/j.artint.2010.11.001_br0230) 2001; 47 Cormen (10.1016/j.artint.2010.11.001_br0170) 2001 10.1016/j.artint.2010.11.001_br0080 Gallager (10.1016/j.artint.2010.11.001_br0280) 1983; 5 10.1016/j.artint.2010.11.001_br0180 10.1016/j.artint.2010.11.001_br0060 10.1016/j.artint.2010.11.001_br0120 MacKay (10.1016/j.artint.2010.11.001_br0220) 2003 10.1016/j.artint.2010.11.001_br0440 Modi (10.1016/j.artint.2010.11.001_br0050) 2005; 161 10.1016/j.artint.2010.11.001_br0100 10.1016/j.artint.2010.11.001_br0160 10.1016/j.artint.2010.11.001_br0380 10.1016/j.artint.2010.11.001_br0040 Weiss (10.1016/j.artint.2010.11.001_br0310) 2000; 12 Rogers (10.1016/j.artint.2010.11.001_br0030) 2009; 24 10.1016/j.artint.2010.11.001_br0140 Wainwright (10.1016/j.artint.2010.11.001_br0340) 2004; 14 10.1016/j.artint.2010.11.001_br0360 Padhy (10.1016/j.artint.2010.11.001_br0020) 2010; 6 Weiss (10.1016/j.artint.2010.11.001_br0240) 2001; 13 10.1016/j.artint.2010.11.001_br0300 10.1016/j.artint.2010.11.001_br0400 Vinyals (10.1016/j.artint.2010.11.001_br0260) 2010 Dechter (10.1016/j.artint.2010.11.001_br0250) 2003 Kok (10.1016/j.artint.2010.11.001_br0200) 2006; 7 10.1016/j.artint.2010.11.001_br0190 Fitzpatrick (10.1016/j.artint.2010.11.001_br0010) 2003 10.1016/j.artint.2010.11.001_br0070 Aji (10.1016/j.artint.2010.11.001_br0210) 2000; 46 Dechter (10.1016/j.artint.2010.11.001_br0430) 2001; 2239 Rasmussen (10.1016/j.artint.2010.11.001_br0390) 2006 10.1016/j.artint.2010.11.001_br0110 10.1016/j.artint.2010.11.001_br0330 Gershman (10.1016/j.artint.2010.11.001_br0090) 2009; 34 Chow (10.1016/j.artint.2010.11.001_br0420) 1968; 14 10.1016/j.artint.2010.11.001_br0270 10.1016/j.artint.2010.11.001_br0150 10.1016/j.artint.2010.11.001_br0370 10.1016/j.artint.2010.11.001_br0130 10.1016/j.artint.2010.11.001_br0350 |
| References_xml | – reference: A. Krause, C. Guestrin, Near-optimal observation selection using submodular functions, in: Proceedings of the Twenty-Second Conference on Artificial Intelligence, 2007, pp. 1650–1655. – volume: 161 start-page: 149 year: 2005 end-page: 180 ident: br0050 article-title: ADOPT: Asynchronous distributed constraint optimization with quality guarantees publication-title: Artificial Intelligence – volume: 14 start-page: 143 year: 2004 end-page: 166 ident: br0340 article-title: Tree consistency and bounds on the performance of the max-product algorithm and its generalizations publication-title: Statistics and Computing – reference: A. Petcu, B. Faltings, A-DPOP: Approximations in distributed optimization, in: Principles and Practice of Constraint Programming, 2005, pp. 802–806. – reference: W. Yeoh, A. Felner, S. Koenig, BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm, in: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 591–598. – volume: 315 start-page: 972 year: 2007 end-page: 976 ident: br0290 article-title: Clustering by passing messages between data points publication-title: Science – volume: 34 start-page: 61 year: 2009 end-page: 88 ident: br0090 article-title: Asynchronous forward bounding for distributed cops publication-title: Journal of Artificial Intelligence Research – reference: B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 230–240. – volume: 2239 start-page: 346 year: 2001 end-page: 360 ident: br0430 article-title: A general scheme for multiple lower bound computation in constraint optimization publication-title: Principles and Practice of Constraint Programming – reference: S.M. Ali, S. Koenig, M. Tambe, Preprocessing techniques for accelerating the DCOP algorithm adopt, in: Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, 2005, pp. 1041–1048. – volume: 5 start-page: 66 year: 1983 end-page: 77 ident: br0280 article-title: A distributed algorithm for minimum-weight spanning trees publication-title: ACM Transactions on Programming Languages and Systems – reference: A. Chapman, A. Rogers, N.R. Jennings, D. Leslie, A unifying framework for iterative approximate best response algorithms for distributed constraint optimisation problems, The Knowedge Engineering Review (2011), in press. – reference: M.A. Osborne, A. Rogers, S.D. Ramchurn, S.J. Roberts, N.R. Jennings, Towards real-time information processing of sensor network data using computationally efficient multi-output gaussian processes, in: Proceedings of the Seventh International Conference on Information Processing in Sensor Networks, 2008, pp. 109–120. – reference: C. Guestrin, A. Krause, A.P. Singh, Near-optimal sensor placements in gaussian processes, in: Proceedings of the Twenty-Second International Conference on Machine Learning, 2005, pp. 265–272. – year: 2006 ident: br0390 article-title: Gaussian Processes for Machine Learning – reference: J.P. Pearce, M. Tambe, Quality guarantees on k-optimal solutions for distributed constraint optimization problems, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2007, pp. 1446–1451. – volume: 47 start-page: 723 year: 2001 end-page: 735 ident: br0230 article-title: On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs publication-title: IEEE Transactions on Information Theory – reference: A. Meliou, A. Krause, C. Guestrin, J.M. Hellerstein, Nonmyopic informative path planning in spatio-temporal models, in: Proceedings of the Twenty-Second Conference on, Artificial Intelligence, 2007, pp. 602–607. – reference: K.H. Low, J.M. Dolan, P. Khosla, Adaptive multi-robot wide-area exploration and mapping, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 23–30. – year: 2001 ident: br0170 article-title: Introduction to Algorithms – reference: -optimal distributed constraint optimization algorithms: New bounds and algorithms, in: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 607–614. – reference: R. Mailler, V. Lesser, Solving distributed constraint optimization problems using cooperative mediation, in: Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems, 2004, pp. 438–445. – volume: 24 start-page: 13 year: 2009 end-page: 17 ident: br0030 article-title: Agent technologies for sensor networks publication-title: IEEE Intelligent Systems – reference: A. Farinelli, A. Rogers, A. Petcu, N.R. Jennings, Decentralised coordination of low-power embedded devices using the max-sum algorithm, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems, 2008, pp. 639–646. – volume: 51 start-page: 2282 year: 2004 end-page: 2312 ident: br0450 article-title: Constructing free-energy approximations and generalized belief propagation algorithms publication-title: IEEE Transactions on Information Theory – volume: 6 year: 2010 ident: br0020 article-title: A utility-based adaptive sensing and multi-hop communication protocol for wireless sensor networks publication-title: ACM Transactions on Sensor Networks – reference: R. Zivan, Anytime local search for distributed constraint optimization, in: Proceedings of the Twenty-Third Conference on Artificial Intelligence, 2008, pp. 393–398. – reference: S.M. Aji, G.B. Horn, R.J. Mceliece, On the convergence of iterative decoding on graphs with a single cycle, in: Proceedings of the International Symposium on Information Theory, 1998, p. 276. – reference: E. Bowring, J. Pearce, C. Portway, M. Jain, M. Tambe, On – reference: R. Stranders, A. Farinelli, A. Rogers, N.R. Jennings, Decentralised coordination of mobile sensors using the max-sum algorithm, in: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, 2009, pp. 299–304. – reference: A. Petcu, B. Faltings, MB-DPOP: A new memory-bounded algorithm for distributed optimization, in: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 2007, pp. 1452–1457. – volume: 46 start-page: 325 year: 2000 end-page: 343 ident: br0210 article-title: The generalized distributive law publication-title: IEEE Transactions on Information Theory – volume: 7 start-page: 1789 year: 2006 end-page: 1828 ident: br0200 article-title: Collaborative multiagent reinforcement learning by payoff propagation publication-title: Journal Machine Learning Research – volume: 42 start-page: 498 year: 2001 end-page: 519 ident: br0320 article-title: Factor graphs and the sum-product algorithm publication-title: IEEE Transactions on Information Theory – reference: W. Yeoh, X. Sun, S. Koenig, Trading off solution quality for faster computation in DCOP search algorithms, in: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, 2009, pp. 354–360. – reference: A. Petcu, B. Faltings, DPOP: A scalable method for multiagent constraint optimization, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005, pp. 266–271. – reference: R.T. Maheswaran, J.P. Pearce, M. Tambe, Distributed algorithms for DCOP: A graphical game-based approach, in: Proceedings of the Seventeenth International Conference on Parallel and Distributed Computing Systems, 2004, pp. 432–439. – reference: A. Chechetka, K. Sycara, No-commitment branch and bound search for distributed constraint optimization, in: Proceedings of Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 2006, pp. 1427–1429. – year: 2003 ident: br0220 article-title: Information Theory, Inference, and Learning Algorithms – year: 2003 ident: br0250 article-title: Constraint Processing – start-page: 257 year: 2003 end-page: 293 ident: br0010 article-title: Distributed coordination through anarchic optimization publication-title: Distributed Sensor Networks: A Multiagent Perspective – volume: 14 start-page: 462 year: 1968 end-page: 467 ident: br0420 article-title: Approximating discrete probability distributions with dependence trees publication-title: IEEE Transactions on Information Theory – reference: T. Matsui, M.C. Silaghi, K. Hirayama, M. Yokoo, H. Matsuo, Directed soft arc consistency in pseudo trees, in: Proceedings of The Eighth International Conference on Autonomous Agents and Multiagent Systems, 2009, pp. 1065–1072. – volume: 12 start-page: 1 year: 2000 end-page: 41 ident: br0310 article-title: Correctness of local probability propagation in graphical models with loops publication-title: Neural Computation – volume: 13 start-page: 2173 year: 2001 end-page: 2200 ident: br0240 article-title: Correctness of belief propagation in gaussian graphical models of arbitrary topology publication-title: Neural Computation – start-page: 1 year: 2010 end-page: 26 ident: br0260 article-title: Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law publication-title: Journal of Autonomous Agents and Multi Agent Systems – start-page: 1 year: 2010 ident: 10.1016/j.artint.2010.11.001_br0260 article-title: Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law publication-title: Journal of Autonomous Agents and Multi Agent Systems – start-page: 257 year: 2003 ident: 10.1016/j.artint.2010.11.001_br0010 article-title: Distributed coordination through anarchic optimization – year: 2003 ident: 10.1016/j.artint.2010.11.001_br0220 – volume: 5 start-page: 66 issue: 1 year: 1983 ident: 10.1016/j.artint.2010.11.001_br0280 article-title: A distributed algorithm for minimum-weight spanning trees publication-title: ACM Transactions on Programming Languages and Systems doi: 10.1145/357195.357200 – ident: 10.1016/j.artint.2010.11.001_br0110 – year: 2006 ident: 10.1016/j.artint.2010.11.001_br0390 – year: 2003 ident: 10.1016/j.artint.2010.11.001_br0250 – volume: 315 start-page: 972 issue: 5814 year: 2007 ident: 10.1016/j.artint.2010.11.001_br0290 article-title: Clustering by passing messages between data points publication-title: Science doi: 10.1126/science.1136800 – volume: 2239 start-page: 346 year: 2001 ident: 10.1016/j.artint.2010.11.001_br0430 article-title: A general scheme for multiple lower bound computation in constraint optimization publication-title: Principles and Practice of Constraint Programming – ident: 10.1016/j.artint.2010.11.001_br0150 – ident: 10.1016/j.artint.2010.11.001_br0360 – volume: 51 start-page: 2282 issue: 7 year: 2004 ident: 10.1016/j.artint.2010.11.001_br0450 article-title: Constructing free-energy approximations and generalized belief propagation algorithms publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2005.850085 – volume: 42 start-page: 498 issue: 2 year: 2001 ident: 10.1016/j.artint.2010.11.001_br0320 article-title: Factor graphs and the sum-product algorithm publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.910572 – ident: 10.1016/j.artint.2010.11.001_br0040 doi: 10.1017/S0269888911000178 – ident: 10.1016/j.artint.2010.11.001_br0060 – volume: 24 start-page: 13 issue: 2 year: 2009 ident: 10.1016/j.artint.2010.11.001_br0030 article-title: Agent technologies for sensor networks publication-title: IEEE Intelligent Systems doi: 10.1109/MIS.2009.22 – volume: 14 start-page: 143 issue: 2 year: 2004 ident: 10.1016/j.artint.2010.11.001_br0340 article-title: Tree consistency and bounds on the performance of the max-product algorithm and its generalizations publication-title: Statistics and Computing doi: 10.1023/B:STCO.0000021412.33763.d5 – ident: 10.1016/j.artint.2010.11.001_br0270 – ident: 10.1016/j.artint.2010.11.001_br0100 – volume: 34 start-page: 61 year: 2009 ident: 10.1016/j.artint.2010.11.001_br0090 article-title: Asynchronous forward bounding for distributed cops publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.2591 – ident: 10.1016/j.artint.2010.11.001_br0440 – ident: 10.1016/j.artint.2010.11.001_br0140 – volume: 46 start-page: 325 issue: 2 year: 2000 ident: 10.1016/j.artint.2010.11.001_br0210 article-title: The generalized distributive law publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.825794 – ident: 10.1016/j.artint.2010.11.001_br0370 doi: 10.1145/1102351.1102385 – ident: 10.1016/j.artint.2010.11.001_br0410 doi: 10.1109/ROBOT.2007.363077 – volume: 13 start-page: 2173 issue: 10 year: 2001 ident: 10.1016/j.artint.2010.11.001_br0240 article-title: Correctness of belief propagation in gaussian graphical models of arbitrary topology publication-title: Neural Computation doi: 10.1162/089976601750541769 – volume: 47 start-page: 723 issue: 2 year: 2001 ident: 10.1016/j.artint.2010.11.001_br0230 article-title: On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.910585 – volume: 12 start-page: 1 issue: 1 year: 2000 ident: 10.1016/j.artint.2010.11.001_br0310 article-title: Correctness of local probability propagation in graphical models with loops publication-title: Neural Computation doi: 10.1162/089976600300015880 – volume: 6 issue: 3 year: 2010 ident: 10.1016/j.artint.2010.11.001_br0020 article-title: A utility-based adaptive sensing and multi-hop communication protocol for wireless sensor networks publication-title: ACM Transactions on Sensor Networks doi: 10.1145/1754414.1754423 – ident: 10.1016/j.artint.2010.11.001_br0330 doi: 10.1145/28395.28421 – ident: 10.1016/j.artint.2010.11.001_br0080 doi: 10.1145/1160633.1160900 – ident: 10.1016/j.artint.2010.11.001_br0190 – ident: 10.1016/j.artint.2010.11.001_br0130 – ident: 10.1016/j.artint.2010.11.001_br0400 doi: 10.1109/IPSN.2008.25 – ident: 10.1016/j.artint.2010.11.001_br0070 doi: 10.1007/11600930_71 – ident: 10.1016/j.artint.2010.11.001_br0120 – volume: 14 start-page: 462 issue: 3 year: 1968 ident: 10.1016/j.artint.2010.11.001_br0420 article-title: Approximating discrete probability distributions with dependence trees publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.1968.1054142 – ident: 10.1016/j.artint.2010.11.001_br0180 doi: 10.1007/11564751_68 – ident: 10.1016/j.artint.2010.11.001_br0300 doi: 10.1109/ISIT.1998.708881 – year: 2001 ident: 10.1016/j.artint.2010.11.001_br0170 – volume: 161 start-page: 149 year: 2005 ident: 10.1016/j.artint.2010.11.001_br0050 article-title: ADOPT: Asynchronous distributed constraint optimization with quality guarantees publication-title: Artificial Intelligence doi: 10.1016/j.artint.2004.09.003 – ident: 10.1016/j.artint.2010.11.001_br0380 – volume: 7 start-page: 1789 year: 2006 ident: 10.1016/j.artint.2010.11.001_br0200 article-title: Collaborative multiagent reinforcement learning by payoff propagation publication-title: Journal Machine Learning Research – ident: 10.1016/j.artint.2010.11.001_br0160 – ident: 10.1016/j.artint.2010.11.001_br0350 doi: 10.1145/1082473.1082631 |
| SSID | ssj0003991 |
| Score | 2.4037483 |
| Snippet | In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio.... |
| SourceID | proquest pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 730 |
| SubjectTerms | Agents (artificial intelligence) Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computation Computer science; control theory; systems Computer systems and distributed systems. User interface DCOP Decentralised coordination Exact sciences and technology Mathematical analysis Mathematical models Max-sum algorithm Networks Pruning Software Theoretical computing |
| Title | Bounded approximate decentralised coordination via the max-sum algorithm |
| URI | https://dx.doi.org/10.1016/j.artint.2010.11.001 https://www.proquest.com/docview/861535325 |
| Volume | 175 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-7921 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-7921 dateEnd: 20211105 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: ACRLP dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-7921 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Free and Delayed Access Journal customDbUrl: eissn: 1872-7921 dateEnd: 20211105 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: IXB dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection customDbUrl: eissn: 1872-7921 dateEnd: 20211031 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIKHN dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-7921 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AKRWK dateStart: 19700301 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA6iF0F8i-tjycFrdG3TNj3qouwqeFLYW8ljohXdXXarePK3O9OmiigI3to0Ie0kmUzSL9_H2FEKWmXKG-Gsi4S0JhVKJl7ISOO1V9K7Gm1xkw7u5NUoGS2wfnsWhmCVwfc3Pr321iHlJFjzZFqWdMaXeHlozULKcjXjp5QZqRgcv3_BPHACDqp5UlDu9vhcjfGqT-pXDcCLuDyDNMwv09PKVM_RaL5Ru_jhuOvZ6HKdrYYwkp81b7rBFmC8ydZaiQYeRuwWG5yTbBI4XnOHv5UYnwJ3ECCZ5Ryf2AmuP8tmU5C_lppjSMif9ZvAPsr10_1kVlYPz9vs7vLitj8QQTxB2DhVlbCnyiQW8l6UO5nlRDOkYgWYGruMSNFcFrnUQqr9qfe56enceyMTZ3AUKwz7dtjieDKGXcZNLwUPHgMnAAk6MjIG20ucwgIAcd5hcWuzwgZmcRK4eCpaCNlj0Vi6IEvjooOQdB0mPktNG2aNP_JnbXMU33pIgc7_j5Ldb633WR0hgvBTkw7jbXMWOLrol4kew-RlXiiKh5M4Svb-Xfs-W272oQkCc8AWq9kLHGIgU5lu3VO7bOlseD24wbvh6PwDDjb2eQ |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9wwELUQPVAJ0UKLWKDUB64uS2InzhEQaNtSTiBxs_wxhqBld8UGxKm_vTOJQ4VAQuIWObaSjO3xjPP8HmO7BVhd6uhE8CET0rtCaKmikJnF66hlDC3a4qwYXchfl-pygR31Z2EIVpl8f-fTW2-dSvaSNfdmdU1nfImXh3IWUpYjxs8PUmUlZWA__v7HeeAKnGTzpKDq_fm5FuTVHtVvOoQXkXkmbZhX1qflmZ2j1WInd_HCc7fL0clntpLiSH7QveoqW4DJGvvUazTwNGW_sNEh6SZB4C15-GONASrwAAmTWc_xjp9iAlp3u4L8obYcY0J-ax8FDlJux1fTu7q5vv3KLk6Oz49GIqknCJ8XuhF-XzvloRpmVZBlRTxDOteApXkoiRUtlFkoPBQ27sdYuaGtYnRSBYfTWGPct84WJ9MJbDDuhgVEiBg5AUiwmZM5-KEKGhsA5NWA5b3NjE_U4qRwMTY9huzGdJY2ZGnMOghKN2DiqdWso9Z4o37Zd4d5NkQMev83Wu48672nxxEkCD9VDRjvu9Pg9KJ_JnYC0_u50RQQqzxTm-9--ne2NDr_c2pOf5793mIfu01pwsNss8Xm7h6-YVTTuJ121P4D9yf3Cg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Bounded+approximate+decentralised+coordination+via+the+max-sum+algorithm&rft.jtitle=Artificial+intelligence&rft.au=Rogers%2C+A.&rft.au=Farinelli%2C+A.&rft.au=Stranders%2C+R.&rft.au=Jennings%2C+N.R.&rft.date=2011-02-01&rft.pub=Elsevier+B.V&rft.issn=0004-3702&rft.eissn=1872-7921&rft.volume=175&rft.issue=2&rft.spage=730&rft.epage=759&rft_id=info:doi/10.1016%2Fj.artint.2010.11.001&rft.externalDocID=S0004370210001803 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon |