检索结果-内蒙古大学图书馆

International Conference on Information Fusion

作者： Colin Cros Pierre-Olivier Amblard Christophe Prieur Jean-François Da Rocha GIPSA-Lab Univ. Grenoble Alpes CNRS Grenoble France Telespazio France Toulouse France

ISBN: (数字)9781737749769

ISBN: (纸本)9798350371420

This paper introduces a new conservative fusion method to exploit the correlated components within the estimation errors. Fusion is the process of combining multiple estimates of a given state to produce a new estimate with a smaller MSE. To perform the optimal linear fusion, the (centralized) covariance associated with the errors of all estimates is required. If it is partially unknown, the optimal fusion cannot be computed. Instead, a solution is to perform a conservative fusion. A conservative fusion provides a gain and a bound on the resulting MSE matrix which guarantees that the error is not underestimated. A well-known conservative fusion is the Covariance Intersection fusion. It has been modified to exploit the uncorrelated components within the errors. In this paper, it is further extended to exploit the correlated components as well. The resulting fusion rule is integrated into standard distributed algorithms where it allows exploiting the process noise observed by all agents. The improvement is confirmed by simulations.

关键词： Estimation error Satellites Noise Complexity theory Kalman filters distributed algorithms Covariance matrices Standards

来源：评论

学校读者我要写书评

暂无评论

distributed Multiobjective Resource Allocation for Heterogeneous Systems over Directed Graph

Distributed Multiobjective Resource Allocation for Heterogen...

引用

IEEE International Conference on Unmanned Systems (ICUS)

作者： Wenzhe Yu Lan Yang Yatao Ren Yu Zhao School of Automation Northwestern Polytechnical University Xi'an China

ISBN: (数字)9798350384185

ISBN: (纸本)9798350384192

This paper investigates a distributed multiobjective resource allocation problem for heterogeneous multiagent sys-tems under directed graph. This framework contains a series of distributed decision makers, where each decision maker has a set of conflicting objective functions. We introduce a distributed algorithm so as to obtain weighting factors and the desirable points of every objective function, which are used to gain a local preference with the help of the weighted $L_{h}$ preference index within finite time. It turns out that there is a unique Pareto solution for this problem. Next, a out-degree based design law for heterogeneous systems is put forward for minimizing entire local objective functions constrained by limited resource. Finally, two numerical instances are included to validate the advantage of distributed optimization algorithms.

关键词： Accuracy Autonomous systems Directed graphs Linear programming Numerical simulation Resource management Indexes distributed algorithms Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Differentially Private distributed Algorithm for Energy Sharing Game with Generalized Demand Bidding

Differentially Private Distributed Algorithm for Energy Shar...

引用

IEEE General Meeting Power& Energy Society

作者： Haoran Liu Shunbo Lei Liang Zhang Yanting Huang Haoran Zhang Chaoyi Peng School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data China Power Dispatch and Control Center China Southern Power Grid Company Ltd. China

ISBN: (数字)9798350381832

ISBN: (纸本)9798350381849

This paper addresses a critical concern related to energy sharing among prosumers with a focus on both preserving privacy and achieving efficient resource allocation. We formulate a peer-to-peer energy-sharing market for prosumers as a generalized Nash game, and prove the existence and uniqueness of the Nash equilibrium based on variational inequality. Subsequently, we introduce a distributed algorithm to seek Nash equilibrium by integrating gradient tracking and consensus theory. Furthermore, in order to safeguard against potential linkage attacks, we propose a privacy-preserving distributed Nash-seeking strategy based on differential privacy. Simulation results demonstrate that our approach not only robustly safeguards privacy but also guarantees the realization of optimal solutions for energy allocation within prosumers.

关键词： Couplings Privacy Differential privacy Simulation Games Nash equilibrium Peer-to-peer computing Resource management distributed algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Impact of Cellular Network Delay on distributed Optimization of the Distribution Grid

Analyzing the Impact of Cellular Network Delay on Distribute...

引用

IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Adedoyin Inaolaji Filippo Malandra Department of Electrical Engineering University at Buffalo NY USA

ISBN: (数字)9798350318555

ISBN: (纸本)9798350318562

