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

Event-Triggered-Based distributed Cooperative Energy Management for Multienergy Systems

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第4期15卷 2008-2022页

作者： Li, Yushuai Zhang, Huaguang Liang, Xiaodong Huang, Bonan Northeastern Univ Sch Informat Sci Engn Shenyang 110004 Liaoning Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110004 Liaoning Peoples R China Mem Univ Newfoundland Dept Elect & Comp Engn St John NB A1B 3X5 Canada

This paper investigates the issues of day-ahead and real-time cooperative energy management for multienergy systems formed by many energy bodies. To address these issues, we propose an event-triggered-based distributed algorithm with some desirable features, namely, distributed execution, asynchronous communication, and independent calculation. First, the energy body, seen as both energy supplier and customer, is introduced for system model development. On this basis, energy bodies cooperate with each other to achieve the objective of maximizing the day-ahead social welfare and smoothing out the real-time loads variations as well as renewable resource fluctuations with the consideration of different timescale characteristics between electricity and heat power. To this end, the day-ahead and real-time energy management models are established and formulated as a class of distributed coupled optimization problem by felicitously converting some system coordinates. Such problems can be effectively solved by implementing the proposed algorithm. With the effort, each energy body can determine its owing optimal operations through only local communication and computation, resulting in enhanced system reliability, scalability, and privacy. Meanwhile, the designed communication strategy is event-triggered, which can dramatically reduce the communication among energy bodies. Simulations are provided to illustrate the effectiveness of the proposed models and algorithm.

关键词： distributed algorithm energy hub event-triggered multienergy system

来源：评论

学校读者我要写书评

暂无评论

A coverage-aware and energy-efficient protocol for the distributed wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2019年第Mar.期137卷 15-31页

作者： Chen, Da-Ren Chen, Lin-Chih Chen, Mu-Yen Hsu, Ming-Yang Natl Taichung Univ Sci & Technol Dept Informat Management 129Sec 3Sanmin Rd Taichung 404 Taiwan Natl Dong Hwa Univ Dept Informat Management Hualien Taiwan

Wireless sensor network (WSNs) are composed of a large number of battery-powered wireless sensors, which acquire and monitor physical data from their surroundings through self-organization. The sensors are deployed randomly in a target area where maintenance and battery replacement are difficult or even impossible. To achieve better coverage and prolong network lifetime, networks typically adopt clustering protocols with hierarchical inter-cluster topology for network management and data acquisition in WSNs. However, typical solutions require cluster re-configuration due to early death of cluster heads (CHs) and cause energy inefficiency. This paper proposes a coverage- and energy-aware protocol with intra- and inter-cluster methods called CEMST that considers the sensor node density and coverage overlapping. In addition, to adapt network dynamics while improving energy efficiency, self-stabilizing algorithm and Boruvka algorithm are applied to construct the minimum spanning trees (MST) for antra- and inter-cluster routes, respectively. Simulation results indicate that CEMST produces the balanced clustering structures and provides better coverage and longer network lifetime than previous methods.

关键词： Wireless sensor network Residual energy Dijkstra shortest path algorithm Minimum spanning tree Boruvka algorithm distributed algorithm Self-stabilizing algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Conflict-Detection and Resolution algorithms for Multiple UAVs Based on Key-Node Selection and Strategy Coordination

引用

IEEE ACCESS 2019年 7卷 42846-42858页

作者： Wan, Yu Tang, Jun Lao, Songyang Natl Univ Def Technol Coll Syst Engn Changsha 410073 Hunan Peoples R China

A distributed conflict-detection (CD) and resolution algorithm for multiple unmanned aerial vehicles based on key-node selection and strategy coordination are proposed in this paper. Each aircraft is regarded as a critical node in a complex network. A novel temporal and spatial integrated CD methodology is proposed for aircraft formations and clusters. Each node selects three candidate strategies from a pre-set pool of strategies and generates corresponding planned tracks using uncertainty modeling based on the 6 degrees-of-freedom motion. The primary combination of strategies required for coordination of the aircraft in conflict is based on the maximum-robustness principle. To address partial knowledge of the environment, a special token-allocation strategy for coordination with incomplete information is proposed in this paper. To address potential data dropouts, this study damps the solution to achieve coordination. Two extreme scenarios are constructed to examine the proposed methodology. The results showed great collision-avoidance ability in continuous conflicts with multiple aircraft in a highly dynamic 3-D environment.

关键词： Collision avoidance conflict-detection and resolution distributed algorithm strategy coordination unmanned aerial vehicle path planning

来源：评论

学校读者我要写书评

暂无评论

On a Verification Framework for Certifying distributed algorithms: distributed Checking and Consistency 1

引用

38th IFIP WG 6.1 International Conference on Formal Techniques for distributed Objects, Components, and Systems (FORTE) Held as Part of the 13th International Federated Conference on distributed Computing Techniques (DisCoTec)

作者： Voellinger, Kim Akili, Samira Humboldt Univ Berlin Germany

ISBN: (数字)9783319926124

ISBN: (纸本)9783319926124;9783319926117

