research-article

A complete distributed constraint optimization method for non-traditional pseudotree arrangements

Authors:

James Atlas,

Keith DeckerAuthors Info & Claims

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Article No.: 111, Pages 1 - 8

https://doi.org/10.1145/1329125.1329262

Published: 14 May 2007 Publication History

Get Access

Abstract

Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multiagent systems. Several current algorithms that solve general DCOP instances, including ADOPT and DPOP, arrange agents into a traditional pseudotree structure. We introduce an extension to the DPOP algorithm that handles an extended set of pseudotree arrangements. Our algorithm correctly solves DCOP instances for pseudotrees that include edges between nodes in separate branches. The algorithm also solves instances with traditional pseudotree arrangements using the same procedure as DPOP.

We compare our algorithm with DPOP using several metrics including the induced width of the pseudotrees, the maximum dimensionality of messages and computation, and the maximum sequential path cost through the algorithm. We prove that for some problem instances it is not possible to generate a traditional pseudotree using edge-traversal heuristics that will outperform a cross-edged pseudotree. We use multiple heuristics to generate pseudotrees and choose the best pseudotree in linear space-time complexity. For some problem instances we observe significant improvements in message and computation sizes compared to DPOP.

References

[1]

J. Liu and K. P. Sycara. Exploiting problem structure for distributed constraint optimization. In V. Lesser, editor, Proceedings of the First International Conference on Multi-Agent Systems, pages 246--254, San Francisco, CA, 1995. MIT Press.

Google Scholar

[2]

P. J. Modi, H. Jung, M. Tambe, W.-M. Shen, and S. Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. Lecture Notes in Computer Science, 2239:685--700, 2001.

Digital Library

Google Scholar

[3]

P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. An asynchronous complete method for distributed constraint optimization. In AAMAS 03, 2003.

Digital Library

Google Scholar

[4]

A. Petcu. Frodo: A framework for open/distributed constraint optimization. Technical Report No. 2006/001 2006/001, Swiss Federal Institute of Technology (EPFL), Lausanne (Switzerland), 2006. http://liawww.epfl.ch/frodo/.

Google Scholar

[5]

A. Petcu and B. Faltings. A-dpop: Approximations in distributed optimization. In poster in CP 2005, pages 802--806, Sitges, Spain, October 2005.

Google Scholar

[6]

A. Petcu and B. Faltings. Dpop: A scalable method for multiagent constraint optimization. In IJCAI 05, pages 266--271, Edinburgh, Scotland, Aug 2005.

Digital Library

Google Scholar

[7]

A. Petcu, B. Faltings, and D. Parkes. M-dpop: Faithful distributed implementation of efficient social choice problems. In AAMAS 06, pages 1397--1404, Hakodate, Japan, May 2006.

Digital Library

Google Scholar

[8]

G. Ushakov. Solving meeting scheduling problems using distributed pseudotree-optimization procedure. Master's thesis, École Polytechnique Fédérale de Lausanne, 2005.

Google Scholar

[9]

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In International Conference on Distributed Computing Systems, pages 614--621, 1992.

Crossref

Google Scholar

[10]

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: Formalization and algorithms. Knowledge and Data Engineering, 10(5):673--685, 1998.

Digital Library

Google Scholar

Cited By

View all

Dalapati PPaul K(2022)Multi-agent-based dynamic railway scheduling and optimization: a coloured petri-net modelAdvances in Computational Intelligence10.1007/s43674-022-00039-72:4Online publication date: 16-Jun-2022
https://doi.org/10.1007/s43674-022-00039-7
Chen ZHe ZHe C(2017)An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimizationApplied Intelligence10.1007/s10489-017-0905-447:3(607-623)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s10489-017-0905-4
Yato TMatsui TMatsuo H(2014)Integrating Different Incomplete DCOP Algorithms with Quality BoundsTransactions of the Japanese Society for Artificial Intelligence10.1527/tjsai.29.27729:3(277-287)Online publication date: 2014
https://doi.org/10.1527/tjsai.29.277
Show More Cited By

Index Terms

A complete distributed constraint optimization method for non-traditional pseudotree arrangements
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Multi-agent systems

Recommendations

Solving dynamic constraint optimization problems using ICHEA
ICONIP'12: Proceedings of the 19th international conference on Neural Information Processing - Volume Part III

Many real-world constrained problems have a set of predefined static constraints that can be solved by evolutionary algorithms (EAs) whereas some problems have dynamic constraints that may change over time or may be received by the problem solver at run ...
A decentralized variable ordering method for distributed constraint optimization
AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems

Many different multi-agent problems, such as distributed scheduling, can be formalized as distributed constraint optimization problems (DCOP [1]). Ordering the constraint variables is an important preprocessing step of the ADOPT algorithm [1], the state ...
A pre-processing algorithm for solving constraint satisfaction optimisation problems
SAICSIT '03: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology

A constraint satisfaction problem (CSP) involves finding values, selected from a finite domain, for all variables such that all constraints on the variables are satisfied. A constraint satisfaction optimisation problem (CSOP) is a CSP that has some ...

Comments

Information & Contributors

Information

Published In

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

May 2007

1585 pages

ISBN:9788190426275

DOI:10.1145/1329125

Conference Chairs:
Edmund Durfee
University of Michigan
,
Makoto Yokoo
Kyushu University
,
Program Chairs:
Michael Huhns
University of South Carolina
,
Onn Shehory
IBM Haifa Research Lab, Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Defense Advanced Research Projects Agency

Conference

AAMAS07

Sponsor:

AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems

May 14 - 18, 2007

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
215
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dalapati PPaul K(2022)Multi-agent-based dynamic railway scheduling and optimization: a coloured petri-net modelAdvances in Computational Intelligence10.1007/s43674-022-00039-72:4Online publication date: 16-Jun-2022
https://doi.org/10.1007/s43674-022-00039-7
Chen ZHe ZHe C(2017)An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimizationApplied Intelligence10.1007/s10489-017-0905-447:3(607-623)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s10489-017-0905-4
Yato TMatsui TMatsuo H(2014)Integrating Different Incomplete DCOP Algorithms with Quality BoundsTransactions of the Japanese Society for Artificial Intelligence10.1527/tjsai.29.27729:3(277-287)Online publication date: 2014
https://doi.org/10.1527/tjsai.29.277
Li SNegenborn RLodewijks G(2014)A Distributed Constraint Optimization Approach for Vessel Rotation PlanningComputational Logistics10.1007/978-3-319-11421-7_5(61-80)Online publication date: 2014
https://doi.org/10.1007/978-3-319-11421-7_5
Karagiannis PVouros GStergiou KSamaras N(2012)Overlay networks for task allocation and coordination in large-scale networks of cooperative agentsAutonomous Agents and Multi-Agent Systems10.1007/s10458-010-9143-424:1(26-68)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1007/s10458-010-9143-4
Vinyals MRodriguez-Aguilar JCerquides J(2011)Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive lawAutonomous Agents and Multi-Agent Systems10.1007/s10458-010-9132-722:3(439-464)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1007/s10458-010-9132-7
Silaghi MYokoo M(2009)ADOPT-ingAutonomous Agents and Multi-Agent Systems10.1007/s10458-008-9069-219:2(89-123)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s10458-008-9069-2

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Solving dynamic constraint optimization problems using ICHEA

A decentralized variable ordering method for distributed constraint optimization

A pre-processing algorithm for solving constraint satisfaction optimisation problems

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations