In this paper, we will analyze a basic class of diffusion adaptive filters based on least mean squares (LMS) algorithms. Both stability and performance analyses will be carried out under a general cooperative information condition, without such stringent conditions as statistical independency and stationarity that have been used in almost all the existing literature, and thus makes our theory applicable to stochastic systems with feedback. In comparison with the existing work, a key theoretical difficulty that needs to be overcome in this paper is to analyze the product of asymmetric correlated non-stationary random matrices, which is inherent in the structure of the diffusion type filtering algorithms. We will further demonstrate that the distributed adaptive filters can estimate a dynamic process of interest from noisy measurements by a set of sensors working in a cooperative way, in the natural scenario where none of the sensors can fulfill the estimation task individually due to insufficient information. Finally, the necessity of our cooperative information condition will also be discussed in the paper.
29 December 2020 in IEEE Transactions on Automatic Control
In this article, we consider a least-squares (LS)-based distributed algorithm build on a sensor network to estimate an unknown parameter vector of a dynamical system, where each sensor in the network has partial information only but is allowed to communicate with its neighbors. Our main task is to generalize the well-known theoretical results on the traditional LS to the current distributed case by establishing both the upper bound of the accumulated regrets of the adaptive predictor and the convergence of the distributed LS estimator, with the following key features compared with the existing literature on distributed estimation: First, our theory does not need the previously imposed independence, stationarity, or Gaussian property on the system signals, and hence is applicable to stochastic systems with feedback. Second, the cooperative excitation condition introduced and used in this article for the convergence of the distributed LS estimate is the weakest possible one, which shows that even if any individual sensor cannot estimate the unknown parameter by the traditional LS, the whole network can still fulfill the estimation task by the distributed LS.
In this article, we consider the problem of discrete-time, diffusion-based distributed parameter estimation with the agents connected via directed graphs with switching topologies and a self loop at each node. We show that, by incorporating the recently introduced dynamic regressor extension and mixing procedure to a classical gradient-descent algorithm, improved convergence properties can be achieved. In particular, it is shown that with this modification sufficient conditions for global convergence of all the estimators is that one of the sensors receives enough information to generate a consistent estimate and that this sensor is “well-connected.” The main feature of this result is that the excitation condition imposed on this distinguished sensor is strictly weaker than the classical persistent excitation requirement. The connectivity assumption is also very mild, requiring only that the union of the edges of all connectivity graphs over any time interval with an arbitrary but fixed length contains a spanning tree rooted at the information-rich node. In the case of nonswitching topologies, this assumption is satisfied by strongly connected graphs, and not only by them.
19 April 2021 in IEEE Transactions on Intelligent Transportation Systems
This paper studies the impact of stochastic load variations on distributed optimal load tracking and allocation (OLTA) problems in cyber-physical DC microgrids (MGs) for transportation electrification. Without load variations, the distributed optimization strategies developed in our earlier work can achieve convergence to global optimal solutions in a multi-objective optimization that balances fair load allocation and power loss reduction. Under persistent stochastic load variations, this paper develops distributed optimal strategies to track time-varying loads under noisy observations and establishes their convergence properties and error bounds. The limiting behavior of the errors characterizes the fundamental impact of the step size on irreducible errors due to conflict between attenuating observation noises and tracking load changes. Optimality conditions and algorithms for selecting the optimal step size are introduced to guide step size selection in practical applications. Simulation studies on real-world systems demonstrate the effectiveness of the proposed algorithms and validate the theoretical results.
25 February 2021 in IEEE Transactions on Smart Grid
Communication systems introduce uncertainties that directly impact power system management. Quantitative analysis of such impact is essential for power system reliability and resilience. This paper establishes rigorous relationships between communication packet delivery ratio and errors on optimal load tracking and allocation (OLTA) in DC microgrids (MGs). By modeling channel uncertainties using packet delivery ratio and communication network topologies, impact of communication packet loss on the distributed OLTA algorithm for DC MGs is studied. It is shown that communication packet loss directly affects the convergence rate of the distributed OLTA algorithm under intermittent renewable generations. The results of this paper quantitatively characterize a practical criterion for securing reliability of OLTA solutions under communication uncertainty. Simulation studies using a real-world DC MG are conducted to validate the theoretical findings.