An Asynchronous Complete Method for Distributed Constraint Optimization

Pragnesh Jay Modi, Wei Min Shen, Milind Tambe, Makoto Yokoo

Research output: Contribution to conferencePaper

103 Citations (Scopus)

Abstract

We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is significantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.

Original languageEnglish
Pages161-168
Number of pages8
Publication statusPublished - Dec 1 2003
EventProceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 - Melbourne, Vic., Australia
Duration: Jul 14 2003Jul 18 2003

Other

OtherProceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03
CountryAustralia
CityMelbourne, Vic.
Period7/14/037/18/03

Fingerprint

Multi agent systems
Polynomials

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Modi, P. J., Shen, W. M., Tambe, M., & Yokoo, M. (2003). An Asynchronous Complete Method for Distributed Constraint Optimization. 161-168. Paper presented at Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03, Melbourne, Vic., Australia.

An Asynchronous Complete Method for Distributed Constraint Optimization. / Modi, Pragnesh Jay; Shen, Wei Min; Tambe, Milind; Yokoo, Makoto.

2003. 161-168 Paper presented at Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03, Melbourne, Vic., Australia.

Research output: Contribution to conferencePaper

Modi, PJ, Shen, WM, Tambe, M & Yokoo, M 2003, 'An Asynchronous Complete Method for Distributed Constraint Optimization' Paper presented at Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03, Melbourne, Vic., Australia, 7/14/03 - 7/18/03, pp. 161-168.
Modi PJ, Shen WM, Tambe M, Yokoo M. An Asynchronous Complete Method for Distributed Constraint Optimization. 2003. Paper presented at Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03, Melbourne, Vic., Australia.
Modi, Pragnesh Jay ; Shen, Wei Min ; Tambe, Milind ; Yokoo, Makoto. / An Asynchronous Complete Method for Distributed Constraint Optimization. Paper presented at Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03, Melbourne, Vic., Australia.8 p.
@conference{2f7b4bf35d5e4395a71a1c3048cf594f,
title = "An Asynchronous Complete Method for Distributed Constraint Optimization",
abstract = "We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is significantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.",
author = "Modi, {Pragnesh Jay} and Shen, {Wei Min} and Milind Tambe and Makoto Yokoo",
year = "2003",
month = "12",
day = "1",
language = "English",
pages = "161--168",
note = "Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 ; Conference date: 14-07-2003 Through 18-07-2003",

}

TY - CONF

T1 - An Asynchronous Complete Method for Distributed Constraint Optimization

AU - Modi, Pragnesh Jay

AU - Shen, Wei Min

AU - Tambe, Milind

AU - Yokoo, Makoto

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is significantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.

AB - We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is significantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.

UR - http://www.scopus.com/inward/record.url?scp=1142305185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1142305185&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:1142305185

SP - 161

EP - 168

ER -