A major problem in software engineering is assuring the correctness of a distributed system. A certifying distributed algorithm (CDA) computes for its input-output pair (i, o) an additional witness w - a formal argument for the correctness of (i, o). Each CDA features a witness predicate such that if the witness predicate holds for a triple (i, o, w), the input-output pair (i, o) is correct. An accompanying checker algorithm decides the witness predicate. Consequently, a user of a CDA does not have to trust the CDA but its checker algorithm. Usually, a checker is simpler and its verification is feasible. To sum up, the idea of a CDA is to adapt the underlying algorithm of a program at design-time such that it verifies its own output at runtime. While certifying sequential algorithms are well-established, there are open questions on how to apply certification to distributed algorithms. In this paper, we discuss distributed checking of a distributed witness;one challenge is that all parts of a distributed witness have to be consistent with each other. Furthermore, we present a method for formal instance verification (i.e. obtaining a machine-checked proof that a particular input-output pair is correct), and implement the method in a framework for the theorem prover COQ.

关键词： Certification distributed algorithm Formal instance verification

来源：评论

学校读者我要写书评

暂无评论

distributed Link Removal Using Local Estimation of Network Topology

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2019年第3期6卷 280-292页

作者： Gusrialdi, Azwirman Qu, Zhihua Hirche, Sandra Univ Cent Florida Dept Elect & Comp Engn Orlando FL 32816 USA Tech Univ Munich Dept Elect Engn & Informat Technol Inst Informat Oriented Control D-80290 Munich Bavaria Germany

This paper considers the problem of network structure manipulation in the absence of information on the global network topology. In particular, the problem of removing some of links is investigated in order to slow or stop the spread of disease in a network while preserving its connectivity. Existing methods solve this combinatorial problem in a centralized manner and they require the global information of network structure. In this paper, we propose a distributed design algorithm to compute a suboptimal solution to this problem efficiently by mimicking gradient based method, namely by iteratively removing one or multiple links at a time from the network. Specifically, using matrix perturbation analysis we formulate an optimization problem involving the eigenvector associated with the largest eigenvalue of the adjacency matrix and whose solution is equal to a suboptimal solution to the original problem. This strategy also enables us to overcome the combinatorial issue of the problem. distributed algorithms to estimate the eigenvector and to verify network's connectivity are then proposed which facilitate us to solve the new optimization problem. In addition, topological insights into the proposed algorithm and optimality of its solution are also discussed. Finally, the proposed distributed design method is demonstrated and evaluated via several numerical examples.

关键词： Eigenvalues and eigenfunctions Network topology Symmetric matrices Diseases distributed algorithms Perturbation methods Optimization Link removal largest eigenvalue minimization distributed algorithm matrix perturbation

来源：评论

学校读者我要写书评

暂无评论

Spatially distributed sampling and reconstruction

引用

APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS 2019年第1期47卷 109-148页

作者： Cheng, Cheng Jiang, Yingchun Sun, Qiyu Duke Univ Dept Math Durham NC 32816 USA Guilin Univ Elect Technol Sch Math & Computat Sci Guilin 541004 Guangxi Peoples R China Univ Cent Florida Dept Math Orlando FL 32816 USA

A spatially distributed network contains a large amount of agents with limited sensing, data processing, and communication capabilities. Recent technological advances have opened up possibilities to deploy spatially distributed networks for signal sampling and reconstruction. In this paper, we introduce a graph structure for a distributed sampling and reconstruction system by coupling agents in a spatially distributed network with innovative positions of signals. A fundamental problem in sampling theory is the robustness of signal reconstruction in the presence of sampling noises. For a distributed sampling and reconstruction system, the robustness could be reduced to the stability of its sensing matrix. In this paper, we split a distributed sampling and reconstruction system into a family of overlapping smaller subsystems, and we show that the stability of the sensing matrix holds if and only if its quasi restrictions to those subsystems have uniform stability. This new stability criterion could be pivotal for the design of a robust distributed sampling and reconstruction system against supplement, replacement and impairment of agents, as we only need to check the uniform stability of affected subsystems. In this paper, we also propose an exponentially convergent distributed algorithm for signal reconstruction, that provides a suboptimal approximation to the original signal in the presence of bounded sampling noises. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Spatially distributed network distributed sampling and reconstruction system Signal on a graph distributed algorithm Finite rate of innovation Beurling dimension Localized matrix Inverse-closed subalgebra

来源：评论

学校读者我要写书评

暂无评论

An Adaptive distributed Quasi-Newton Method for Power System State Estimation

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第5期10卷 5114-5124页

作者： Zheng, Weiye Wu, Wenchuan Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Tsinghua Univ State Key Lab Power Syst Dept Elect Engn Beijing 100084 Peoples R China

