Explorative anytime local search for distributed constraint optimization

DOI10.1016/j.artint.2014.03.002zbMath1405.68334OpenAlexW1989580616MaRDI QIDQ2453721

Hilla Peled, Steven Okamoto, Roie Zivan

Publication date: 10 June 2014

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2014.03.002

zbMATH Keywords

incomplete searchdistributed constraint optimizationexploration heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Proactive Dynamic Distributed Constraint Optimization Problems ⋮ Solving distributed constraint optimization problems using logic programming ⋮ Privacy preserving solution of DCOPs by mediation ⋮ Incentive-based search for efficient equilibria of the public goods game ⋮ Governing convergence of Max-sum on DCOPs through damping and splitting ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts ⋮ Communication-Aware Local Search for Distributed Constraint Optimization

Uses Software

• CSPLib
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded approximate decentralised coordination via the max-sum algorithm
• Hamiltonian circuits in random graphs
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• The distributed breakout algorithms
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Distributed personnel scheduling -- negotiation among scheduling agents
• On Universal Restart Strategies for Backtracking Search
• BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
• The generalized distributive law
• Factor graphs and the sum-product algorithm
• Random constraint satisfaction: Flaws and structure

This page was built for publication: Explorative anytime local search for distributed constraint optimization