Batteries stacks are made of cells in certain series-parallel arrangements. Unfortunately, cell performance degrades over time terms capacity, internal resistance, or self-discharge rate. In addition, degradation rates heterogeneous, leading to cell-to-cell variations. Balancing systems can be used equalize those differences. Dissipative non-dissipative systems, so-called passive active balanci...

The ∆-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: Every correct process terminates its execution within a constant time ∆ (∆-timeliness), and no two processes decide differently (Uniformity). In this paper, we consider the ∆-timed uniform consensus problem in presence of fc crash processes and ft timing-faulty pr...

In this paper we study formation control of a network of communicating mobile agents with double integrator dynamics. All agents run a consensus algorithm, several leader agents are further subject to an external input. We put this problem in a control theoretical framework and show that the controllability of the entire system via external control input depends only on the controllability of t...

We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds.  2002 Elsevier Science B.V. All rights reserved.

We compare the consensus problem with the uniform consensus problem in synchronous systems. In contrast to consensus, uniform consensus is not solvable in synchronous systems with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processe...

In this paper, we introduce a distributed consensus algorithm for multi-agent systems. In contrast to the standard consensus algorithm that relies on only current states, our algorithm uses both current and outdated states. The algorithm is analyzed under an undirected communication graph. With extra outdated state information provided by the memory, the proposed algorithm converges faster whil...

We propose a distributed consensus algorithm for multi-agent systems. In contrast to the standard consensus algorithm that relies on only current states, the proposed algorithm uses both current states and outdated states stored in memory. The proposed algorithm is analyzed under an undirected communication graph. It is shown that the proposed algorithm converges faster than the standard consen...