Multi-area state estimation (MASE) is indispensable for coordination among independent system operators in interconnected systems. In this paper, we propose an adaptive distributed quasi-Newton (A-DQN) algorithm with an optimal step length tuning strategy for MASE in electric power systems. To address the nonlinearity of the measurement model, nonlinear MASE is factorized into two linear estimation stages with a nonlinear transformation in between. A-DQN is then applied to solve the two linear estimation stages in which the decomposed solution for optimal step length is derived in closed form by exploiting the problem structure. With this method, each area performs a local state estimation with limited information exchange with its neighbors;thus, no central coordinator is needed. Based on a peer-to-peer communication paradigm, this method provides accurate estimation results and considers coupling among areas while the privacy and independence of each area remain well-preserved. Numerical tests demonstrated that the proposed algorithm outperforms MASE methods based on state-of-the-art algorithms such as the alternating direction method of multipliers, the matrix-splittingbased distributed Newton method, and the existing distributed Broyden-Fletcher-Goldfarb-Shanno algorithm.

关键词： distributed algorithm multi-area state estimation distributed quasi-Newton method adaptive step length

来源：评论

学校读者我要写书评

暂无评论

A distributed Online Pricing Strategy for Demand Response Programs

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第1期10卷 350-360页

作者： Li, Pan Wang, Hao Zhang, Baosen Univ Washington Dept Elect Engn Seattle WA 98195 USA

We study a demand response (DR) problem from utility (also referred to as operator)'s perspective with realistic settings, in which the utility faces uncertainty and limited communication. Specifically, the utility does not know the cost function of consumers and cannot have multiple rounds of information exchange with consumers. We formulate an optimization problem for the utility to minimize its operational cost considering time-varying DR targets and responses of consumers. We develop a joint online learning and pricing algorithm. In each time slot, the utility sends out a price signal to all consumers and estimates the cost functions of consumers based on their noisy responses. We measure the performance of our algorithm using regret analysis and show that our online algorithm achieves logarithmic regret with respect to the operating horizon. In addition, our algorithm employs linear regression to estimate the aggregate response of consumers, making it easy to implement in practice. Simulation experiments validate the theoretic results and show that the performance gap between our algorithm and the offline optimality decays quickly.

关键词： Demand response online strategy distributed algorithm linear regression

来源：评论

学校读者我要写书评

暂无评论

distributed Routing and Charging Scheduling Optimization for Internet of Electric Vehicles

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第1期6卷 136-148页

作者： Tang, Xiaoying Bi, Suzhi Zhang, Ying-Jun Angela Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1010 Lausanne Switzerland Shenzhen Univ Coll Informat Engn Shenzhen 518060 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China

In this paper, we consider an Internet of Electric Vehicles (IoEV) powered by heterogeneous charging facilities in the transportation network. In particular, we take into account the state-of-the-art vehicle-to-grid (V2G) charging and renewable power generation technologies implemented in the charging stations, such that the charging stations differ from each other in their energy capacities, electricity prices, and service types (i.e., with or without V2G capability). In this case, each electric vehicle (EV) user needs to decide which path to take (i.e., the routing problem) and where and how much to charge/discharge its battery at the charging stations in the chosen path (i.e., the charging scheduling problem) such that its journey can be accomplished with the minimum monetary cost and time delay. From the system operator's perspective, we formulate a joint routing and charging scheduling optimization problem for an IoEV network, and show that the problem is NP-hard in general. To tackle the NP-hardness, we propose an approximate algorithm that can achieve affordable computational complexity in large-size IoEV networks. The proposed algorithm allows the routing and charging solution to be calculated in a distributed manner by the system operator and EV users, which can effectively reduce the computational complexity at the system operator and protect the EV users' privacy and autonomy. Besides, a proximal method is introduced to improve the convergence rate of the proposed algorithm. Extensive simulations using real world data show that the proposed distributed algorithm can achieve near-optimal performance with relatively low computational complexity in different system set-ups.

关键词： Charging scheduling distributed algorithm electric vehicles (EVs) Internet of Things (IoT) routing

来源：评论

学校读者我要写书评

暂无评论

distributed Online Voltage Control in Active Distribution Networks Considering PV Curtailment

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第10期15卷 5519-5530页

作者： Li, Jiayong Xu, Zhao Zhao, Jian Zhang, Chaorui Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China Hunan Univ Hunan Key Lab Intelligent Informat Anal & Integra Changsha 410082 Hunan Peoples R China Hong Kong Polytech Univ Dept Elect Engn Hong Kong Peoples R China Shanghai Univ Elect Power Coll Elect Engn Shanghai 200090 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China

In this paper, we propose a distributed online voltage control algorithm for distribution networks with multiple photovoltaic (PV) systems based on dual-ascent method. Conventional distributed algorithms implement voltage control only when the algorithms converge. However, our proposed algorithm is able to carry out voltage control immediately. In particular, we derive a closed-form solution for PV controllers to locally update the active and reactive power set points aiming at minimizing the total loss and maintaining bus voltages within the acceptable ranges. The optimality is guaranteed and the convergence is established analytically. Moreover, our proposed algorithm only requires the information exchange between neighboring PV systems, thus reducing communication complexity. Finally, numerical tests on IEEE 37-bus distribution system verify the effectiveness and robustness of our proposed algorithm.

关键词： Voltage control Reactive power distributed algorithms Optimization Decentralized control Inverters Mathematical model distributed algorithm distribution networks (DNs) dual-ascent method online voltage control photovoltaic (PV) system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：