SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation

摘要

Here we introduce a novel algorithm for continual optimisation of dynamic distributed constraint optimisation problems. By using techniques derived from argumentation for communication the algorithm does not need to use an ordering over the variables. The lack of a hierarchy allows the algorithm to efficiently solve dynamic problems, as well as be completely asynchronous, fault tolerant and anytime. However it prevents an ordered search, making the algorithm incomplete.