A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Distributed asynchronous search with private constraints (extended abstract)
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Constraint Processing
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
MDPOP: faithful distributed implementation of efficient social choice problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Superstabilizing, fault-containing distributed combinatorial optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Directed soft arc consistency in pseudo trees
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Resource constrained distributed constraint optimization with virtual variables
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Analyzing the performance of distributed algorithms
PerMIS '07 Proceedings of the 2007 Workshop on Performance Metrics for Intelligent Systems
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Journal of Artificial Intelligence Research
A study for representations of distributed cooperative search algorithms based on pseudo-trees
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Concurrent forward bounding for distributed constraint optimization problems
Artificial Intelligence
Considering Equality on Distributed Constraint Optimization Problem for Resource Supply Network
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We propose ODPOP, a new distributed algorithm for open multiagent combinatorial optimization that feature unbounded domains (Faltings & Macho-Gonzalez 2005). The ODPOP algorithm explores the same search space as the dynamic programming algorithm DPOP (Petcu & Faltings 2005b) or ADOPT (Modi et at. 2005). but does so in an incremental, best-first fashion suitable for open problems. ODPOP has several advantages over DPOP. First, it uses messages whose size only grows linearly with the treewidth of the problem. Second, by letting agents explore values in a best-first order, it avoids incurring always the worst case complexity as DPOP, and on average it saves a significant amount of computation and information exchange. To show the merits of our approach, we report on experiments with practically sized distributed meeting scheduling problems on a multiagent system.