ACM Home Page
Please provide us with feedback. Feedback
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Full text PdfPdf (306 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 table of contents
Estoril, Portugal
SESSION: Agent cooperation table of contents
Pages 599-606  
Year of Publication: 2008
ISBN:978-0-9817381-1-6
Authors
Robert Junges  Instituto de Informática, UFRGS, P. Alegre, Brazil
Ana L. C. Bazzan  Instituto de Informática, UFRGS, P. Alegre, Brazil
Sponsors
AAAI : Association for the Advancement of Artifical Intelligence
ACM: Association for Computing Machinery
Publisher
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 67,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
E. Camponogara and W. Kraus Jr. Distributed learning agents in urban traffic control. In F. Moura-Pires and S. Abreu, editors, EPIA, pages 324--335, 2003.
 
4
C. Diakaki, M. Papageorgiou, and K. Aboudolas. A multivariable regulator approach to traffic-responsive network-wide signal control. Control Engineering Practice, 10(2):183--195, February 2002.
 
5
 
6
P. B. Hunt, D. I. Robertson, R. D. Bretherton, and R. I. Winton. SCOOT - a traffic responsive method of coordinating signals. TRRL Lab. Report 1014, Transport and Road Research Laboratory, Berkshire, 1981.
 
7
P. Lowrie. The Sydney coordinate adaptive traffic system - principles, methodology, algorithms. In Proceedings of the International Conference on Road Traffic Signalling, Sydney, Australia, 1982.
 
8
 
9
 
10
 
11
12
 
13
D. Oliveira, P. Ferreira, A. L. C. Bazzan, and F. Klügl. A swarm-based approach for selection of signal plans in urban scenarios. In Proceedings of Fourth International Workshop on Ant Colony Optimization and Swarm Intelligence - ANTS 2004, volume 3172 of Lecture Notes in Computer Science, pages 416--417, Berlin, Germany, 2004.
 
14
M. Papageorgiou, C. Diakaki, V. Dinopoulou, A. Kotsialos, and Y. Wang. Review of road traffic control strategies. Proceedings of the IEEE, 91(12):2043--2067, December 2003.
 
15
A. Petcu and B. Faltings. A scalable method for multiagent constraint optimization. In L. P. Kaelbling and A. Saffiotti, editors, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pages 266--271, Edinburgh, Scotland, August 2005. Professional Book Center.
 
16
A. Petcu and B. Faltings. MB-DPOP: A new memory-bounded algorithm for distributed optimization. In M. M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pages 1452--1457, Hyderabad, India, January 2007.
17
18
 
19
TRANSYT-7F. TRANSYT-7F User's Manual. Transportation Research Center, University of Florida, 1988.
 
20


Collaborative Colleagues:
Robert Junges: colleagues
Ana L. C. Bazzan: colleagues