IDB-ADOPT: A Depth-First Search DCOP Algorithm

DOI10.1007/978-3-642-03251-6_9MaRDI QIDQ5191411zbMATH OpenOpenAlexFDO

Authors William Yeoh, Ariel Felner, Sven Koenig

Publication date 6 August 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03251-6_9

zbMATH Keywords

ADOPTDCOPdistributed constraint optimizationdistributed search algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• Asynchronous breadth-first search DCOP algorithm
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• scientific article; zbMATH DE number 5547971
• Concurrent forward bounding for distributed constraint optimization problems

Cites work

• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Generalized best-first search strategies and the optimality of A*
• scientific article; zbMATH DE number 1999062 (Why is no real title available?)
• Linear-space best-first search
• Performance of linear-space search algorithms

Cited in

(10)

• IDB-ADOPT
• Adding laziness in BnB-ADOPT\(^+\)
• Explorative anytime local search for distributed constraint optimization
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Connecting BnB-ADOPT with soft arc consistency: initial results
• Removing redundant messages in n-ary BnB-ADOPT
• Partial cooperation in multi-agent local search
• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• Asynchronous breadth-first search DCOP algorithm
• Counterexamples and amendments to the termination and optimality of ADOPT-based algorithms

This page was built for publication: IDB-ADOPT: A Depth-First Search DCOP Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191411)