distributed optimization algorithms have revolutionized the decision-making process in distribution network management. Unlike their centralized counterparts, the effectiveness of distributed algorithms is significantly affected by the non-ideal states of communication networks used for data exchange. Hence, evaluating the resilience of distributed algorithms to communication imperfections is essential. Regarding this, this work examines the effectiveness of a distributed algorithm, named alternating direction method of multipliers (ADMM), in a three-phase unbalanced distribution system under the network delays of three popular cellular communication technologies. The performance assessment of the algorithm is done using the IEEE 123-bus test system by optimally scheduling the inverters connected to the network to achieve voltage deviation minimization. This analysis offers valuable understanding about the efficacy of the ADMM algorithm in terms of the solution quality, number of iterations, convergence rate and update frequency.

关键词： Reliability engineering Minimization Convex functions Scheduling Delays Smart grids distributed algorithms Optimization Convergence Resilience

来源：评论

学校读者我要写书评

暂无评论

distributed Maximum Consensus Over Noisy Links

Distributed Maximum Consensus Over Noisy Links

引用

European Signal Processing Conference (EUSIPCO)

作者： Ehsan Lari Reza Arablouei Naveen K. D. Venkategowda Stefan Werner Department of Electronic Systems Norwegian University of Science and Technology Trondheim Norway CSIRO's Data61 Pullenvale QLD Australia Department of Science and Technology Linköping University Norrköping Sweden

ISBN: (数字)9789464593617

ISBN: (纸本)9798331519773

We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC), for estimating the maximum value within a multi-agent network in the presence of noisy communication links. Our approach entails redefining the maximum consensus problem as a distributed optimization problem, allowing a solution using the alternating direction method of multipliers. Unlike existing algorithms that rely on multiple sets of noise-corrupted estimates, RD- MC employs a single set, enhancing both robustness and efficiency. To further mitigate the effects of link noise and improve robustness, we apply moving averaging to the local estimates. Through extensive simulations, we demonstrate that RD-MC is significantly more robust to communication link noise compared to existing maximum-consensus algorithms.

关键词： Simulation Noise Signal processing algorithms Europe Robustness Ad hoc networks Noise robustness Noise measurement distributed algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

distributed Transformations of Hamiltonian Shapes Based on Line Moves 1

引用

17th International Symposium on algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)

作者： Almethen, Abdullah Michail, Othon Potapov, Igor Univ Liverpool Dept Comp Sci Liverpool England

ISBN: (数字)9783030892401

ISBN: (纸本)9783030892395;9783030892401

We consider a discrete system of n simple indistinguishable devices, called agents, forming a connected shape S-I on a two-dimensional square grid. Agents are equipped with a linear-strength mechanism, called a line move, by which an agent can push a whole line of consecutive agents in one of the four directions in a single time-step. We study the problem of transforming an initial shape S-I into a given target shape S-F via a finite sequence of line moves in a distributed model, where each agent can observe the states of nearby agents in a Moore neighbourhood. Our main contribution is the first distributed connectivity-preserving transformation that exploits line moves within a total of O(n log(2) n) moves, which is asymptotically equivalent to that of the best-known centralised transformations. The algorithm solves the line formation problem that allows agents to form a final straight line S-L, starting from any shape S-I, whose associated graph contains a Hamiltonian path.

关键词： Line movement Discrete transformations Shape formation Reconfigurable robotics Programmable matter distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Scheduling on Line and Tree Networks with Non-Uniform Bandwidths

Distributed Algorithms for Scheduling on Line and Tree Netwo...

引用

IEEE 27th International Parallel and distributed Processing Symposium (IPDPS)

作者： Chakaravarthy, Venkatesan T. Choudhury, Anamitra R. Roy, Sambuddha Sabharwal, Yogish IBM Res New Delhi India

ISBN: (纸本)9780769549712

In this paper we study the unsplittable flow problem (UFP) on tree networks in a distributed setting. We have a set of processors (or agents) and a set of tree networks defined over some vertex set. Each processor can access a subset of the tree networks. Each edge in each of the tree networks is associated with a capacity. Each processor has a demand specified as a pair of vertices.. and.., along with a profit and a height;the processor wishes to send data between.. and.. and requires bandwidth equal to its height. Towards that goal, the processor needs to select a tree network accessible to it. A feasible solution selects a subset of demands and schedules each selected demand on a tree network accessible to the processor owning the demand. The requirement is that for any tree network and any edge in the network, the sum of heights of demands scheduled on the network and passing through the edge must not exceed the capacity offered by the edge. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distributed setting for the special case where all the edge capacities are uniform, say one unit. The main contributions of this paper is to address the general case where the edge capacities can be non-uniform and arbitrary. For this case, we present distributed algorithms with poly-logarithmic approximation ratio.

