We analyze the consensus based optimization method proposed in Pinnau et al. (2017) one dimension. rigorously provide a quantitative error estimate between point and global minimizer of given objective function. Our analysis covers general functions; we do not require any structural assumption on

Abstract When the load inside microgrid changes, droop control maintains a stable power supply cycle of by controlling voltage and frequency at parallel network distributed generation. Since traditional usually uses fixed coefficient to adjust output active reactive power, inverter will deviate from system rating varying degrees, so new layer link is needed restore target value. Moreover, most ...

In this paper, we present two bounded cost algorithms that solve multivalued consensus using binary consensus instances. Our first algorithm uses dlog2 ne number of binary consensus instances where n is the number of processes, while our second algorithm uses at most 2k̃ binary consensus instances, where k̃ is the maximum length of the binary representation of all proposed values in the run. Both...

Consensus is a fundamental and difficult problem in fault tolerant distributed computing, and numerous consensus algorithms have been published. The paper proposes a generic consensus algorithm that highlights, through well chosen parameters, the core mechanisms of a number of well-known consensus algorithms including Paxos, OneThirdRule, PBFT, FaB Paxos. Interestingly, the generic algorithm al...

We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and ...