This paper investigates distributed estimation of an unknown vector parameter in adversarial environments. Individual agents make successive local measurements of the unknown parameter and aim at estimating the unknow...
详细信息
This paper investigates distributed estimation of an unknown vector parameter in adversarial environments. Individual agents make successive local measurements of the unknown parameter and aim at estimating the unknown parameter consistently by sharing these measurements with their neighbors over a time-varying directed communication graph even when some of the agents are under attacks and their measurements are manipulated arbitrarily. To this end, we design push-sum-based recursive algorithms to estimate the unknown parameter for linear and nonlinear measurement models, respectively. It is demonstrated that the presented algorithms can ensure that the local estimates at all the agents converge to the true value of the parameter under some mild assumptions, such as, B-strong-connectedness of the communication topologies and a topology-independent constraint on the number of compromised measurements. A numerical example is presented to illustrate the effectiveness of the proposed algorithms.
Microgrids have been attracted increasingly attention due to renewable energy integration. Multiple microgrids are often interconnected for benefiting each other. A significant challenge in operating such power system...
详细信息
Microgrids have been attracted increasingly attention due to renewable energy integration. Multiple microgrids are often interconnected for benefiting each other. A significant challenge in operating such power systems lies in the uncertainties including intermittence in renewable energy sources and load demands estimation. Sharing state variables in interconnected systems poses additional difficulties. This paper proposes a numerical solution approach to a chance constrained distributed optimisation for interconnected power systems under uncertainty. The inner-outer approximation approach is used for the solution and ALADIN for numerical implementation. An interconnected optimal power flow problem with a three-bus and a four-bus system is solved as a case study.
Let G = (V, E) be a graph and let f: V -> Z(+). An f-matching in G is a set of edges F subset of E such that every vertex v is an element of V is incident to at most f(v) edges. In this paper we will give a constan...
详细信息
Let G = (V, E) be a graph and let f: V -> Z(+). An f-matching in G is a set of edges F subset of E such that every vertex v is an element of V is incident to at most f(v) edges. In this paper we will give a constant-time distributed algorithm which approximates a maximum f-matching in bi-colored graphs of constant arboricity.
We present a distributed framework for predicting whether a planned reconfiguration step of a modular robot will mechanically overload the structure, causing it to break or lose stability under its own weight. The alg...
详细信息
We present a distributed framework for predicting whether a planned reconfiguration step of a modular robot will mechanically overload the structure, causing it to break or lose stability under its own weight. The algorithm is executed by the modular robot itself and based on a distributed iterative solution of mechanical equilibrium equations derived from a simplified model of the robot. The model treats intermodular connections as beams and assumes no-sliding contact between the modules and the ground. We also provide a procedure for simplified instability detection. The algorithm is verified in the Programmable Matter simulator VisibleSim, and in real-life experiments on the modular robotic system Blinky Blocks.
This article focuses on the distributed static estimation problem. A belief propagation (BP) based estimation algorithm is studied for its convergence and accuracy. More precisely, we give conditions under which the B...
详细信息
This article focuses on the distributed static estimation problem. A belief propagation (BP) based estimation algorithm is studied for its convergence and accuracy. More precisely, we give conditions under which the BP-based distributed estimator is guaranteed to converge and we give concrete characterizations for its accuracy. Our results reveal new insights and properties of this distributed algorithm, leading to better theoretical understanding of static distributed state estimation and new applications of the algorithm.
Many real-world data are labeled with natural orders, i.e., ordinal labels. Examples can be found in a wide variety of fields. Ordinal regression is a problem to predict ordinal labels for given patterns. There are sp...
详细信息
Many real-world data are labeled with natural orders, i.e., ordinal labels. Examples can be found in a wide variety of fields. Ordinal regression is a problem to predict ordinal labels for given patterns. There are specially developed ordinal regression methods to tackle this type of problems, but they are usually centralized. However, in some scenarios, data are collected distributedly by nodes of a network. For the purpose of privacy protection or due to some practical constraints, it is difficult or impossible to transmit the data to a fusion center for processing. Thus the centralized ordinal regression methods are inapplicable. In this paper, we formulate a distributed generalized ordered logit model for distributed ordinal regression. To estimate parameters in the model, a distributed constrained optimization formulation based on maximum likelihood methods is established. Then, we propose a projected gradient based algorithm to solve the optimization problem. We prove the consensus and the convergence of the proposed distributed algorithm. We also conduct numerical simulations on synthetic and real-world datasets. Simulation results show that the proposed distributed algorithm is comparable to the corresponding centralized algorithm. Even when the data label distribution among nodes is unbalanced, the proposed algorithm still has competitive performance.
In this article, a distributed multiobjective optimization problem is formulated for the resource allocation of network-connected multiagent systems. The framework encompasses a group of distributed decision makers in...
详细信息
In this article, a distributed multiobjective optimization problem is formulated for the resource allocation of network-connected multiagent systems. The framework encompasses a group of distributed decision makers in the subagents, where each of them possesses a local preference index. Novel distributed algorithms are proposed to solve such a problem in a distributed manner. The weighted L-p preference index is utilized in each agent since it can provide a robust Pareto solution to the problem. By using distributed fixed-time optimization methods, the L-p preference index is constructed online without specifying the unknown parameters. Then, it is proved that the problem admits a unique Pareto solution. By exploiting consensus and gradient descent techniques, asymptotic convergence to the optimal solution is established via Lyapunov theories. Distinct from most of the current works, the proposed framework does not require any prior information in the formulation process, and private data can be well protected using this distributed approach. Numerical examples are included to validate the effectiveness of the proposed algorithms.
Communication systems are affected by channel distortions. Impulsive noise is one of the significant factors for channel impairments. The standard additive white Gaussian noise (AWGN) channel model and conventional es...
详细信息
Communication systems are affected by channel distortions. Impulsive noise is one of the significant factors for channel impairments. The standard additive white Gaussian noise (AWGN) channel model and conventional estimation algorithms like least mean square (LMS) and its variants tend to be ineffective under such conditions. This paper presents a robust adaptive channel estimation algorithm using the Geman-McClure estimator in a diffusion-based distributed network. The analytical study on mean stability and mean square analysis is carried out under two separate noise statistics: Symmetric alpha-stable (S alpha S) and Bernoulli-Gaussian (BG) distribution. The computer simulations confirm the proposed algorithm's competitive robustness compared to the Maximum Correntropy Criterion and Minimum Kernel Risk Sensitive Loss algorithms at a high impulsive noise environment without exponential cost function. Further, the efficiency is also verified by simulating the bit error rate by designing a minimum mean square error (MMSE) equalizer with the estimated coefficients.
As powerline communication (PLC) technology does not require dedicated cabling and network setup, it can be used to easily connect multitude of IoT devices deployed in enterprise environments for sensing and control r...
详细信息
As powerline communication (PLC) technology does not require dedicated cabling and network setup, it can be used to easily connect multitude of IoT devices deployed in enterprise environments for sensing and control related applications. IEEE has standardized the PLC protocol in IEEE 1901, also known as HomePlug AV (HPAV) which has been widely adopted in mainstream PLC devices. A key weakness of HPAV protocol is that it does not support spectrum sharing. Currently, each link in an HPAV PLC network operates over the whole available spectrum, and only one link can operate at any time within a single collision domain. In this work, through an extensive measurement study of HPAV PLCs in a real enterprise environment using commodity off-the-shelf (COTS) HPAV PLC devices, we discover that spectrum sharing can significantly benefit enterprise level PLC networks. To this end, we propose a distributed spectrum sharing technique for enterprise HPAV PLC networks, and show that fine-grained distributed spectrum sharing on top of current HPAV MAC protocols can significantly boost the aggregated and per-link throughput, by allowing multiple PLC links to communicate concurrently, while requiring only a few modifications to the existing HPAV devices and protocols.
This study presents a fixed-time convergent algorithm to achieve distributed least square (DLS) solutions of networked linear equations. Each agent in the network only knows a subset of the equations and can only exch...
详细信息
This study presents a fixed-time convergent algorithm to achieve distributed least square (DLS) solutions of networked linear equations. Each agent in the network only knows a subset of the equations and can only exchange messages with its nearest neighbors. Unlike finite-time counterparts, the settling time of the fixed-time distributed algorithm does not depend upon the initial states, and can be preassigned according to the requirements of the task. Numerical simulations verify the theoretical results.
暂无评论