关键词： distributed algorithms network theory (graphs) processor scheduling trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

distributed Online Linear Quadratic Control for Linear Time-invariant Systems

Distributed Online Linear Quadratic Control for Linear Time-...

引用

American Control Conference (ACC)

作者： Chang, Ting-Jui Shahrampour, Shahin Texas A&M Univ Wm Michael Barnes 64 Dept Ind & Syst Engn College Stn TX 77843 USA

ISBN: (纸本)9781665441971

Classical linear quadratic (LQ) control centers around linear time-invariant (LTI) systems, where the control-state pairs introduce a quadratic cost with time-invariant parameters. Recent advancement in online optimization and control has provided novel tools to study LQ problems that are robust to time-varying cost parameters. Inspired by this line of research, we study the distributed online LQ problem for identical LTI systems. Consider a multi-agent network where each agent is modeled as an LTI system. The LTI systems are associated with decoupled, time-varying quadratic costs that are revealed sequentially. The goal of the network is to make the control sequence of all agents competitive to that of the best centralized policy in hindsight, captured by the notion of regret. We develop a distributed variant of the online LQ algorithm, which runs distributed online gradient descent with a projection to a semi-definite programming (SDP) to generate controllers. We establish a regret bound scaling as the square root of the finite time-horizon, implying that agents reach consensus as time grows. We further provide numerical experiments verifying our theoretical result.

关键词： Linear systems Tools Programming Cost function Minimization Control systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Linear time distributed swap edge algorithms

引用

INFORMATION PROCESSING LETTERS 2020年 161卷 105979-105979页

作者： Datta, A. K. Ferragina, P. Larmore, L. Pagli, L. Prencipe, G. Univ Nevada Dept Comp Sci Reno NV 89557 USA Univ Pisa Dipartimento Informat Pisa Italy

In this paper, we consider the all best swap edges problem in a distributed environment. We are given a 2-edge connected positively weighted network X, where all communication is routed through a rooted spanning tree T of X. If a tree edge e = {x, y} fails, the communication network will be disconnected. However, since X is 2-edge connected, communication can be restored by replacing e by non-tree edge e', called a swap edge of e, whose ends lie in different components of T \ {e}. Of all possible swap edges of e, we would like to choose the best, according to four different objective functions. Overall, the problem is to identify the best swap edge for every tree edge, so that in case of any edge failure, the best swap edge can be activated quickly. There are solutions to this problem for a number of cases in the literature. A major concern for all these solutions is to minimize the number of messages. However, especially in fault-transient environments, time is a crucial factor. In this paper we present a novel technique that addresses this problem from a time perspective;in fact, we present a distributed solution that works in linear time with respect to the height h of T for a number of different criteria, while retaining the optimal number of messages and O (delta(x)) space per each processor x of degree delta(x). To the best of our knowledge, there is no prior algorithm for the all best swap edges problem whose asymptotic complexity matches ours in all three measures: time, space, and number of messages. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Swap edges Edge failure distributed computing distributed algorithms Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

distributed merge forest: A new fast and scalable approach for topological analysis at scale 21

Distributed merge forest: A new fast and scalable approach f...

引用

35th ACM International Conference on Supercomputing (ICS)

作者： Huang, Xuan Klacansky, Pavol Petruzza, Steve Gyulassy, Attila Bremer, Peer-Timo Pascucci, Valerio Univ Utah SCI Inst Salt Lake City UT 84112 USA Utah State Univ Logan UT 84322 USA Lawrence Livermore Natl Lab Livermore CA 94550 USA

ISBN: (纸本)9781450383356

Topological analysis is used in several domains to identify and characterize important features in scientific data, and is now one of the established classes of techniques of proven practical use in scientific computing. The growth in parallelism and problem size tackled by modern simulations poses a particular challenge for these approaches. Fundamentally, the global encoding of topological features necessitates interprocess communication that limits their scaling. In this paper, we extend a new topological paradigm to the case of distributed computing, where the construction of a global merge tree is replaced by a distributed data structure, the merge forest, trading slower individual queries on the structure for faster end-to-end performance and scaling. Empirically, the queries that are most negatively affected also tend to have limited practical use. Our experimental results demonstrate the scalability of both the merge forest construction and the parallel queries needed in scientific workflows, and contrast this scalability with the two established alternatives that construct variations of a global tree.

关键词： distributed algorithms topological data analysis feature extraction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：